./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_spec3_product42.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 449370313253a0d5d7b509b2cd15e912fe8e85dcb7140575e7078385cf7fc6cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:40:12,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:40:12,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:40:12,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:40:12,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:40:12,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:40:12,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:40:12,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:40:12,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:40:12,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:40:12,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:40:12,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:40:12,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:40:12,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:40:12,729 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:40:12,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:40:12,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:40:12,729 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:40:12,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:40:12,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:40:12,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:40:12,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:40:12,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:40:12,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:40:12,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:40:12,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:40:12,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:40:12,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:40:12,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:40:12,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:40:12,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:40:12,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:40:12,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:40:12,732 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 -> 449370313253a0d5d7b509b2cd15e912fe8e85dcb7140575e7078385cf7fc6cf [2025-03-08 05:40:12,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:40:12,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:40:12,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:40:12,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:40:12,969 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:40:12,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c [2025-03-08 05:40:14,158 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4cb33f6/ccb5f4912a444a7a92d00238e9d4f542/FLAG828f930a1 [2025-03-08 05:40:14,403 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:40:14,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product42.cil.c [2025-03-08 05:40:14,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4cb33f6/ccb5f4912a444a7a92d00238e9d4f542/FLAG828f930a1 [2025-03-08 05:40:14,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd4cb33f6/ccb5f4912a444a7a92d00238e9d4f542 [2025-03-08 05:40:14,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:40:14,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:40:14,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:40:14,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:40:14,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:40:14,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14, skipping insertion in model container [2025-03-08 05:40:14,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:40:14,631 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_spec3_product42.cil.c[7477,7490] [2025-03-08 05:40:14,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:40:14,696 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:40:14,702 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2025-03-08 05:40:14,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [153] [2025-03-08 05:40:14,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [221] [2025-03-08 05:40:14,704 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [407] [2025-03-08 05:40:14,704 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [502] [2025-03-08 05:40:14,704 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [511] [2025-03-08 05:40:14,704 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [546] [2025-03-08 05:40:14,704 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [912] [2025-03-08 05:40:14,725 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_spec3_product42.cil.c[7477,7490] [2025-03-08 05:40:14,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:40:14,783 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:40:14,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14 WrapperNode [2025-03-08 05:40:14,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:40:14,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:40:14,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:40:14,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:40:14,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,821 INFO L138 Inliner]: procedures = 54, calls = 97, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 193 [2025-03-08 05:40:14,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:40:14,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:40:14,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:40:14,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:40:14,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,846 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-08 05:40:14,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:40:14,858 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:40:14,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:40:14,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:40:14,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (1/1) ... [2025-03-08 05:40:14,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:40:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:40:14,884 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-08 05:40:14,887 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-08 05:40:14,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:40:14,905 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-03-08 05:40:14,905 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-03-08 05:40:14,905 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-03-08 05:40:14,906 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-03-08 05:40:14,906 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:40:14,906 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:40:14,906 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:40:14,906 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:40:14,906 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-03-08 05:40:14,906 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-03-08 05:40:14,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:40:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-03-08 05:40:14,907 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-03-08 05:40:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:40:14,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:40:14,969 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:40:14,971 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:40:15,009 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L453: #res := ~retValue_acc~4; [2025-03-08 05:40:15,101 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L341-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~2#1; [2025-03-08 05:40:15,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L499-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~6#1; [2025-03-08 05:40:15,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L396-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~3#1; [2025-03-08 05:40:15,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L332-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~1#1; [2025-03-08 05:40:15,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L485-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1; [2025-03-08 05:40:15,198 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L543-1: valid_product_#res#1 := valid_product_~retValue_acc~8#1; [2025-03-08 05:40:15,198 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L150-1: main_#res#1 := main_~retValue_acc~0#1; [2025-03-08 05:40:15,220 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-08 05:40:15,220 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:40:15,232 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:40:15,232 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:40:15,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:40:15 BoogieIcfgContainer [2025-03-08 05:40:15,232 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:40:15,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:40:15,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:40:15,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:40:15,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:40:14" (1/3) ... [2025-03-08 05:40:15,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd65ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:40:15, skipping insertion in model container [2025-03-08 05:40:15,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:14" (2/3) ... [2025-03-08 05:40:15,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd65ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:40:15, skipping insertion in model container [2025-03-08 05:40:15,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:40:15" (3/3) ... [2025-03-08 05:40:15,241 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product42.cil.c [2025-03-08 05:40:15,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:40:15,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec3_product42.cil.c that has 7 procedures, 79 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 05:40:15,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:40:15,310 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;@c7fd81c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:40:15,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:40:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 67 states have internal predecessors, (84), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 05:40:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 05:40:15,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:15,323 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-08 05:40:15,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:15,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:15,329 INFO L85 PathProgramCache]: Analyzing trace with hash 99481476, now seen corresponding path program 1 times [2025-03-08 05:40:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612534207] [2025-03-08 05:40:15,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:15,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 05:40:15,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 05:40:15,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:15,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:15,526 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-08 05:40:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612534207] [2025-03-08 05:40:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612534207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:15,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:15,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:40:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564917024] [2025-03-08 05:40:15,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:15,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:40:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:15,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:40:15,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:40:15,550 INFO L87 Difference]: Start difference. First operand has 79 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 67 states have internal predecessors, (84), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08 05:40:15,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:15,570 INFO L93 Difference]: Finished difference Result 138 states and 184 transitions. [2025-03-08 05:40:15,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:40:15,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08 05:40:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:15,577 INFO L225 Difference]: With dead ends: 138 [2025-03-08 05:40:15,578 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 05:40:15,581 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-08 05:40:15,585 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 12 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 151 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-08 05:40:15,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 151 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 05:40:15,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 05:40:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.346938775510204) internal successors, (66), 54 states have internal predecessors, (66), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:40:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2025-03-08 05:40:15,618 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 25 [2025-03-08 05:40:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:15,618 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2025-03-08 05:40:15,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08 05:40:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2025-03-08 05:40:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 05:40:15,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:15,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:40:15,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:40:15,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:15,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:15,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1823969232, now seen corresponding path program 1 times [2025-03-08 05:40:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:15,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771940428] [2025-03-08 05:40:15,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:15,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 05:40:15,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 05:40:15,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:15,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:15,737 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-08 05:40:15,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771940428] [2025-03-08 05:40:15,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771940428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:15,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:15,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:40:15,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199329416] [2025-03-08 05:40:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:15,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:40:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:15,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:40:15,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:40:15,739 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:40:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:15,772 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2025-03-08 05:40:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:40:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-08 05:40:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:15,773 INFO L225 Difference]: With dead ends: 117 [2025-03-08 05:40:15,773 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 05:40:15,773 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-08 05:40:15,774 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 74 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:15,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 226 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 05:40:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 05:40:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 54 states have internal predecessors, (65), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:40:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2025-03-08 05:40:15,779 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 29 [2025-03-08 05:40:15,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:15,779 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2025-03-08 05:40:15,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:40:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2025-03-08 05:40:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 05:40:15,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:15,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:40:15,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:40:15,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:15,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2114409473, now seen corresponding path program 1 times [2025-03-08 05:40:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:15,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913399023] [2025-03-08 05:40:15,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:15,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:15,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 05:40:15,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 05:40:15,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:15,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:15,834 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-08 05:40:15,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:15,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913399023] [2025-03-08 05:40:15,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913399023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:15,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:15,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:40:15,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463310943] [2025-03-08 05:40:15,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:15,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:40:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:15,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:40:15,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:40:15,835 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:40:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:15,871 INFO L93 Difference]: Finished difference Result 157 states and 204 transitions. [2025-03-08 05:40:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:40:15,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-03-08 05:40:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:15,873 INFO L225 Difference]: With dead ends: 157 [2025-03-08 05:40:15,873 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 05:40:15,874 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-08 05:40:15,874 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 68 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:15,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 140 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 05:40:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-03-08 05:40:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 85 states have internal predecessors, (103), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 05:40:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2025-03-08 05:40:15,894 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 34 [2025-03-08 05:40:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:15,894 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2025-03-08 05:40:15,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:40:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2025-03-08 05:40:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 05:40:15,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:15,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:40:15,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:40:15,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:15,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash 516905117, now seen corresponding path program 1 times [2025-03-08 05:40:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:15,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198890176] [2025-03-08 05:40:15,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:15,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:15,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 05:40:15,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 05:40:15,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:15,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:16,032 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-08 05:40:16,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198890176] [2025-03-08 05:40:16,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198890176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:16,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:16,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:40:16,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900053477] [2025-03-08 05:40:16,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:16,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:40:16,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:16,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:40:16,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:40:16,035 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:40:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:16,099 INFO L93 Difference]: Finished difference Result 270 states and 359 transitions. [2025-03-08 05:40:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:40:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2025-03-08 05:40:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:16,107 INFO L225 Difference]: With dead ends: 270 [2025-03-08 05:40:16,107 INFO L226 Difference]: Without dead ends: 177 [2025-03-08 05:40:16,108 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-08 05:40:16,108 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 34 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:16,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 282 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:16,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-08 05:40:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-08 05:40:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 148 states have internal predecessors, (179), 21 states have call successors, (21), 19 states have call predecessors, (21), 17 states have return successors, (27), 19 states have call predecessors, (27), 21 states have call successors, (27) [2025-03-08 05:40:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 227 transitions. [2025-03-08 05:40:16,135 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 227 transitions. Word has length 40 [2025-03-08 05:40:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:16,135 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 227 transitions. [2025-03-08 05:40:16,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:40:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 227 transitions. [2025-03-08 05:40:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:40:16,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:16,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:40:16,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:40:16,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:16,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1711806273, now seen corresponding path program 1 times [2025-03-08 05:40:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:16,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653393176] [2025-03-08 05:40:16,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:16,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:40:16,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:40:16,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:16,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:16,209 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-08 05:40:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:16,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653393176] [2025-03-08 05:40:16,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653393176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:16,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:16,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:40:16,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713038913] [2025-03-08 05:40:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:16,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:40:16,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:16,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:40:16,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:40:16,211 INFO L87 Difference]: Start difference. First operand 177 states and 227 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:40:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:16,281 INFO L93 Difference]: Finished difference Result 357 states and 480 transitions. [2025-03-08 05:40:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:40:16,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-03-08 05:40:16,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:16,283 INFO L225 Difference]: With dead ends: 357 [2025-03-08 05:40:16,283 INFO L226 Difference]: Without dead ends: 264 [2025-03-08 05:40:16,284 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-08 05:40:16,284 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 61 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:16,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 294 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-08 05:40:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2025-03-08 05:40:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 203 states have (on average 1.3004926108374384) internal successors, (264), 219 states have internal predecessors, (264), 32 states have call successors, (32), 29 states have call predecessors, (32), 27 states have return successors, (50), 30 states have call predecessors, (50), 32 states have call successors, (50) [2025-03-08 05:40:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 346 transitions. [2025-03-08 05:40:16,308 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 346 transitions. Word has length 44 [2025-03-08 05:40:16,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:16,308 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 346 transitions. [2025-03-08 05:40:16,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:40:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 346 transitions. [2025-03-08 05:40:16,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:40:16,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:16,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:40:16,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:40:16,309 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:16,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1492951555, now seen corresponding path program 1 times [2025-03-08 05:40:16,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:16,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585792226] [2025-03-08 05:40:16,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:16,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:40:16,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:40:16,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:16,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:16,360 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-08 05:40:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585792226] [2025-03-08 05:40:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585792226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:16,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:16,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:40:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884869165] [2025-03-08 05:40:16,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:16,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:40:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:16,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:40:16,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:40:16,361 INFO L87 Difference]: Start difference. First operand 263 states and 346 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:40:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:16,388 INFO L93 Difference]: Finished difference Result 444 states and 600 transitions. [2025-03-08 05:40:16,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:40:16,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-03-08 05:40:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:16,390 INFO L225 Difference]: With dead ends: 444 [2025-03-08 05:40:16,390 INFO L226 Difference]: Without dead ends: 265 [2025-03-08 05:40:16,392 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-08 05:40:16,392 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:16,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-08 05:40:16,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-08 05:40:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 205 states have (on average 1.2926829268292683) internal successors, (265), 221 states have internal predecessors, (265), 32 states have call successors, (32), 29 states have call predecessors, (32), 27 states have return successors, (50), 30 states have call predecessors, (50), 32 states have call successors, (50) [2025-03-08 05:40:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 347 transitions. [2025-03-08 05:40:16,415 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 347 transitions. Word has length 44 [2025-03-08 05:40:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:16,415 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 347 transitions. [2025-03-08 05:40:16,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:40:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 347 transitions. [2025-03-08 05:40:16,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 05:40:16,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:16,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:40:16,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:40:16,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:16,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1901775780, now seen corresponding path program 1 times [2025-03-08 05:40:16,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499049249] [2025-03-08 05:40:16,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:16,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:16,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 05:40:16,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 05:40:16,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:16,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:16,474 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-08 05:40:16,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:16,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499049249] [2025-03-08 05:40:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499049249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:16,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:40:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904379325] [2025-03-08 05:40:16,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:16,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:40:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:16,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:40:16,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:40:16,475 INFO L87 Difference]: Start difference. First operand 265 states and 347 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:40:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:16,518 INFO L93 Difference]: Finished difference Result 526 states and 703 transitions. [2025-03-08 05:40:16,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:40:16,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-03-08 05:40:16,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:16,524 INFO L225 Difference]: With dead ends: 526 [2025-03-08 05:40:16,524 INFO L226 Difference]: Without dead ends: 268 [2025-03-08 05:40:16,527 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-08 05:40:16,527 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 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-08 05:40:16,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-08 05:40:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-08 05:40:16,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 210 states have (on average 1.2809523809523808) internal successors, (269), 225 states have internal predecessors, (269), 31 states have call successors, (31), 28 states have call predecessors, (31), 26 states have return successors, (49), 29 states have call predecessors, (49), 31 states have call successors, (49) [2025-03-08 05:40:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 349 transitions. [2025-03-08 05:40:16,567 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 349 transitions. Word has length 44 [2025-03-08 05:40:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:16,567 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 349 transitions. [2025-03-08 05:40:16,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:40:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 349 transitions. [2025-03-08 05:40:16,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 05:40:16,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:16,569 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:40:16,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:40:16,569 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:16,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash -442818750, now seen corresponding path program 1 times [2025-03-08 05:40:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:16,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948637702] [2025-03-08 05:40:16,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:16,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:40:16,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:40:16,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:16,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:40:16,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:16,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948637702] [2025-03-08 05:40:16,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948637702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:40:16,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575078148] [2025-03-08 05:40:16,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:16,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:40:16,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:40:16,699 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-08 05:40:16,700 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-08 05:40:16,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:40:16,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:40:16,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:16,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:16,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 05:40:16,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:40:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:40:16,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:40:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575078148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:16,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:40:16,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2025-03-08 05:40:16,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623313148] [2025-03-08 05:40:16,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:40:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:16,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:40:16,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:40:16,855 INFO L87 Difference]: Start difference. First operand 268 states and 349 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:40:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:16,963 INFO L93 Difference]: Finished difference Result 771 states and 1027 transitions. [2025-03-08 05:40:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:40:16,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2025-03-08 05:40:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:16,967 INFO L225 Difference]: With dead ends: 771 [2025-03-08 05:40:16,967 INFO L226 Difference]: Without dead ends: 510 [2025-03-08 05:40:16,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:40:16,969 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:16,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 424 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:40:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-08 05:40:17,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2025-03-08 05:40:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 396 states have (on average 1.2626262626262625) internal successors, (500), 422 states have internal predecessors, (500), 60 states have call successors, (60), 55 states have call predecessors, (60), 51 states have return successors, (98), 56 states have call predecessors, (98), 60 states have call successors, (98) [2025-03-08 05:40:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 658 transitions. [2025-03-08 05:40:17,028 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 658 transitions. Word has length 49 [2025-03-08 05:40:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:17,028 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 658 transitions. [2025-03-08 05:40:17,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:40:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 658 transitions. [2025-03-08 05:40:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 05:40:17,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:17,033 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] [2025-03-08 05:40:17,039 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-08 05:40:17,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:40:17,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:17,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1773485063, now seen corresponding path program 1 times [2025-03-08 05:40:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:17,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299778419] [2025-03-08 05:40:17,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:17,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:17,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:40:17,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:40:17,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:17,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:17,381 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-08 05:40:17,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:17,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299778419] [2025-03-08 05:40:17,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299778419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:17,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:17,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:40:17,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071808208] [2025-03-08 05:40:17,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:17,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:40:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:17,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:40:17,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:40:17,384 INFO L87 Difference]: Start difference. First operand 508 states and 658 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:40:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:17,480 INFO L93 Difference]: Finished difference Result 1009 states and 1319 transitions. [2025-03-08 05:40:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:40:17,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2025-03-08 05:40:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:17,483 INFO L225 Difference]: With dead ends: 1009 [2025-03-08 05:40:17,483 INFO L226 Difference]: Without dead ends: 254 [2025-03-08 05:40:17,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:40:17,488 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 43 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:17,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 563 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:40:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-08 05:40:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 245. [2025-03-08 05:40:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 192 states have (on average 1.2083333333333333) internal successors, (232), 204 states have internal predecessors, (232), 28 states have call successors, (28), 25 states have call predecessors, (28), 24 states have return successors, (34), 26 states have call predecessors, (34), 28 states have call successors, (34) [2025-03-08 05:40:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 294 transitions. [2025-03-08 05:40:17,509 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 294 transitions. Word has length 50 [2025-03-08 05:40:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:17,510 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 294 transitions. [2025-03-08 05:40:17,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:40:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 294 transitions. [2025-03-08 05:40:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 05:40:17,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:40:17,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:40:17,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:40:17,512 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:40:17,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:40:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash 115530817, now seen corresponding path program 1 times [2025-03-08 05:40:17,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:40:17,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84255660] [2025-03-08 05:40:17,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:40:17,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:40:17,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 05:40:17,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 05:40:17,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:40:17,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:40:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:40:17,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:40:17,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84255660] [2025-03-08 05:40:17,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84255660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:40:17,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:40:17,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:40:17,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676787964] [2025-03-08 05:40:17,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:40:17,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:40:17,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:40:17,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:40:17,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:40:17,643 INFO L87 Difference]: Start difference. First operand 245 states and 294 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:40:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:40:17,777 INFO L93 Difference]: Finished difference Result 473 states and 574 transitions. [2025-03-08 05:40:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:40:17,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-03-08 05:40:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:40:17,778 INFO L225 Difference]: With dead ends: 473 [2025-03-08 05:40:17,778 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 05:40:17,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:40:17,780 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 50 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:40:17,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 666 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:40:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 05:40:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 05:40:17,782 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-08 05:40:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 05:40:17,784 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-03-08 05:40:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:40:17,784 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 05:40:17,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 05:40:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 05:40:17,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 05:40:17,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:40:17,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:40:17,790 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:40:17,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 05:40:19,599 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:40:19,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:40:19 BoogieIcfgContainer [2025-03-08 05:40:19,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:40:19,609 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:40:19,609 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:40:19,609 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:40:19,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:40:15" (3/4) ... [2025-03-08 05:40:19,612 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 05:40:19,616 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-03-08 05:40:19,616 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-03-08 05:40:19,616 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-03-08 05:40:19,616 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-03-08 05:40:19,616 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-03-08 05:40:19,616 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-03-08 05:40:19,620 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-08 05:40:19,620 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 05:40:19,620 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 05:40:19,620 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:40:19,621 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 05:40:19,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:40:19,678 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:40:19,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:40:19,678 INFO L158 Benchmark]: Toolchain (without parser) took 5238.71ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 114.0MB in the beginning and 277.8MB in the end (delta: -163.8MB). Peak memory consumption was 103.7MB. Max. memory is 16.1GB. [2025-03-08 05:40:19,678 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:40:19,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.08ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 95.3MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:40:19,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.24ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:40:19,679 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 92.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:40:19,679 INFO L158 Benchmark]: IcfgBuilder took 374.27ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 74.2MB in the end (delta: 17.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 05:40:19,679 INFO L158 Benchmark]: TraceAbstraction took 4374.84ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 73.7MB in the beginning and 286.2MB in the end (delta: -212.4MB). Peak memory consumption was 197.3MB. Max. memory is 16.1GB. [2025-03-08 05:40:19,679 INFO L158 Benchmark]: Witness Printer took 68.58ms. Allocated memory is still 411.0MB. Free memory was 286.2MB in the beginning and 277.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:40:19,680 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.18ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.08ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 95.3MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.24ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 92.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 374.27ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 74.2MB in the end (delta: 17.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4374.84ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 73.7MB in the beginning and 286.2MB in the end (delta: -212.4MB). Peak memory consumption was 197.3MB. Max. memory is 16.1GB. * Witness Printer took 68.58ms. Allocated memory is still 411.0MB. Free memory was 286.2MB in the beginning and 277.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] - GenericResultAtLocation [Line: 153]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [153] - GenericResultAtLocation [Line: 221]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [221] - GenericResultAtLocation [Line: 407]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [407] - GenericResultAtLocation [Line: 502]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [502] - GenericResultAtLocation [Line: 511]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [511] - GenericResultAtLocation [Line: 546]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [546] - GenericResultAtLocation [Line: 912]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [912] * 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: 507]: 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 7 procedures, 79 locations, 114 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 3277 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2443 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 834 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=508occurred in iteration=8, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 837 SizeOfPredicates, 1 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 10/12 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: 165]: Location Invariant Derived location invariant: (((((pumpRunning != 0) && (splverifierCounter == 0)) && (0 != systemActive)) || ((((methaneLevelCritical == 0) && (2 != waterLevel)) && (splverifierCounter == 0)) && (0 != systemActive))) || (((methaneLevelCritical == 1) && (splverifierCounter == 0)) && (0 != systemActive))) - InvariantResult [Line: 62]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-03-08 05:40:19,693 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