./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73b8e020dd9d30fdd676c81009d4f1b850aa716d63ef29ce3d475a261546f853 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:54:21,659 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:54:21,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:54:21,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:54:21,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:54:21,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:54:21,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:54:21,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:54:21,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:54:21,728 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:54:21,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:54:21,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:54:21,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:54:21,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:54:21,729 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:54:21,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:54:21,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:54:21,729 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:54:21,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:54:21,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:54:21,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:54:21,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:54:21,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:54:21,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:54:21,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:54:21,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:54:21,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:54:21,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:54:21,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:54:21,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:54:21,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:54:21,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:54:21,731 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73b8e020dd9d30fdd676c81009d4f1b850aa716d63ef29ce3d475a261546f853 [2025-02-05 15:54:22,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:54:22,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:54:22,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:54:22,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:54:22,017 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:54:22,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c [2025-02-05 15:54:23,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0833b21b/d112e0e81196484b99b4fd3c11f8a196/FLAG64d87226d [2025-02-05 15:54:23,624 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:54:23,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c [2025-02-05 15:54:23,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0833b21b/d112e0e81196484b99b4fd3c11f8a196/FLAG64d87226d [2025-02-05 15:54:23,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0833b21b/d112e0e81196484b99b4fd3c11f8a196 [2025-02-05 15:54:23,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:54:23,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:54:23,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:54:23,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:54:23,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:54:23,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:54:23" (1/1) ... [2025-02-05 15:54:23,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28451d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:23, skipping insertion in model container [2025-02-05 15:54:23,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:54:23" (1/1) ... [2025-02-05 15:54:23,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:54:23,913 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c[15211,15224] [2025-02-05 15:54:23,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:54:23,946 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:54:23,953 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification5_spec.i","") [49] [2025-02-05 15:54:23,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [101] [2025-02-05 15:54:23,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [206] [2025-02-05 15:54:23,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [572] [2025-02-05 15:54:23,954 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [670] [2025-02-05 15:54:23,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [705] [2025-02-05 15:54:23,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [714] [2025-02-05 15:54:23,955 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [923] [2025-02-05 15:54:24,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec5_product46.cil.c[15211,15224] [2025-02-05 15:54:24,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:54:24,034 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:54:24,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24 WrapperNode [2025-02-05 15:54:24,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:54:24,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:54:24,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:54:24,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:54:24,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,076 INFO L138 Inliner]: procedures = 57, calls = 103, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 211 [2025-02-05 15:54:24,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:54:24,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:54:24,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:54:24,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:54:24,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,107 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:54:24,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,114 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:54:24,125 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:54:24,125 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:54:24,125 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:54:24,126 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (1/1) ... [2025-02-05 15:54:24,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:54:24,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:24,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:54:24,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:54:24,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:54:24,191 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:54:24,191 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:54:24,191 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:54:24,191 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:54:24,191 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:54:24,191 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:54:24,191 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:54:24,191 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:54:24,191 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:54:24,191 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:54:24,192 INFO L130 BoogieDeclarations]: Found specification of procedure isPumpRunning [2025-02-05 15:54:24,192 INFO L138 BoogieDeclarations]: Found implementation of procedure isPumpRunning [2025-02-05 15:54:24,192 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2025-02-05 15:54:24,192 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2025-02-05 15:54:24,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:54:24,192 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:54:24,192 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:54:24,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:54:24,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:54:24,267 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:54:24,269 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:54:24,391 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L653-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1; [2025-02-05 15:54:24,422 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:54:24,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L702-1: valid_product_#res#1 := valid_product_~retValue_acc~8#1; [2025-02-05 15:54:24,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L203-1: main_#res#1 := main_~retValue_acc~0#1; [2025-02-05 15:54:24,565 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L667-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~6#1; [2025-02-05 15:54:24,565 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L912-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~11#1; [2025-02-05 15:54:24,571 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L857: #res := ~retValue_acc~10; [2025-02-05 15:54:24,576 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L848: #res#1 := ~retValue_acc~9#1; [2025-02-05 15:54:24,577 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L621-1: isMethaneLevelCritical_#res#1 := isMethaneLevelCritical_~retValue_acc~4#1; [2025-02-05 15:54:24,604 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-02-05 15:54:24,604 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:54:24,613 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:54:24,613 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:54:24,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:54:24 BoogieIcfgContainer [2025-02-05 15:54:24,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:54:24,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:54:24,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:54:24,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:54:24,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:54:23" (1/3) ... [2025-02-05 15:54:24,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107bcaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:54:24, skipping insertion in model container [2025-02-05 15:54:24,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:54:24" (2/3) ... [2025-02-05 15:54:24,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107bcaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:54:24, skipping insertion in model container [2025-02-05 15:54:24,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:54:24" (3/3) ... [2025-02-05 15:54:24,623 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product46.cil.c [2025-02-05 15:54:24,636 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:54:24,638 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec5_product46.cil.c that has 9 procedures, 98 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:54:24,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:54:24,707 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;@45c59068, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:54:24,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:54:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 81 states have internal predecessors, (98), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 15:54:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-05 15:54:24,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:24,720 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] [2025-02-05 15:54:24,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:24,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:24,726 INFO L85 PathProgramCache]: Analyzing trace with hash 526589145, now seen corresponding path program 1 times [2025-02-05 15:54:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693311645] [2025-02-05 15:54:24,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:24,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-05 15:54:24,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-05 15:54:24,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:24,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:54:24,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:24,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693311645] [2025-02-05 15:54:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693311645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:24,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:24,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:54:24,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662689344] [2025-02-05 15:54:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:24,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:54:24,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:24,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:54:24,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:54:24,928 INFO L87 Difference]: Start difference. First operand has 97 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 81 states have internal predecessors, (98), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:54:24,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:24,961 INFO L93 Difference]: Finished difference Result 177 states and 236 transitions. [2025-02-05 15:54:24,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:54:24,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-02-05 15:54:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:24,969 INFO L225 Difference]: With dead ends: 177 [2025-02-05 15:54:24,969 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 15:54:24,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:54:24,974 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:24,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 15:54:25,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-05 15:54:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 74 states have internal predecessors, (87), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-05 15:54:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2025-02-05 15:54:25,015 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 32 [2025-02-05 15:54:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:25,015 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2025-02-05 15:54:25,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:54:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2025-02-05 15:54:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 15:54:25,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:25,017 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] [2025-02-05 15:54:25,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:54:25,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:25,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1219993251, now seen corresponding path program 1 times [2025-02-05 15:54:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:25,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880596998] [2025-02-05 15:54:25,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:25,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 15:54:25,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 15:54:25,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:25,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:54:25,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:25,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880596998] [2025-02-05 15:54:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880596998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:25,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:25,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:54:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181778129] [2025-02-05 15:54:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:25,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:54:25,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:25,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:54:25,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:54:25,129 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:54:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:25,153 INFO L93 Difference]: Finished difference Result 143 states and 183 transitions. [2025-02-05 15:54:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:54:25,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-02-05 15:54:25,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:25,157 INFO L225 Difference]: With dead ends: 143 [2025-02-05 15:54:25,157 INFO L226 Difference]: Without dead ends: 80 [2025-02-05 15:54:25,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:54:25,159 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 12 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:25,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 186 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-05 15:54:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-05 15:54:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 68 states have internal predecessors, (80), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:54:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2025-02-05 15:54:25,168 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 33 [2025-02-05 15:54:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:25,169 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2025-02-05 15:54:25,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 15:54:25,169 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2025-02-05 15:54:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 15:54:25,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:25,172 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] [2025-02-05 15:54:25,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:54:25,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:25,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1644305090, now seen corresponding path program 1 times [2025-02-05 15:54:25,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:25,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151164937] [2025-02-05 15:54:25,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:25,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:25,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 15:54:25,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 15:54:25,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:25,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:54:25,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:25,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151164937] [2025-02-05 15:54:25,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151164937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:25,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:25,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:54:25,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427125420] [2025-02-05 15:54:25,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:25,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:54:25,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:25,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:54:25,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:54:25,272 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:54:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:25,303 INFO L93 Difference]: Finished difference Result 152 states and 197 transitions. [2025-02-05 15:54:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:54:25,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2025-02-05 15:54:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:25,306 INFO L225 Difference]: With dead ends: 152 [2025-02-05 15:54:25,307 INFO L226 Difference]: Without dead ends: 80 [2025-02-05 15:54:25,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:54:25,308 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:25,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 100 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-05 15:54:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-05 15:54:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 68 states have internal predecessors, (79), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:54:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2025-02-05 15:54:25,325 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 37 [2025-02-05 15:54:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:25,326 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2025-02-05 15:54:25,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 15:54:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2025-02-05 15:54:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 15:54:25,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:25,327 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] [2025-02-05 15:54:25,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:54:25,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:25,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:25,328 INFO L85 PathProgramCache]: Analyzing trace with hash -550823415, now seen corresponding path program 1 times [2025-02-05 15:54:25,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:25,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15159490] [2025-02-05 15:54:25,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:25,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:25,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 15:54:25,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 15:54:25,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:25,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:54:25,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:25,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15159490] [2025-02-05 15:54:25,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15159490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:25,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:25,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:54:25,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115502377] [2025-02-05 15:54:25,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:25,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:54:25,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:25,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:54:25,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:54:25,440 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:54:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:25,716 INFO L93 Difference]: Finished difference Result 235 states and 297 transitions. [2025-02-05 15:54:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:54:25,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 47 [2025-02-05 15:54:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:25,718 INFO L225 Difference]: With dead ends: 235 [2025-02-05 15:54:25,718 INFO L226 Difference]: Without dead ends: 163 [2025-02-05 15:54:25,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:54:25,720 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 206 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:25,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 283 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:54:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-05 15:54:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2025-02-05 15:54:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.2583333333333333) internal successors, (151), 128 states have internal predecessors, (151), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2025-02-05 15:54:25,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2025-02-05 15:54:25,736 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 47 [2025-02-05 15:54:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:25,737 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2025-02-05 15:54:25,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:54:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2025-02-05 15:54:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 15:54:25,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:25,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:25,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:54:25,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:25,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1199419341, now seen corresponding path program 1 times [2025-02-05 15:54:25,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:25,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082920057] [2025-02-05 15:54:25,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:25,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 15:54:25,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 15:54:25,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:25,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:54:25,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:25,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082920057] [2025-02-05 15:54:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082920057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:25,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:25,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:54:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817525600] [2025-02-05 15:54:25,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:25,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:54:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:25,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:54:25,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:54:25,868 INFO L87 Difference]: Start difference. First operand 157 states and 192 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:54:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:26,122 INFO L93 Difference]: Finished difference Result 306 states and 376 transitions. [2025-02-05 15:54:26,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:54:26,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2025-02-05 15:54:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:26,124 INFO L225 Difference]: With dead ends: 306 [2025-02-05 15:54:26,124 INFO L226 Difference]: Without dead ends: 157 [2025-02-05 15:54:26,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:54:26,125 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 137 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:26,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 385 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:54:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-05 15:54:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-02-05 15:54:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.228813559322034) internal successors, (145), 126 states have internal predecessors, (145), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2025-02-05 15:54:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 186 transitions. [2025-02-05 15:54:26,145 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 186 transitions. Word has length 53 [2025-02-05 15:54:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:26,145 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 186 transitions. [2025-02-05 15:54:26,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:54:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 186 transitions. [2025-02-05 15:54:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 15:54:26,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:26,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:26,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:54:26,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:26,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:26,149 INFO L85 PathProgramCache]: Analyzing trace with hash -585376309, now seen corresponding path program 1 times [2025-02-05 15:54:26,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:26,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149606095] [2025-02-05 15:54:26,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:26,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:26,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 15:54:26,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 15:54:26,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:26,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:54:26,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:26,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149606095] [2025-02-05 15:54:26,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149606095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:26,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:26,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:54:26,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024385996] [2025-02-05 15:54:26,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:26,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:54:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:26,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:54:26,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:54:26,226 INFO L87 Difference]: Start difference. First operand 155 states and 186 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:54:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:26,247 INFO L93 Difference]: Finished difference Result 305 states and 374 transitions. [2025-02-05 15:54:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:54:26,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2025-02-05 15:54:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:26,249 INFO L225 Difference]: With dead ends: 305 [2025-02-05 15:54:26,249 INFO L226 Difference]: Without dead ends: 158 [2025-02-05 15:54:26,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:54:26,250 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:26,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-05 15:54:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-05 15:54:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 121 states have (on average 1.2231404958677685) internal successors, (148), 129 states have internal predecessors, (148), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2025-02-05 15:54:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2025-02-05 15:54:26,262 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 59 [2025-02-05 15:54:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:26,264 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2025-02-05 15:54:26,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:54:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2025-02-05 15:54:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 15:54:26,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:26,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:26,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:54:26,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:26,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash 376237708, now seen corresponding path program 1 times [2025-02-05 15:54:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:26,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242516236] [2025-02-05 15:54:26,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:26,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:26,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 15:54:26,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 15:54:26,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:26,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:54:26,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:26,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242516236] [2025-02-05 15:54:26,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242516236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:26,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:26,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:54:26,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793669795] [2025-02-05 15:54:26,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:26,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:54:26,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:26,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:54:26,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:54:26,392 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:54:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:26,437 INFO L93 Difference]: Finished difference Result 310 states and 379 transitions. [2025-02-05 15:54:26,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:54:26,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2025-02-05 15:54:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:26,440 INFO L225 Difference]: With dead ends: 310 [2025-02-05 15:54:26,440 INFO L226 Difference]: Without dead ends: 160 [2025-02-05 15:54:26,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:54:26,444 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 94 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:26,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 288 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:54:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-05 15:54:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-05 15:54:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 131 states have internal predecessors, (150), 18 states have call successors, (18), 15 states have call predecessors, (18), 18 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2025-02-05 15:54:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 191 transitions. [2025-02-05 15:54:26,491 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 191 transitions. Word has length 59 [2025-02-05 15:54:26,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:26,494 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 191 transitions. [2025-02-05 15:54:26,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:54:26,495 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 191 transitions. [2025-02-05 15:54:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 15:54:26,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:26,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:26,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:54:26,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:26,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:26,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1762441102, now seen corresponding path program 1 times [2025-02-05 15:54:26,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:26,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920111845] [2025-02-05 15:54:26,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:26,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 15:54:26,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 15:54:26,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:26,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:54:26,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:26,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920111845] [2025-02-05 15:54:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920111845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:26,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:54:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838488083] [2025-02-05 15:54:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:26,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:54:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:26,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:54:26,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:54:26,625 INFO L87 Difference]: Start difference. First operand 160 states and 191 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:54:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:26,746 INFO L93 Difference]: Finished difference Result 486 states and 600 transitions. [2025-02-05 15:54:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:54:26,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2025-02-05 15:54:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:26,748 INFO L225 Difference]: With dead ends: 486 [2025-02-05 15:54:26,749 INFO L226 Difference]: Without dead ends: 334 [2025-02-05 15:54:26,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:54:26,750 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 122 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:26,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 320 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:54:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-05 15:54:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 327. [2025-02-05 15:54:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 249 states have (on average 1.2048192771084338) internal successors, (300), 263 states have internal predecessors, (300), 39 states have call successors, (39), 33 states have call predecessors, (39), 38 states have return successors, (58), 41 states have call predecessors, (58), 39 states have call successors, (58) [2025-02-05 15:54:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 397 transitions. [2025-02-05 15:54:26,785 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 397 transitions. Word has length 59 [2025-02-05 15:54:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:26,785 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 397 transitions. [2025-02-05 15:54:26,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 15:54:26,785 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 397 transitions. [2025-02-05 15:54:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 15:54:26,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:26,786 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:26,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:54:26,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:26,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:26,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1043669652, now seen corresponding path program 1 times [2025-02-05 15:54:26,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:26,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804432607] [2025-02-05 15:54:26,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:26,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:26,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 15:54:26,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 15:54:26,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:26,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:54:26,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:26,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804432607] [2025-02-05 15:54:26,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804432607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:54:26,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:54:26,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:54:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949191844] [2025-02-05 15:54:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:54:26,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:54:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:26,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:54:26,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:54:26,952 INFO L87 Difference]: Start difference. First operand 327 states and 397 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 15:54:27,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:27,352 INFO L93 Difference]: Finished difference Result 884 states and 1110 transitions. [2025-02-05 15:54:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 15:54:27,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 63 [2025-02-05 15:54:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:27,358 INFO L225 Difference]: With dead ends: 884 [2025-02-05 15:54:27,358 INFO L226 Difference]: Without dead ends: 615 [2025-02-05 15:54:27,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:54:27,361 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 322 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:27,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 503 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:54:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-02-05 15:54:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 563. [2025-02-05 15:54:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 427 states have (on average 1.1943793911007026) internal successors, (510), 452 states have internal predecessors, (510), 67 states have call successors, (67), 58 states have call predecessors, (67), 68 states have return successors, (96), 70 states have call predecessors, (96), 67 states have call successors, (96) [2025-02-05 15:54:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 673 transitions. [2025-02-05 15:54:27,423 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 673 transitions. Word has length 63 [2025-02-05 15:54:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:27,423 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 673 transitions. [2025-02-05 15:54:27,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 15:54:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 673 transitions. [2025-02-05 15:54:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:54:27,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:27,426 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:27,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:54:27,426 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:27,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1247073929, now seen corresponding path program 1 times [2025-02-05 15:54:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:27,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189719335] [2025-02-05 15:54:27,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:27,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:54:27,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:54:27,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:27,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:54:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189719335] [2025-02-05 15:54:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189719335] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:54:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987816099] [2025-02-05 15:54:27,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:27,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:27,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:27,627 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:54:27,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:54:27,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:54:27,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:54:27,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:27,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:27,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:54:27,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:54:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:54:27,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:54:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:54:28,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987816099] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:54:28,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:54:28,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2025-02-05 15:54:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722756377] [2025-02-05 15:54:28,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:54:28,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 15:54:28,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:28,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 15:54:28,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:54:28,120 INFO L87 Difference]: Start difference. First operand 563 states and 673 transitions. Second operand has 15 states, 15 states have (on average 8.733333333333333) internal successors, (131), 13 states have internal predecessors, (131), 7 states have call successors, (23), 4 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2025-02-05 15:54:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:28,522 INFO L93 Difference]: Finished difference Result 1283 states and 1597 transitions. [2025-02-05 15:54:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 15:54:28,522 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.733333333333333) internal successors, (131), 13 states have internal predecessors, (131), 7 states have call successors, (23), 4 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 106 [2025-02-05 15:54:28,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:28,526 INFO L225 Difference]: With dead ends: 1283 [2025-02-05 15:54:28,526 INFO L226 Difference]: Without dead ends: 776 [2025-02-05 15:54:28,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2025-02-05 15:54:28,528 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 296 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:28,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1394 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:54:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-02-05 15:54:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 630. [2025-02-05 15:54:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 473 states have (on average 1.1966173361522199) internal successors, (566), 506 states have internal predecessors, (566), 78 states have call successors, (78), 69 states have call predecessors, (78), 78 states have return successors, (107), 77 states have call predecessors, (107), 78 states have call successors, (107) [2025-02-05 15:54:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 751 transitions. [2025-02-05 15:54:28,575 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 751 transitions. Word has length 106 [2025-02-05 15:54:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:28,575 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 751 transitions. [2025-02-05 15:54:28,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.733333333333333) internal successors, (131), 13 states have internal predecessors, (131), 7 states have call successors, (23), 4 states have call predecessors, (23), 8 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2025-02-05 15:54:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 751 transitions. [2025-02-05 15:54:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 15:54:28,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:28,579 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:28,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:54:28,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:54:28,780 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:28,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2020961493, now seen corresponding path program 1 times [2025-02-05 15:54:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:28,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371110339] [2025-02-05 15:54:28,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:28,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 15:54:28,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 15:54:28,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:28,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 100 proven. 13 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-05 15:54:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371110339] [2025-02-05 15:54:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371110339] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:54:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985420402] [2025-02-05 15:54:29,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:29,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:29,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:29,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:54:29,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:54:29,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 15:54:29,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 15:54:29,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:29,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:29,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:54:29,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:54:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 158 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 15:54:29,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:54:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 78 proven. 41 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-02-05 15:54:29,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985420402] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:54:29,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:54:29,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 23 [2025-02-05 15:54:29,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829576719] [2025-02-05 15:54:29,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:54:29,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 15:54:29,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:29,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 15:54:29,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:54:29,903 INFO L87 Difference]: Start difference. First operand 630 states and 751 transitions. Second operand has 23 states, 23 states have (on average 9.217391304347826) internal successors, (212), 21 states have internal predecessors, (212), 9 states have call successors, (33), 5 states have call predecessors, (33), 11 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2025-02-05 15:54:31,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:31,326 INFO L93 Difference]: Finished difference Result 1936 states and 2423 transitions. [2025-02-05 15:54:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-05 15:54:31,327 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.217391304347826) internal successors, (212), 21 states have internal predecessors, (212), 9 states have call successors, (33), 5 states have call predecessors, (33), 11 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) Word has length 192 [2025-02-05 15:54:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:31,337 INFO L225 Difference]: With dead ends: 1936 [2025-02-05 15:54:31,337 INFO L226 Difference]: Without dead ends: 1284 [2025-02-05 15:54:31,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 380 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=702, Invalid=2958, Unknown=0, NotChecked=0, Total=3660 [2025-02-05 15:54:31,342 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 926 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:31,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1037 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 15:54:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2025-02-05 15:54:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1220. [2025-02-05 15:54:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 920 states have (on average 1.15) internal successors, (1058), 971 states have internal predecessors, (1058), 157 states have call successors, (157), 142 states have call predecessors, (157), 142 states have return successors, (190), 141 states have call predecessors, (190), 157 states have call successors, (190) [2025-02-05 15:54:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1405 transitions. [2025-02-05 15:54:31,435 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1405 transitions. Word has length 192 [2025-02-05 15:54:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:31,435 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1405 transitions. [2025-02-05 15:54:31,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.217391304347826) internal successors, (212), 21 states have internal predecessors, (212), 9 states have call successors, (33), 5 states have call predecessors, (33), 11 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2025-02-05 15:54:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1405 transitions. [2025-02-05 15:54:31,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-02-05 15:54:31,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:31,441 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 15:54:31,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:54:31,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:31,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:31,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash 295057189, now seen corresponding path program 1 times [2025-02-05 15:54:31,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:31,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360865211] [2025-02-05 15:54:31,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:31,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 15:54:31,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 15:54:31,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:31,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 96 proven. 58 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 15:54:31,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:31,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360865211] [2025-02-05 15:54:31,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360865211] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:54:31,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972924372] [2025-02-05 15:54:31,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:31,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:31,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:31,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:54:31,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:54:31,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-05 15:54:31,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-05 15:54:31,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:31,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:31,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:54:31,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:54:32,137 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 195 proven. 9 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 15:54:32,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:54:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 99 proven. 54 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-02-05 15:54:32,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972924372] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:54:32,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:54:32,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2025-02-05 15:54:32,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833194326] [2025-02-05 15:54:32,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:54:32,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 15:54:32,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:32,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 15:54:32,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:54:32,558 INFO L87 Difference]: Start difference. First operand 1220 states and 1405 transitions. Second operand has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 20 states have internal predecessors, (225), 9 states have call successors, (41), 5 states have call predecessors, (41), 14 states have return successors, (41), 11 states have call predecessors, (41), 9 states have call successors, (41) [2025-02-05 15:54:33,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:33,203 INFO L93 Difference]: Finished difference Result 2393 states and 2780 transitions. [2025-02-05 15:54:33,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 15:54:33,204 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 20 states have internal predecessors, (225), 9 states have call successors, (41), 5 states have call predecessors, (41), 14 states have return successors, (41), 11 states have call predecessors, (41), 9 states have call successors, (41) Word has length 208 [2025-02-05 15:54:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:33,211 INFO L225 Difference]: With dead ends: 2393 [2025-02-05 15:54:33,211 INFO L226 Difference]: Without dead ends: 1277 [2025-02-05 15:54:33,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 412 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 15:54:33,215 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 463 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:33,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 927 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:54:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-02-05 15:54:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1208. [2025-02-05 15:54:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 913 states have (on average 1.1391018619934283) internal successors, (1040), 961 states have internal predecessors, (1040), 148 states have call successors, (148), 143 states have call predecessors, (148), 146 states have return successors, (181), 138 states have call predecessors, (181), 148 states have call successors, (181) [2025-02-05 15:54:33,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1369 transitions. [2025-02-05 15:54:33,334 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1369 transitions. Word has length 208 [2025-02-05 15:54:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:33,334 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1369 transitions. [2025-02-05 15:54:33,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 20 states have internal predecessors, (225), 9 states have call successors, (41), 5 states have call predecessors, (41), 14 states have return successors, (41), 11 states have call predecessors, (41), 9 states have call successors, (41) [2025-02-05 15:54:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1369 transitions. [2025-02-05 15:54:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 15:54:33,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:33,339 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 15:54:33,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:54:33,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:33,539 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:33,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash -785948737, now seen corresponding path program 1 times [2025-02-05 15:54:33,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:33,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643813756] [2025-02-05 15:54:33,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:33,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:33,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 15:54:33,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 15:54:33,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:33,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 84 proven. 24 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-02-05 15:54:33,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:33,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643813756] [2025-02-05 15:54:33,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643813756] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:54:33,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361269787] [2025-02-05 15:54:33,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:33,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:33,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:33,715 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:54:33,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:54:33,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 15:54:33,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 15:54:33,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:33,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:33,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:54:33,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:54:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 138 proven. 25 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 15:54:34,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:54:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 99 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:54:34,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361269787] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:54:34,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:54:34,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 13] total 25 [2025-02-05 15:54:34,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123925251] [2025-02-05 15:54:34,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:54:34,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 15:54:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:34,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 15:54:34,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:54:34,700 INFO L87 Difference]: Start difference. First operand 1208 states and 1369 transitions. Second operand has 25 states, 25 states have (on average 10.36) internal successors, (259), 23 states have internal predecessors, (259), 15 states have call successors, (48), 8 states have call predecessors, (48), 16 states have return successors, (49), 15 states have call predecessors, (49), 15 states have call successors, (49) [2025-02-05 15:54:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:36,456 INFO L93 Difference]: Finished difference Result 2657 states and 3063 transitions. [2025-02-05 15:54:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-05 15:54:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.36) internal successors, (259), 23 states have internal predecessors, (259), 15 states have call successors, (48), 8 states have call predecessors, (48), 16 states have return successors, (49), 15 states have call predecessors, (49), 15 states have call successors, (49) Word has length 209 [2025-02-05 15:54:36,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:36,467 INFO L225 Difference]: With dead ends: 2657 [2025-02-05 15:54:36,467 INFO L226 Difference]: Without dead ends: 1559 [2025-02-05 15:54:36,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 414 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=885, Invalid=3275, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 15:54:36,472 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1512 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:36,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1847 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 15:54:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-02-05 15:54:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1403. [2025-02-05 15:54:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1065 states have (on average 1.1267605633802817) internal successors, (1200), 1103 states have internal predecessors, (1200), 175 states have call successors, (175), 170 states have call predecessors, (175), 162 states have return successors, (191), 158 states have call predecessors, (191), 175 states have call successors, (191) [2025-02-05 15:54:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1566 transitions. [2025-02-05 15:54:36,612 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1566 transitions. Word has length 209 [2025-02-05 15:54:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:36,613 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 1566 transitions. [2025-02-05 15:54:36,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.36) internal successors, (259), 23 states have internal predecessors, (259), 15 states have call successors, (48), 8 states have call predecessors, (48), 16 states have return successors, (49), 15 states have call predecessors, (49), 15 states have call successors, (49) [2025-02-05 15:54:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1566 transitions. [2025-02-05 15:54:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-05 15:54:36,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:54:36,620 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:36,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:54:36,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 15:54:36,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:54:36,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:54:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash -205271674, now seen corresponding path program 1 times [2025-02-05 15:54:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:54:36,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079678661] [2025-02-05 15:54:36,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:36,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:54:36,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 15:54:36,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 15:54:36,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:36,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 186 proven. 35 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-02-05 15:54:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:54:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079678661] [2025-02-05 15:54:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079678661] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:54:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457720492] [2025-02-05 15:54:37,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:54:37,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:54:37,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:54:37,506 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:54:37,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:54:37,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-05 15:54:37,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-05 15:54:37,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:54:37,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:54:37,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 15:54:37,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:54:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 154 proven. 89 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-02-05 15:54:37,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:54:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 95 proven. 136 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-02-05 15:54:38,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457720492] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:54:38,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:54:38,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 16] total 27 [2025-02-05 15:54:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922137606] [2025-02-05 15:54:38,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:54:38,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 15:54:38,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:54:38,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 15:54:38,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2025-02-05 15:54:38,534 INFO L87 Difference]: Start difference. First operand 1403 states and 1566 transitions. Second operand has 27 states, 27 states have (on average 11.25925925925926) internal successors, (304), 26 states have internal predecessors, (304), 18 states have call successors, (59), 10 states have call predecessors, (59), 19 states have return successors, (62), 18 states have call predecessors, (62), 18 states have call successors, (62) [2025-02-05 15:54:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:54:39,439 INFO L93 Difference]: Finished difference Result 2266 states and 2543 transitions. [2025-02-05 15:54:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 15:54:39,440 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 11.25925925925926) internal successors, (304), 26 states have internal predecessors, (304), 18 states have call successors, (59), 10 states have call predecessors, (59), 19 states have return successors, (62), 18 states have call predecessors, (62), 18 states have call successors, (62) Word has length 263 [2025-02-05 15:54:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:54:39,442 INFO L225 Difference]: With dead ends: 2266 [2025-02-05 15:54:39,442 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:54:39,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 513 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=380, Invalid=1260, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 15:54:39,446 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 784 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:54:39,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1271 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:54:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:54:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:54:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:54:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:54:39,448 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2025-02-05 15:54:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:54:39,448 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:54:39,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.25925925925926) internal successors, (304), 26 states have internal predecessors, (304), 18 states have call successors, (59), 10 states have call predecessors, (59), 19 states have return successors, (62), 18 states have call predecessors, (62), 18 states have call successors, (62) [2025-02-05 15:54:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:54:39,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:54:39,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:54:39,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:54:39,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 15:54:39,654 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:54:39,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:54:51,876 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:54:51,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:54:51 BoogieIcfgContainer [2025-02-05 15:54:51,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:54:51,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:54:51,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:54:51,891 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:54:51,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:54:24" (3/4) ... [2025-02-05 15:54:51,893 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:54:51,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-02-05 15:54:51,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-02-05 15:54:51,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-02-05 15:54:51,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-02-05 15:54:51,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-02-05 15:54:51,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:54:51,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isPumpRunning [2025-02-05 15:54:51,899 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2025-02-05 15:54:51,904 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-05 15:54:51,907 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 15:54:51,907 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-05 15:54:51,907 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:54:51,908 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:54:51,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:54:51,984 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:54:51,985 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:54:51,985 INFO L158 Benchmark]: Toolchain (without parser) took 28326.17ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 112.3MB in the beginning and 343.4MB in the end (delta: -231.1MB). Peak memory consumption was 167.0MB. Max. memory is 16.1GB. [2025-02-05 15:54:51,986 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:54:51,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.10ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 93.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:54:51,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.35ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:54:51,986 INFO L158 Benchmark]: Boogie Preprocessor took 45.96ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 90.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:54:51,986 INFO L158 Benchmark]: IcfgBuilder took 489.07ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 71.0MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:54:51,987 INFO L158 Benchmark]: TraceAbstraction took 27274.32ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 70.6MB in the beginning and 351.8MB in the end (delta: -281.2MB). Peak memory consumption was 291.1MB. Max. memory is 16.1GB. [2025-02-05 15:54:51,987 INFO L158 Benchmark]: Witness Printer took 93.84ms. Allocated memory is still 545.3MB. Free memory was 351.8MB in the beginning and 343.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:54:51,988 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.25ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.10ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 93.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.35ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.96ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 90.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 489.07ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 71.0MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27274.32ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 70.6MB in the beginning and 351.8MB in the end (delta: -281.2MB). Peak memory consumption was 291.1MB. Max. memory is 16.1GB. * Witness Printer took 93.84ms. Allocated memory is still 545.3MB. Free memory was 351.8MB in the beginning and 343.4MB 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,"Specification5_spec.i","") [49] - GenericResultAtLocation [Line: 101]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [101] - GenericResultAtLocation [Line: 206]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [206] - GenericResultAtLocation [Line: 572]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [572] - GenericResultAtLocation [Line: 670]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [670] - GenericResultAtLocation [Line: 705]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [705] - GenericResultAtLocation [Line: 714]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [714] - GenericResultAtLocation [Line: 923]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [923] * 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: 710]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 14, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4993 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4966 mSDsluCounter, 9046 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7228 mSDsCounter, 1704 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6541 IncrementalHoareTripleChecker+Invalid, 8245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1704 mSolverCounterUnsat, 1818 mSDtfsCounter, 6541 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2246 GetRequests, 1957 SyntacticMatches, 24 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2642 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1403occurred in iteration=13, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 502 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2398 NumberOfCodeBlocks, 2398 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3352 ConstructedInterpolants, 0 QuantifiedInterpolants, 7449 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2871 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 3104/3663 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: 934]: Location Invariant Derived location invariant: (((((((((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 1)) || (((((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical == 1)) && (splverifierCounter == 0)) && (waterLevel == 1))) || ((((((switchedOnBeforeTS != 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 0)) && (pumpRunning == 1))) || (((((2 == waterLevel) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (pumpRunning == 1))) || (((((pumpRunning == 0) && (2 == waterLevel)) && (1 == systemActive)) && (methaneLevelCritical == 1)) && (splverifierCounter == 0))) || ((((((methaneLevelCritical == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 1)) && (1 <= switchedOnBeforeTS)) && (pumpRunning == 1))) || (((((pumpRunning == 0) && (2 == waterLevel)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical == 1)) && (splverifierCounter == 0)) && (waterLevel == 0))) || (((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel == 0))) - InvariantResult [Line: 114]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-02-05 15:54:52,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE