./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 a218bb67596641a4ce71d6987e627686ed630ab4299f0e9b54dfa98d78549c82 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:29:46,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:29:46,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:29:46,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:29:46,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:29:46,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:29:47,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:29:47,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:29:47,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:29:47,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:29:47,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:29:47,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:29:47,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:29:47,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:29:47,003 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:29:47,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:29:47,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:29:47,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:29:47,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:29:47,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:29:47,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:29:47,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:29:47,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:29:47,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:29:47,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:29:47,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:29:47,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:29:47,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:29:47,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:29:47,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:29:47,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:29:47,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:29:47,006 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/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 -> a218bb67596641a4ce71d6987e627686ed630ab4299f0e9b54dfa98d78549c82 [2025-03-03 14:29:47,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:29:47,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:29:47,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:29:47,244 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:29:47,244 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:29:47,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c [2025-03-03 14:29:48,346 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e358d6050/eb1b33324bd949bf8ab9f3a39c3a464e/FLAGfc9362586 [2025-03-03 14:29:48,615 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:29:48,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c [2025-03-03 14:29:48,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e358d6050/eb1b33324bd949bf8ab9f3a39c3a464e/FLAGfc9362586 [2025-03-03 14:29:48,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e358d6050/eb1b33324bd949bf8ab9f3a39c3a464e [2025-03-03 14:29:48,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:29:48,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:29:48,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:29:48,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:29:48,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:29:48,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:48,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40242edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48, skipping insertion in model container [2025-03-03 14:29:48,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:48,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:29:48,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c[3241,3254] [2025-03-03 14:29:48,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:29:48,898 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:29:48,904 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2025-03-03 14:29:48,905 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [160] [2025-03-03 14:29:48,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] [2025-03-03 14:29:48,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [273] [2025-03-03 14:29:48,906 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [308] [2025-03-03 14:29:48,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [379] [2025-03-03 14:29:48,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [745] [2025-03-03 14:29:48,907 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [987] [2025-03-03 14:29:48,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product60.cil.c[3241,3254] [2025-03-03 14:29:48,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:29:48,981 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:29:48,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48 WrapperNode [2025-03-03 14:29:48,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:29:48,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:29:48,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:29:48,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:29:48,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:48,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,016 INFO L138 Inliner]: procedures = 59, calls = 104, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 226 [2025-03-03 14:29:49,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:29:49,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:29:49,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:29:49,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:29:49,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,037 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-03-03 14:29:49,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:29:49,053 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:29:49,054 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:29:49,054 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:29:49,055 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (1/1) ... [2025-03-03 14:29:49,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:29:49,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:29:49,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:29:49,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:29:49,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:29:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-03 14:29:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-03 14:29:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:29:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:29:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:29:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:29:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-03 14:29:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-03 14:29:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-03-03 14:29:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-03-03 14:29:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-03 14:29:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-03 14:29:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-03-03 14:29:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-03-03 14:29:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:29:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-03 14:29:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-03 14:29:49,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:29:49,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:29:49,157 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:29:49,161 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:29:49,279 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L157-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~3#1; [2025-03-03 14:29:49,279 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L961-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~13#1; [2025-03-03 14:29:49,279 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L887-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~11#1; [2025-03-03 14:29:49,311 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: #res := ~retValue_acc~0; [2025-03-03 14:29:49,359 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L305-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-03-03 14:29:49,359 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L270-1: main_#res#1 := main_~retValue_acc~4#1; [2025-03-03 14:29:49,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L878-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~10#1; [2025-03-03 14:29:49,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L942-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~12#1; [2025-03-03 14:29:49,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L148-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~2#1; [2025-03-03 14:29:49,420 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-03 14:29:49,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:29:49,430 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:29:49,430 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:29:49,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:29:49 BoogieIcfgContainer [2025-03-03 14:29:49,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:29:49,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:29:49,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:29:49,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:29:49,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:29:48" (1/3) ... [2025-03-03 14:29:49,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7abcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:29:49, skipping insertion in model container [2025-03-03 14:29:49,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:29:48" (2/3) ... [2025-03-03 14:29:49,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7abcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:29:49, skipping insertion in model container [2025-03-03 14:29:49,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:29:49" (3/3) ... [2025-03-03 14:29:49,438 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product60.cil.c [2025-03-03 14:29:49,450 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:29:49,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec2_product60.cil.c that has 9 procedures, 100 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 14:29:49,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:29:49,504 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;@763c4a66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:29:49,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:29:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 76 states have (on average 1.355263157894737) internal successors, (103), 85 states have internal predecessors, (103), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 14:29:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:29:49,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:49,516 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-03-03 14:29:49,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:49,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1831206066, now seen corresponding path program 1 times [2025-03-03 14:29:49,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882650216] [2025-03-03 14:29:49,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:49,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:29:49,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:29:49,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:49,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:29:49,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:49,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882650216] [2025-03-03 14:29:49,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882650216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:49,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:49,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:29:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150345644] [2025-03-03 14:29:49,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:49,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:29:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:49,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:29:49,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:29:49,702 INFO L87 Difference]: Start difference. First operand has 100 states, 76 states have (on average 1.355263157894737) internal successors, (103), 85 states have internal predecessors, (103), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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-03-03 14:29:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:49,720 INFO L93 Difference]: Finished difference Result 191 states and 256 transitions. [2025-03-03 14:29:49,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:29:49,721 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-03-03 14:29:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:49,726 INFO L225 Difference]: With dead ends: 191 [2025-03-03 14:29:49,726 INFO L226 Difference]: Without dead ends: 91 [2025-03-03 14:29:49,728 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-03-03 14:29:49,732 INFO L435 NwaCegarLoop]: 127 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, 127 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-03-03 14:29:49,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-03 14:29:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-03 14:29:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 14:29:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2025-03-03 14:29:49,765 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 25 [2025-03-03 14:29:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:49,765 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2025-03-03 14:29:49,766 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-03-03 14:29:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2025-03-03 14:29:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 14:29:49,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:49,769 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-03-03 14:29:49,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:29:49,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:49,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1553339866, now seen corresponding path program 1 times [2025-03-03 14:29:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:49,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658419399] [2025-03-03 14:29:49,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:49,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:49,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 14:29:49,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 14:29:49,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:49,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:29:49,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:49,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658419399] [2025-03-03 14:29:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658419399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:49,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:49,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:29:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086861434] [2025-03-03 14:29:49,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:49,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:29:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:49,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:29:49,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:29:49,869 INFO L87 Difference]: Start difference. First operand 91 states and 118 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-03-03 14:29:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:49,890 INFO L93 Difference]: Finished difference Result 143 states and 185 transitions. [2025-03-03 14:29:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:29:49,891 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-03-03 14:29:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:49,892 INFO L225 Difference]: With dead ends: 143 [2025-03-03 14:29:49,893 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 14:29:49,893 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-03-03 14:29:49,894 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 189 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-03-03 14:29:49,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 14:29:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 14:29:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 71 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 14:29:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2025-03-03 14:29:49,903 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 26 [2025-03-03 14:29:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:49,904 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2025-03-03 14:29:49,904 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-03-03 14:29:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2025-03-03 14:29:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 14:29:49,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:49,905 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] [2025-03-03 14:29:49,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:29:49,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:49,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1640063844, now seen corresponding path program 1 times [2025-03-03 14:29:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:49,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401344093] [2025-03-03 14:29:49,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:49,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 14:29:49,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 14:29:49,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:49,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:29:49,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:49,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401344093] [2025-03-03 14:29:49,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401344093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:49,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:29:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702302415] [2025-03-03 14:29:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:49,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:29:49,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:49,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:29:49,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:29:49,988 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03-03 14:29:50,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:50,024 INFO L93 Difference]: Finished difference Result 228 states and 301 transitions. [2025-03-03 14:29:50,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:29:50,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 30 [2025-03-03 14:29:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:50,026 INFO L225 Difference]: With dead ends: 228 [2025-03-03 14:29:50,026 INFO L226 Difference]: Without dead ends: 154 [2025-03-03 14:29:50,028 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-03-03 14:29:50,030 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 98 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:50,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 216 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-03 14:29:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-03-03 14:29:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 114 states have (on average 1.3596491228070176) internal successors, (155), 129 states have internal predecessors, (155), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 14:29:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 199 transitions. [2025-03-03 14:29:50,054 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 199 transitions. Word has length 30 [2025-03-03 14:29:50,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:50,054 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 199 transitions. [2025-03-03 14:29:50,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03-03 14:29:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 199 transitions. [2025-03-03 14:29:50,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 14:29:50,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:50,055 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] [2025-03-03 14:29:50,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:29:50,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:50,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash 602603632, now seen corresponding path program 1 times [2025-03-03 14:29:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:50,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620448973] [2025-03-03 14:29:50,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:50,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 14:29:50,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 14:29:50,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:50,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:29:50,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:50,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620448973] [2025-03-03 14:29:50,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620448973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:50,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:50,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:29:50,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963084170] [2025-03-03 14:29:50,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:50,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:29:50,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:50,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:29:50,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:29:50,172 INFO L87 Difference]: Start difference. First operand 151 states and 199 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:29:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:50,282 INFO L93 Difference]: Finished difference Result 377 states and 508 transitions. [2025-03-03 14:29:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:29:50,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2025-03-03 14:29:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:50,289 INFO L225 Difference]: With dead ends: 377 [2025-03-03 14:29:50,289 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 14:29:50,289 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-03-03 14:29:50,290 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 56 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:50,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 362 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:29:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 14:29:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2025-03-03 14:29:50,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 176 states have (on average 1.3181818181818181) internal successors, (232), 193 states have internal predecessors, (232), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2025-03-03 14:29:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 300 transitions. [2025-03-03 14:29:50,321 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 300 transitions. Word has length 33 [2025-03-03 14:29:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:50,322 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 300 transitions. [2025-03-03 14:29:50,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:29:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 300 transitions. [2025-03-03 14:29:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 14:29:50,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:50,325 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] [2025-03-03 14:29:50,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:29:50,326 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:50,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:50,327 INFO L85 PathProgramCache]: Analyzing trace with hash 349364993, now seen corresponding path program 1 times [2025-03-03 14:29:50,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:50,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887842193] [2025-03-03 14:29:50,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:50,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 14:29:50,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:29:50,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:50,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:29:50,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:50,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887842193] [2025-03-03 14:29:50,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887842193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:50,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:50,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:29:50,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012615206] [2025-03-03 14:29:50,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:50,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:29:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:50,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:29:50,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:29:50,430 INFO L87 Difference]: Start difference. First operand 233 states and 300 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, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:29:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:50,464 INFO L93 Difference]: Finished difference Result 464 states and 616 transitions. [2025-03-03 14:29:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:29:50,465 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, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2025-03-03 14:29:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:50,467 INFO L225 Difference]: With dead ends: 464 [2025-03-03 14:29:50,467 INFO L226 Difference]: Without dead ends: 239 [2025-03-03 14:29:50,467 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-03-03 14:29:50,468 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:50,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-03 14:29:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-03-03 14:29:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 182 states have (on average 1.3076923076923077) internal successors, (238), 199 states have internal predecessors, (238), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2025-03-03 14:29:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 306 transitions. [2025-03-03 14:29:50,499 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 306 transitions. Word has length 52 [2025-03-03 14:29:50,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:50,500 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 306 transitions. [2025-03-03 14:29:50,500 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, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:29:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 306 transitions. [2025-03-03 14:29:50,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 14:29:50,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:50,504 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] [2025-03-03 14:29:50,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:29:50,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:50,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1310979010, now seen corresponding path program 1 times [2025-03-03 14:29:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:50,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050332884] [2025-03-03 14:29:50,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:50,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 14:29:50,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:29:50,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:50,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:29:50,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:50,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050332884] [2025-03-03 14:29:50,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050332884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:50,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:29:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205728563] [2025-03-03 14:29:50,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:50,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:29:50,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:50,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:29:50,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:29:50,581 INFO L87 Difference]: Start difference. First operand 239 states and 306 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, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:29:50,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:50,615 INFO L93 Difference]: Finished difference Result 474 states and 626 transitions. [2025-03-03 14:29:50,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:29:50,616 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, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2025-03-03 14:29:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:50,618 INFO L225 Difference]: With dead ends: 474 [2025-03-03 14:29:50,618 INFO L226 Difference]: Without dead ends: 243 [2025-03-03 14:29:50,619 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-03-03 14:29:50,621 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:50,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-03 14:29:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-03-03 14:29:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 203 states have internal predecessors, (242), 30 states have call successors, (30), 26 states have call predecessors, (30), 26 states have return successors, (38), 27 states have call predecessors, (38), 30 states have call successors, (38) [2025-03-03 14:29:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 310 transitions. [2025-03-03 14:29:50,640 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 310 transitions. Word has length 52 [2025-03-03 14:29:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:50,640 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 310 transitions. [2025-03-03 14:29:50,640 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, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:29:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 310 transitions. [2025-03-03 14:29:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 14:29:50,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:50,641 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] [2025-03-03 14:29:50,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:29:50,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:50,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1597784892, now seen corresponding path program 1 times [2025-03-03 14:29:50,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:50,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567444737] [2025-03-03 14:29:50,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:50,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 14:29:50,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:29:50,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:50,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:29:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:50,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567444737] [2025-03-03 14:29:50,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567444737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:50,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:50,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:29:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865225393] [2025-03-03 14:29:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:50,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:29:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:50,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:29:50,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:29:50,737 INFO L87 Difference]: Start difference. First operand 243 states and 310 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:29:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:50,858 INFO L93 Difference]: Finished difference Result 783 states and 1029 transitions. [2025-03-03 14:29:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:29:50,859 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2025-03-03 14:29:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:50,862 INFO L225 Difference]: With dead ends: 783 [2025-03-03 14:29:50,862 INFO L226 Difference]: Without dead ends: 548 [2025-03-03 14:29:50,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:29:50,865 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 131 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:50,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 334 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:29:50,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-03 14:29:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 536. [2025-03-03 14:29:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 407 states have (on average 1.2776412776412776) internal successors, (520), 438 states have internal predecessors, (520), 66 states have call successors, (66), 60 states have call predecessors, (66), 62 states have return successors, (102), 62 states have call predecessors, (102), 66 states have call successors, (102) [2025-03-03 14:29:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 688 transitions. [2025-03-03 14:29:50,906 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 688 transitions. Word has length 52 [2025-03-03 14:29:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:50,907 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 688 transitions. [2025-03-03 14:29:50,907 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:29:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 688 transitions. [2025-03-03 14:29:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:29:50,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:50,908 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] [2025-03-03 14:29:50,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:29:50,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -182055258, now seen corresponding path program 1 times [2025-03-03 14:29:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:50,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259707416] [2025-03-03 14:29:50,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:50,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:29:50,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:29:50,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:50,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:29:51,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259707416] [2025-03-03 14:29:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259707416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:51,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:51,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:29:51,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623934905] [2025-03-03 14:29:51,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:51,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:29:51,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:51,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:29:51,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:29:51,015 INFO L87 Difference]: Start difference. First operand 536 states and 688 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:29:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:51,212 INFO L93 Difference]: Finished difference Result 1560 states and 2079 transitions. [2025-03-03 14:29:51,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:29:51,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-03-03 14:29:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:51,217 INFO L225 Difference]: With dead ends: 1560 [2025-03-03 14:29:51,218 INFO L226 Difference]: Without dead ends: 1032 [2025-03-03 14:29:51,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:29:51,220 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 88 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:51,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 681 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:29:51,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-03 14:29:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2025-03-03 14:29:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 775 states have (on average 1.2529032258064516) internal successors, (971), 832 states have internal predecessors, (971), 132 states have call successors, (132), 120 states have call predecessors, (132), 124 states have return successors, (220), 124 states have call predecessors, (220), 132 states have call successors, (220) [2025-03-03 14:29:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1323 transitions. [2025-03-03 14:29:51,278 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1323 transitions. Word has length 56 [2025-03-03 14:29:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:51,278 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1323 transitions. [2025-03-03 14:29:51,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:29:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1323 transitions. [2025-03-03 14:29:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 14:29:51,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:51,283 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:51,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:29:51,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:51,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2133997002, now seen corresponding path program 1 times [2025-03-03 14:29:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:51,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632694658] [2025-03-03 14:29:51,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:51,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:29:51,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:29:51,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:51,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:29:51,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:51,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632694658] [2025-03-03 14:29:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632694658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:51,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:29:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493015504] [2025-03-03 14:29:51,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:51,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:29:51,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:51,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:29:51,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:29:51,348 INFO L87 Difference]: Start difference. First operand 1032 states and 1323 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 14:29:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:51,441 INFO L93 Difference]: Finished difference Result 1743 states and 2229 transitions. [2025-03-03 14:29:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:29:51,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-03-03 14:29:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:51,446 INFO L225 Difference]: With dead ends: 1743 [2025-03-03 14:29:51,447 INFO L226 Difference]: Without dead ends: 719 [2025-03-03 14:29:51,449 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-03-03 14:29:51,451 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 129 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:51,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 251 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-03-03 14:29:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 707. [2025-03-03 14:29:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 534 states have (on average 1.2340823970037453) internal successors, (659), 573 states have internal predecessors, (659), 88 states have call successors, (88), 82 states have call predecessors, (88), 84 states have return successors, (137), 86 states have call predecessors, (137), 88 states have call successors, (137) [2025-03-03 14:29:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 884 transitions. [2025-03-03 14:29:51,492 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 884 transitions. Word has length 90 [2025-03-03 14:29:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:51,492 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 884 transitions. [2025-03-03 14:29:51,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 14:29:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 884 transitions. [2025-03-03 14:29:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:29:51,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:51,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2025-03-03 14:29:51,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:29:51,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:51,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:51,496 INFO L85 PathProgramCache]: Analyzing trace with hash -20298134, now seen corresponding path program 1 times [2025-03-03 14:29:51,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:51,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101417227] [2025-03-03 14:29:51,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:51,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:51,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:29:51,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:29:51,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:51,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:29:51,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:51,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101417227] [2025-03-03 14:29:51,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101417227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:51,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:51,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:29:51,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675329759] [2025-03-03 14:29:51,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:51,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:29:51,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:51,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:29:51,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:29:51,562 INFO L87 Difference]: Start difference. First operand 707 states and 884 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:29:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:51,636 INFO L93 Difference]: Finished difference Result 1068 states and 1353 transitions. [2025-03-03 14:29:51,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:29:51,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-03-03 14:29:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:51,641 INFO L225 Difference]: With dead ends: 1068 [2025-03-03 14:29:51,641 INFO L226 Difference]: Without dead ends: 1066 [2025-03-03 14:29:51,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:29:51,642 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 68 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:51,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 199 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2025-03-03 14:29:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 962. [2025-03-03 14:29:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 726 states have (on average 1.243801652892562) internal successors, (903), 781 states have internal predecessors, (903), 121 states have call successors, (121), 111 states have call predecessors, (121), 114 states have return successors, (210), 110 states have call predecessors, (210), 121 states have call successors, (210) [2025-03-03 14:29:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1234 transitions. [2025-03-03 14:29:51,703 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1234 transitions. Word has length 98 [2025-03-03 14:29:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:51,703 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1234 transitions. [2025-03-03 14:29:51,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:29:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1234 transitions. [2025-03-03 14:29:51,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:29:51,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:51,709 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:51,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:29:51,709 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:51,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash 415476740, now seen corresponding path program 1 times [2025-03-03 14:29:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:51,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713089744] [2025-03-03 14:29:51,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:51,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:51,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:29:51,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:29:51,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:51,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:29:51,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:51,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713089744] [2025-03-03 14:29:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713089744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:29:51,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645006392] [2025-03-03 14:29:51,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:51,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:29:51,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:29:51,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:29:51,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:29:52,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:29:52,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:29:52,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:52,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:52,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 14:29:52,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:29:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 79 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:29:52,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:29:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:29:52,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645006392] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:29:52,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:29:52,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 17 [2025-03-03 14:29:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460021752] [2025-03-03 14:29:52,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:29:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 14:29:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:52,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 14:29:52,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:29:52,601 INFO L87 Difference]: Start difference. First operand 962 states and 1234 transitions. Second operand has 17 states, 17 states have (on average 8.294117647058824) internal successors, (141), 17 states have internal predecessors, (141), 6 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-03 14:29:53,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:53,689 INFO L93 Difference]: Finished difference Result 4019 states and 6489 transitions. [2025-03-03 14:29:53,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 14:29:53,690 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.294117647058824) internal successors, (141), 17 states have internal predecessors, (141), 6 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) Word has length 139 [2025-03-03 14:29:53,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:53,710 INFO L225 Difference]: With dead ends: 4019 [2025-03-03 14:29:53,711 INFO L226 Difference]: Without dead ends: 3217 [2025-03-03 14:29:53,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=581, Unknown=0, NotChecked=0, Total=812 [2025-03-03 14:29:53,718 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 704 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:53,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1308 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 14:29:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2025-03-03 14:29:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 1926. [2025-03-03 14:29:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1446 states have (on average 1.2219917012448134) internal successors, (1767), 1539 states have internal predecessors, (1767), 250 states have call successors, (250), 229 states have call predecessors, (250), 229 states have return successors, (482), 225 states have call predecessors, (482), 250 states have call successors, (482) [2025-03-03 14:29:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2499 transitions. [2025-03-03 14:29:53,875 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2499 transitions. Word has length 139 [2025-03-03 14:29:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:53,875 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2499 transitions. [2025-03-03 14:29:53,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.294117647058824) internal successors, (141), 17 states have internal predecessors, (141), 6 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-03 14:29:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2499 transitions. [2025-03-03 14:29:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:29:53,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:53,882 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:53,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:29:54,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:29:54,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:54,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:54,083 INFO L85 PathProgramCache]: Analyzing trace with hash 133035427, now seen corresponding path program 1 times [2025-03-03 14:29:54,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:54,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481175342] [2025-03-03 14:29:54,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:54,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:54,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:29:54,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:29:54,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:54,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:29:54,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:54,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481175342] [2025-03-03 14:29:54,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481175342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:29:54,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437575135] [2025-03-03 14:29:54,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:54,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:29:54,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:29:54,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:29:54,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:29:54,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:29:54,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:29:54,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:54,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:54,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:29:54,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:29:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 14:29:54,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:29:54,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437575135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:54,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:29:54,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2025-03-03 14:29:54,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938659592] [2025-03-03 14:29:54,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:54,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:29:54,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:54,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:29:54,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:29:54,409 INFO L87 Difference]: Start difference. First operand 1926 states and 2499 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:29:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:54,588 INFO L93 Difference]: Finished difference Result 3834 states and 4985 transitions. [2025-03-03 14:29:54,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:29:54,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 147 [2025-03-03 14:29:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:54,599 INFO L225 Difference]: With dead ends: 3834 [2025-03-03 14:29:54,599 INFO L226 Difference]: Without dead ends: 1916 [2025-03-03 14:29:54,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:29:54,606 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 69 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:54,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 637 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:29:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-03 14:29:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1771. [2025-03-03 14:29:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1336 states have (on average 1.2058383233532934) internal successors, (1611), 1415 states have internal predecessors, (1611), 227 states have call successors, (227), 209 states have call predecessors, (227), 207 states have return successors, (373), 209 states have call predecessors, (373), 227 states have call successors, (373) [2025-03-03 14:29:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2211 transitions. [2025-03-03 14:29:54,699 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2211 transitions. Word has length 147 [2025-03-03 14:29:54,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:54,700 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2211 transitions. [2025-03-03 14:29:54,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:29:54,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2211 transitions. [2025-03-03 14:29:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:29:54,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:29:54,705 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:54,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:29:54,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:29:54,910 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:29:54,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:29:54,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1719870469, now seen corresponding path program 1 times [2025-03-03 14:29:54,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:29:54,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787310405] [2025-03-03 14:29:54,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:29:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:29:54,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:29:54,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:29:54,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:29:54,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:29:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-03 14:29:54,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:29:54,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787310405] [2025-03-03 14:29:54,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787310405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:29:54,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:29:54,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:29:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29287325] [2025-03-03 14:29:54,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:29:54,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:29:54,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:29:54,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:29:54,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:29:54,998 INFO L87 Difference]: Start difference. First operand 1771 states and 2211 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:29:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:29:55,050 INFO L93 Difference]: Finished difference Result 2482 states and 3045 transitions. [2025-03-03 14:29:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:29:55,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 139 [2025-03-03 14:29:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:29:55,052 INFO L225 Difference]: With dead ends: 2482 [2025-03-03 14:29:55,052 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:29:55,056 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-03-03 14:29:55,057 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:29:55,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:29:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:29:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:29:55,058 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-03-03 14:29:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:29:55,059 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2025-03-03 14:29:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:29:55,059 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:29:55,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:29:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:29:55,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:29:55,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:29:55,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:29:55,063 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:29:55,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:29:59,629 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:29:59,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:29:59 BoogieIcfgContainer [2025-03-03 14:29:59,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:29:59,638 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:29:59,638 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:29:59,639 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:29:59,639 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:29:49" (3/4) ... [2025-03-03 14:29:59,640 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:29:59,645 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-03-03 14:29:59,645 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-03-03 14:29:59,645 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-03-03 14:29:59,645 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-03-03 14:29:59,645 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-03-03 14:29:59,645 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-03-03 14:29:59,645 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-03-03 14:29:59,645 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-03-03 14:29:59,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-03 14:29:59,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-03 14:29:59,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-03 14:29:59,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:29:59,651 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:29:59,718 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:29:59,719 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:29:59,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:29:59,719 INFO L158 Benchmark]: Toolchain (without parser) took 11080.39ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 157.7MB in the beginning and 169.0MB in the end (delta: -11.3MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-03-03 14:29:59,719 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 209.7MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:29:59,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.88ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 138.8MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:29:59,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.69ms. Allocated memory is still 201.3MB. Free memory was 138.8MB in the beginning and 136.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:29:59,720 INFO L158 Benchmark]: Boogie Preprocessor took 36.33ms. Allocated memory is still 201.3MB. Free memory was 136.7MB in the beginning and 135.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:29:59,721 INFO L158 Benchmark]: IcfgBuilder took 377.69ms. Allocated memory is still 201.3MB. Free memory was 135.2MB in the beginning and 115.5MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:29:59,721 INFO L158 Benchmark]: TraceAbstraction took 10204.53ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 114.7MB in the beginning and 177.3MB in the end (delta: -62.6MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2025-03-03 14:29:59,721 INFO L158 Benchmark]: Witness Printer took 80.38ms. Allocated memory is still 318.8MB. Free memory was 177.3MB in the beginning and 169.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:29:59,722 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.84ms. Allocated memory is still 209.7MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.88ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 138.8MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.69ms. Allocated memory is still 201.3MB. Free memory was 138.8MB in the beginning and 136.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.33ms. Allocated memory is still 201.3MB. Free memory was 136.7MB in the beginning and 135.2MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 377.69ms. Allocated memory is still 201.3MB. Free memory was 135.2MB in the beginning and 115.5MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10204.53ms. Allocated memory was 201.3MB in the beginning and 318.8MB in the end (delta: 117.4MB). Free memory was 114.7MB in the beginning and 177.3MB in the end (delta: -62.6MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. * Witness Printer took 80.38ms. Allocated memory is still 318.8MB. Free memory was 177.3MB in the beginning and 169.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] - GenericResultAtLocation [Line: 160]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [160] - GenericResultAtLocation [Line: 169]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] - GenericResultAtLocation [Line: 273]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [273] - GenericResultAtLocation [Line: 308]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [308] - GenericResultAtLocation [Line: 379]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [379] - GenericResultAtLocation [Line: 745]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [745] - GenericResultAtLocation [Line: 987]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [987] * 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: 165]: 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 9 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1390 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1359 mSDsluCounter, 5415 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3738 mSDsCounter, 315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1472 IncrementalHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 315 mSolverCounterUnsat, 1677 mSDtfsCounter, 1472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 519 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1926occurred in iteration=11, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1568 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1348 ConstructedInterpolants, 0 QuantifiedInterpolants, 2361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 892 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 613/674 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: 182]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 321]: Location Invariant Derived location invariant: (((((((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (0 == systemActive))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (splverifierCounter == 0)) && (0 == systemActive))) RESULT: Ultimate proved your program to be correct! [2025-03-03 14:29:59,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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