./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec14_product27.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/elevator_spec14_product27.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 6cc96375562d846fbf28439914184b0f5b3d70ee1197dff8e1988bf2754bc90e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:32:10,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:32:10,166 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:32:10,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:32:10,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:32:10,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:32:10,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:32:10,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:32:10,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:32:10,203 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:32:10,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:32:10,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:32:10,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:32:10,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:32:10,204 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:32:10,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:32:10,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:32:10,205 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:32:10,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:32:10,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:32:10,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:32:10,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:32:10,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:32:10,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:32:10,206 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:32:10,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:32:10,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:32:10,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:32:10,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:32:10,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:32:10,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:32:10,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:32:10,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:32:10,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:32:10,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:32:10,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:32:10,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:32:10,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:32:10,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:32:10,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:32:10,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:32:10,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:32:10,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:32:10,209 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 -> 6cc96375562d846fbf28439914184b0f5b3d70ee1197dff8e1988bf2754bc90e [2025-02-05 15:32:10,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:32:10,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:32:10,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:32:10,487 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:32:10,487 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:32:10,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec14_product27.cil.c [2025-02-05 15:32:11,801 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc6dbe4f2/e4edfdfe354f4fe99f511726cd13ca9b/FLAG87e85e623 [2025-02-05 15:32:12,222 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:32:12,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product27.cil.c [2025-02-05 15:32:12,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc6dbe4f2/e4edfdfe354f4fe99f511726cd13ca9b/FLAG87e85e623 [2025-02-05 15:32:12,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc6dbe4f2/e4edfdfe354f4fe99f511726cd13ca9b [2025-02-05 15:32:12,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:32:12,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:32:12,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:32:12,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:32:12,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:32:12,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:32:12" (1/1) ... [2025-02-05 15:32:12,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446f597d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:12, skipping insertion in model container [2025-02-05 15:32:12,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:32:12" (1/1) ... [2025-02-05 15:32:12,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:32:12,485 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/elevator_spec14_product27.cil.c[1546,1559] [2025-02-05 15:32:12,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:32:12,839 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:32:12,851 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-02-05 15:32:12,852 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [57] [2025-02-05 15:32:12,852 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1620] [2025-02-05 15:32:12,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1975] [2025-02-05 15:32:12,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2066] [2025-02-05 15:32:12,854 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2432] [2025-02-05 15:32:12,854 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2467] [2025-02-05 15:32:12,854 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [2481] [2025-02-05 15:32:12,854 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2517] [2025-02-05 15:32:12,854 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2635] [2025-02-05 15:32:12,859 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/elevator_spec14_product27.cil.c[1546,1559] [2025-02-05 15:32:12,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:32:13,007 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:32:13,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13 WrapperNode [2025-02-05 15:32:13,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:32:13,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:32:13,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:32:13,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:32:13,016 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:32:13" (1/1) ... [2025-02-05 15:32:13,045 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:32:13" (1/1) ... [2025-02-05 15:32:13,087 INFO L138 Inliner]: procedures = 92, calls = 335, calls flagged for inlining = 28, calls inlined = 25, statements flattened = 1091 [2025-02-05 15:32:13,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:32:13,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:32:13,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:32:13,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:32:13,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (1/1) ... [2025-02-05 15:32:13,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (1/1) ... [2025-02-05 15:32:13,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (1/1) ... [2025-02-05 15:32:13,135 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:32:13,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (1/1) ... [2025-02-05 15:32:13,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (1/1) ... [2025-02-05 15:32:13,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (1/1) ... [2025-02-05 15:32:13,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (1/1) ... [2025-02-05 15:32:13,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (1/1) ... [2025-02-05 15:32:13,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (1/1) ... [2025-02-05 15:32:13,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:32:13,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:32:13,191 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:32:13,191 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:32:13,192 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (1/1) ... [2025-02-05 15:32:13,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:32:13,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:13,224 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:32:13,227 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:32:13,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:32:13,250 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:32:13,250 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:32:13,250 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:32:13,250 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:32:13,250 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:32:13,250 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:32:13,250 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-02-05 15:32:13,251 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-02-05 15:32:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:32:13,251 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:32:13,251 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-02-05 15:32:13,251 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-02-05 15:32:13,252 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:32:13,252 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:32:13,252 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:32:13,252 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:32:13,252 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:32:13,253 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:32:13,253 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:32:13,253 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:32:13,253 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:32:13,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:32:13,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:32:13,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:32:13,254 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-02-05 15:32:13,254 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:32:13,254 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:32:13,254 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:32:13,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:32:13,254 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:32:13,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:32:13,255 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:32:13,255 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:32:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:32:13,258 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:32:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:32:13,258 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:32:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:32:13,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:32:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:32:13,258 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:32:13,441 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:32:13,443 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:32:13,497 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2632: #res := ~retValue_acc~26; [2025-02-05 15:32:13,529 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2554: #res := ~retValue_acc~24; [2025-02-05 15:32:13,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L150: #res := ~retValue_acc~0; [2025-02-05 15:32:13,551 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: #res := ~retValue_acc~1; [2025-02-05 15:32:13,649 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: #res#1 := ~retValue_acc~11#1; [2025-02-05 15:32:13,649 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L366-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~3#1; [2025-02-05 15:32:13,659 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1608: #res := ~retValue_acc~15; [2025-02-05 15:32:13,993 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L889: #res#1 := ~retValue_acc~9#1; [2025-02-05 15:32:13,994 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L860-1: stopRequestedInDirection__wrappee__empty_#res#1 := stopRequestedInDirection__wrappee__empty_~retValue_acc~8#1; [2025-02-05 15:32:14,062 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1024: #res := ~retValue_acc~13; [2025-02-05 15:32:14,074 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2593: #res := ~retValue_acc~25; [2025-02-05 15:32:14,131 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L415-1: isEmpty_#res#1 := isEmpty_~retValue_acc~5#1; [2025-02-05 15:32:14,197 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L495-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~6#1; [2025-02-05 15:32:14,198 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L508-1: isIdle_#res#1 := isIdle_~retValue_acc~7#1; [2025-02-05 15:32:14,316 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~12#1; [2025-02-05 15:32:14,316 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1617-1: isExecutiveFloor_#res#1 := isExecutiveFloor_~retValue_acc~16#1; [2025-02-05 15:32:14,316 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L332-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~2#1; [2025-02-05 15:32:14,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2982: #res := ~retValue_acc~28; [2025-02-05 15:32:14,458 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1972-1: main_#res#1 := main_~retValue_acc~18#1; [2025-02-05 15:32:14,458 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2464-1: valid_product_#res#1 := valid_product_~retValue_acc~23#1; [2025-02-05 15:32:14,471 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: #res := ~retValue_acc~27; [2025-02-05 15:32:14,474 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3293: #res := ~retValue_acc~29; [2025-02-05 15:32:14,656 INFO L? ?]: Removed 452 outVars from TransFormulas that were not future-live. [2025-02-05 15:32:14,656 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:32:14,691 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:32:14,691 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:32:14,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:32:14 BoogieIcfgContainer [2025-02-05 15:32:14,691 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:32:14,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:32:14,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:32:14,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:32:14,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:32:12" (1/3) ... [2025-02-05 15:32:14,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59efabb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:32:14, skipping insertion in model container [2025-02-05 15:32:14,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:32:13" (2/3) ... [2025-02-05 15:32:14,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59efabb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:32:14, skipping insertion in model container [2025-02-05 15:32:14,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:32:14" (3/3) ... [2025-02-05 15:32:14,705 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product27.cil.c [2025-02-05 15:32:14,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:32:14,719 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec14_product27.cil.c that has 24 procedures, 541 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:32:14,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:32:14,806 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;@2ebaf30e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:32:14,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:32:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 541 states, 422 states have (on average 1.6777251184834123) internal successors, (708), 439 states have internal predecessors, (708), 93 states have call successors, (93), 23 states have call predecessors, (93), 23 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) [2025-02-05 15:32:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 15:32:14,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:14,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:14,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:14,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:14,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1833207818, now seen corresponding path program 1 times [2025-02-05 15:32:14,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:14,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137404714] [2025-02-05 15:32:14,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:14,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:32:14,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:32:14,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:14,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:15,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137404714] [2025-02-05 15:32:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137404714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:15,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:32:15,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017429566] [2025-02-05 15:32:15,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:15,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:15,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:15,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:32:15,499 INFO L87 Difference]: Start difference. First operand has 541 states, 422 states have (on average 1.6777251184834123) internal successors, (708), 439 states have internal predecessors, (708), 93 states have call successors, (93), 23 states have call predecessors, (93), 23 states have return successors, (93), 91 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:15,691 INFO L93 Difference]: Finished difference Result 1075 states and 1788 transitions. [2025-02-05 15:32:15,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:32:15,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-02-05 15:32:15,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:15,713 INFO L225 Difference]: With dead ends: 1075 [2025-02-05 15:32:15,713 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:32:15,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:32:15,723 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 6 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:15,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2628 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:32:15,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-02-05 15:32:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 418 states have (on average 1.6698564593301435) internal successors, (698), 433 states have internal predecessors, (698), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 883 transitions. [2025-02-05 15:32:15,824 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 883 transitions. Word has length 101 [2025-02-05 15:32:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:15,824 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 883 transitions. [2025-02-05 15:32:15,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:15,827 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 883 transitions. [2025-02-05 15:32:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 15:32:15,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:15,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:15,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:32:15,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:15,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash -279971741, now seen corresponding path program 1 times [2025-02-05 15:32:15,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:15,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066276454] [2025-02-05 15:32:15,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:15,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:15,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:32:15,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:32:15,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:15,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:16,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:16,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066276454] [2025-02-05 15:32:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066276454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:32:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277852106] [2025-02-05 15:32:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:16,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:16,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:16,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:16,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:32:16,098 INFO L87 Difference]: Start difference. First operand 535 states and 883 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:16,195 INFO L93 Difference]: Finished difference Result 1053 states and 1743 transitions. [2025-02-05 15:32:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:32:16,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2025-02-05 15:32:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:16,200 INFO L225 Difference]: With dead ends: 1053 [2025-02-05 15:32:16,200 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:32:16,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:32:16,205 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 4 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:16,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2600 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:32:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-02-05 15:32:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 418 states have (on average 1.667464114832536) internal successors, (697), 433 states have internal predecessors, (697), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 882 transitions. [2025-02-05 15:32:16,253 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 882 transitions. Word has length 102 [2025-02-05 15:32:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:16,254 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 882 transitions. [2025-02-05 15:32:16,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 882 transitions. [2025-02-05 15:32:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:32:16,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:16,261 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:16,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:32:16,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:16,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1515084999, now seen corresponding path program 1 times [2025-02-05 15:32:16,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:16,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690286774] [2025-02-05 15:32:16,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:16,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:32:16,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:32:16,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:16,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:16,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690286774] [2025-02-05 15:32:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690286774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:16,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:16,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:32:16,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182518925] [2025-02-05 15:32:16,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:16,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:16,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:16,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:16,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:32:16,483 INFO L87 Difference]: Start difference. First operand 535 states and 882 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:16,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:16,568 INFO L93 Difference]: Finished difference Result 1053 states and 1742 transitions. [2025-02-05 15:32:16,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:32:16,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-02-05 15:32:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:16,574 INFO L225 Difference]: With dead ends: 1053 [2025-02-05 15:32:16,574 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:32:16,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:32:16,580 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 3 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:16,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2600 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:32:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-02-05 15:32:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 418 states have (on average 1.6650717703349283) internal successors, (696), 433 states have internal predecessors, (696), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 881 transitions. [2025-02-05 15:32:16,615 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 881 transitions. Word has length 103 [2025-02-05 15:32:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:16,616 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 881 transitions. [2025-02-05 15:32:16,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 881 transitions. [2025-02-05 15:32:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:32:16,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:16,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:16,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:32:16,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:16,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash -88584576, now seen corresponding path program 1 times [2025-02-05 15:32:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:16,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119389916] [2025-02-05 15:32:16,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:16,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:32:16,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:32:16,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:16,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:16,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119389916] [2025-02-05 15:32:16,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119389916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:16,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:16,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:32:16,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234511955] [2025-02-05 15:32:16,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:16,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:16,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:16,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:32:16,794 INFO L87 Difference]: Start difference. First operand 535 states and 881 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:16,862 INFO L93 Difference]: Finished difference Result 1053 states and 1741 transitions. [2025-02-05 15:32:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:32:16,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2025-02-05 15:32:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:16,867 INFO L225 Difference]: With dead ends: 1053 [2025-02-05 15:32:16,867 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:32:16,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:32:16,871 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 2 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:16,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2600 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:32:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-02-05 15:32:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 418 states have (on average 1.6626794258373205) internal successors, (695), 433 states have internal predecessors, (695), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 880 transitions. [2025-02-05 15:32:16,899 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 880 transitions. Word has length 104 [2025-02-05 15:32:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:16,900 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 880 transitions. [2025-02-05 15:32:16,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 880 transitions. [2025-02-05 15:32:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 15:32:16,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:16,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:16,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:32:16,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:16,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:16,914 INFO L85 PathProgramCache]: Analyzing trace with hash 321412484, now seen corresponding path program 1 times [2025-02-05 15:32:16,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:16,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112031520] [2025-02-05 15:32:16,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:16,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:16,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:32:16,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:32:16,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:16,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:17,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:17,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112031520] [2025-02-05 15:32:17,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112031520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:17,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:17,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:32:17,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743473417] [2025-02-05 15:32:17,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:17,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:17,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:17,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:32:17,058 INFO L87 Difference]: Start difference. First operand 535 states and 880 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:17,118 INFO L93 Difference]: Finished difference Result 1053 states and 1740 transitions. [2025-02-05 15:32:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:32:17,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2025-02-05 15:32:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:17,124 INFO L225 Difference]: With dead ends: 1053 [2025-02-05 15:32:17,124 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:32:17,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:32:17,128 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 1 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:17,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2600 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:32:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-02-05 15:32:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 418 states have (on average 1.6602870813397128) internal successors, (694), 433 states have internal predecessors, (694), 93 states have call successors, (93), 24 states have call predecessors, (93), 23 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 879 transitions. [2025-02-05 15:32:17,156 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 879 transitions. Word has length 105 [2025-02-05 15:32:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:17,156 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 879 transitions. [2025-02-05 15:32:17,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 879 transitions. [2025-02-05 15:32:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:32:17,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:17,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:17,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:32:17,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:17,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:17,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1269434211, now seen corresponding path program 1 times [2025-02-05 15:32:17,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:17,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745638929] [2025-02-05 15:32:17,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:17,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:17,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:32:17,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:32:17,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:17,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:17,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:17,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745638929] [2025-02-05 15:32:17,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745638929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:17,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:17,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:32:17,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29710017] [2025-02-05 15:32:17,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:17,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:32:17,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:17,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:32:17,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:32:17,435 INFO L87 Difference]: Start difference. First operand 535 states and 879 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:32:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:17,581 INFO L93 Difference]: Finished difference Result 1064 states and 1757 transitions. [2025-02-05 15:32:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:32:17,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2025-02-05 15:32:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:17,587 INFO L225 Difference]: With dead ends: 1064 [2025-02-05 15:32:17,588 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 15:32:17,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:17,591 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 91 mSDsluCounter, 5961 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6825 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:17,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6825 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 15:32:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2025-02-05 15:32:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 428 states have (on average 1.6565420560747663) internal successors, (709), 445 states have internal predecessors, (709), 94 states have call successors, (94), 24 states have call predecessors, (94), 25 states have return successors, (96), 91 states have call predecessors, (96), 93 states have call successors, (96) [2025-02-05 15:32:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 899 transitions. [2025-02-05 15:32:17,623 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 899 transitions. Word has length 106 [2025-02-05 15:32:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:17,624 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 899 transitions. [2025-02-05 15:32:17,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:32:17,625 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 899 transitions. [2025-02-05 15:32:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:32:17,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:17,631 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:17,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:32:17,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:17,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash -330902596, now seen corresponding path program 1 times [2025-02-05 15:32:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513282323] [2025-02-05 15:32:17,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:17,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:32:17,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:32:17,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:17,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:17,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513282323] [2025-02-05 15:32:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513282323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:17,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:17,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:32:17,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516882990] [2025-02-05 15:32:17,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:17,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:17,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:17,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:17,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:32:17,765 INFO L87 Difference]: Start difference. First operand 548 states and 899 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:17,820 INFO L93 Difference]: Finished difference Result 1071 states and 1768 transitions. [2025-02-05 15:32:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:32:17,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-02-05 15:32:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:17,825 INFO L225 Difference]: With dead ends: 1071 [2025-02-05 15:32:17,825 INFO L226 Difference]: Without dead ends: 544 [2025-02-05 15:32:17,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:32:17,829 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 1 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:17,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2595 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-05 15:32:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-02-05 15:32:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 426 states have (on average 1.6572769953051643) internal successors, (706), 442 states have internal predecessors, (706), 93 states have call successors, (93), 24 states have call predecessors, (93), 24 states have return successors, (93), 90 states have call predecessors, (93), 92 states have call successors, (93) [2025-02-05 15:32:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 892 transitions. [2025-02-05 15:32:17,855 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 892 transitions. Word has length 106 [2025-02-05 15:32:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:17,856 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 892 transitions. [2025-02-05 15:32:17,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 892 transitions. [2025-02-05 15:32:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:32:17,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:17,859 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:17,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:32:17,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:17,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1704491859, now seen corresponding path program 1 times [2025-02-05 15:32:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401310111] [2025-02-05 15:32:17,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:17,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:17,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:32:17,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:32:17,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:17,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:18,016 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:18,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401310111] [2025-02-05 15:32:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401310111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:18,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:18,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:32:18,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127892024] [2025-02-05 15:32:18,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:18,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:32:18,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:18,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:32:18,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:32:18,018 INFO L87 Difference]: Start difference. First operand 544 states and 892 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:18,316 INFO L93 Difference]: Finished difference Result 1114 states and 1840 transitions. [2025-02-05 15:32:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:32:18,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2025-02-05 15:32:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:18,321 INFO L225 Difference]: With dead ends: 1114 [2025-02-05 15:32:18,322 INFO L226 Difference]: Without dead ends: 576 [2025-02-05 15:32:18,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:32:18,325 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 72 mSDsluCounter, 3285 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:18,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 4126 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:32:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-02-05 15:32:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 549. [2025-02-05 15:32:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 431 states have (on average 1.642691415313225) internal successors, (708), 446 states have internal predecessors, (708), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 893 transitions. [2025-02-05 15:32:18,356 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 893 transitions. Word has length 107 [2025-02-05 15:32:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:18,356 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 893 transitions. [2025-02-05 15:32:18,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 893 transitions. [2025-02-05 15:32:18,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:32:18,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:18,360 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:18,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:32:18,360 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:18,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1415083316, now seen corresponding path program 1 times [2025-02-05 15:32:18,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:18,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719772252] [2025-02-05 15:32:18,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:18,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:18,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:32:18,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:32:18,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:18,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:18,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:18,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719772252] [2025-02-05 15:32:18,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719772252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:18,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:18,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:32:18,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276890793] [2025-02-05 15:32:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:18,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:32:18,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:18,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:32:18,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:32:18,552 INFO L87 Difference]: Start difference. First operand 549 states and 893 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:18,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:18,775 INFO L93 Difference]: Finished difference Result 1065 states and 1735 transitions. [2025-02-05 15:32:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:32:18,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-02-05 15:32:18,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:18,780 INFO L225 Difference]: With dead ends: 1065 [2025-02-05 15:32:18,781 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:32:18,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:32:18,785 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 56 mSDsluCounter, 3273 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:18,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4103 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:32:18,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:32:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 549. [2025-02-05 15:32:18,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 431 states have (on average 1.6334106728538282) internal successors, (704), 446 states have internal predecessors, (704), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 889 transitions. [2025-02-05 15:32:18,809 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 889 transitions. Word has length 108 [2025-02-05 15:32:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:18,809 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 889 transitions. [2025-02-05 15:32:18,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 889 transitions. [2025-02-05 15:32:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:32:18,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:18,813 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:18,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:32:18,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:18,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1427428470, now seen corresponding path program 1 times [2025-02-05 15:32:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693299713] [2025-02-05 15:32:18,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:18,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:18,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:32:18,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:32:18,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:18,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:18,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693299713] [2025-02-05 15:32:18,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693299713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:18,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:18,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:32:18,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969877291] [2025-02-05 15:32:18,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:18,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:32:18,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:18,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:32:18,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:32:18,979 INFO L87 Difference]: Start difference. First operand 549 states and 889 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:19,165 INFO L93 Difference]: Finished difference Result 1065 states and 1731 transitions. [2025-02-05 15:32:19,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:32:19,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-02-05 15:32:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:19,171 INFO L225 Difference]: With dead ends: 1065 [2025-02-05 15:32:19,171 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:32:19,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:32:19,174 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 55 mSDsluCounter, 3269 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:19,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4098 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:32:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 549. [2025-02-05 15:32:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 431 states have (on average 1.6241299303944317) internal successors, (700), 446 states have internal predecessors, (700), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 885 transitions. [2025-02-05 15:32:19,196 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 885 transitions. Word has length 109 [2025-02-05 15:32:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:19,197 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 885 transitions. [2025-02-05 15:32:19,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 885 transitions. [2025-02-05 15:32:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:32:19,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:19,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:19,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:32:19,200 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:19,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:19,201 INFO L85 PathProgramCache]: Analyzing trace with hash 253961701, now seen corresponding path program 1 times [2025-02-05 15:32:19,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:19,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285118740] [2025-02-05 15:32:19,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:19,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:19,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:32:19,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:32:19,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:19,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:19,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:19,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285118740] [2025-02-05 15:32:19,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285118740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:19,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:19,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:32:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317420504] [2025-02-05 15:32:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:19,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:32:19,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:19,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:32:19,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:32:19,353 INFO L87 Difference]: Start difference. First operand 549 states and 885 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:32:19,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:19,442 INFO L93 Difference]: Finished difference Result 1056 states and 1713 transitions. [2025-02-05 15:32:19,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:32:19,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 109 [2025-02-05 15:32:19,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:19,447 INFO L225 Difference]: With dead ends: 1056 [2025-02-05 15:32:19,448 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 15:32:19,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:32:19,451 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 94 mSDsluCounter, 4179 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 5034 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:19,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 5034 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 15:32:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 528. [2025-02-05 15:32:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 410 states have (on average 1.6170731707317074) internal successors, (663), 425 states have internal predecessors, (663), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 848 transitions. [2025-02-05 15:32:19,473 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 848 transitions. Word has length 109 [2025-02-05 15:32:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:19,473 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 848 transitions. [2025-02-05 15:32:19,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:32:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 848 transitions. [2025-02-05 15:32:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:32:19,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:19,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:19,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:32:19,477 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:19,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2090763657, now seen corresponding path program 1 times [2025-02-05 15:32:19,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141637377] [2025-02-05 15:32:19,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:19,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:32:19,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:32:19,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:19,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:19,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:19,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141637377] [2025-02-05 15:32:19,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141637377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:19,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:19,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:32:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229384283] [2025-02-05 15:32:19,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:19,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:32:19,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:19,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:32:19,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:32:19,623 INFO L87 Difference]: Start difference. First operand 528 states and 848 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:19,729 INFO L93 Difference]: Finished difference Result 1035 states and 1676 transitions. [2025-02-05 15:32:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:32:19,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-02-05 15:32:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:19,735 INFO L225 Difference]: With dead ends: 1035 [2025-02-05 15:32:19,735 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 15:32:19,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:32:19,739 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 39 mSDsluCounter, 3273 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:19,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 4103 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 15:32:19,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 528. [2025-02-05 15:32:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 410 states have (on average 1.6146341463414635) internal successors, (662), 425 states have internal predecessors, (662), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 847 transitions. [2025-02-05 15:32:19,761 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 847 transitions. Word has length 110 [2025-02-05 15:32:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:19,762 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 847 transitions. [2025-02-05 15:32:19,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 847 transitions. [2025-02-05 15:32:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:32:19,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:19,765 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:32:19,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:32:19,765 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:19,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:19,766 INFO L85 PathProgramCache]: Analyzing trace with hash 908505497, now seen corresponding path program 1 times [2025-02-05 15:32:19,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:19,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142125921] [2025-02-05 15:32:19,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:19,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:19,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:32:19,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:32:19,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:19,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:19,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:19,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142125921] [2025-02-05 15:32:19,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142125921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:19,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:19,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:32:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186780338] [2025-02-05 15:32:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:19,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:32:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:19,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:32:19,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:32:19,905 INFO L87 Difference]: Start difference. First operand 528 states and 847 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:20,020 INFO L93 Difference]: Finished difference Result 1035 states and 1675 transitions. [2025-02-05 15:32:20,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:32:20,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-02-05 15:32:20,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:20,025 INFO L225 Difference]: With dead ends: 1035 [2025-02-05 15:32:20,026 INFO L226 Difference]: Without dead ends: 537 [2025-02-05 15:32:20,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:32:20,030 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 38 mSDsluCounter, 3273 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:20,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4103 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:20,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-05 15:32:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 528. [2025-02-05 15:32:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 410 states have (on average 1.6121951219512196) internal successors, (661), 425 states have internal predecessors, (661), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 846 transitions. [2025-02-05 15:32:20,069 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 846 transitions. Word has length 111 [2025-02-05 15:32:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:20,070 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 846 transitions. [2025-02-05 15:32:20,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:32:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 846 transitions. [2025-02-05 15:32:20,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:32:20,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:20,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:20,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:32:20,073 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:20,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash -209355846, now seen corresponding path program 1 times [2025-02-05 15:32:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:20,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727989808] [2025-02-05 15:32:20,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:20,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:20,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:32:20,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:32:20,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:20,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:32:20,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:20,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727989808] [2025-02-05 15:32:20,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727989808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:20,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:20,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:32:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302148699] [2025-02-05 15:32:20,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:20,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:32:20,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:20,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:32:20,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:20,309 INFO L87 Difference]: Start difference. First operand 528 states and 846 transitions. Second operand has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:32:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:20,488 INFO L93 Difference]: Finished difference Result 1025 states and 1657 transitions. [2025-02-05 15:32:20,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:32:20,489 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2025-02-05 15:32:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:20,494 INFO L225 Difference]: With dead ends: 1025 [2025-02-05 15:32:20,494 INFO L226 Difference]: Without dead ends: 533 [2025-02-05 15:32:20,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:32:20,497 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 21 mSDsluCounter, 6385 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 7187 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:20,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 7187 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-02-05 15:32:20,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 530. [2025-02-05 15:32:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 412 states have (on average 1.6067961165048543) internal successors, (662), 427 states have internal predecessors, (662), 93 states have call successors, (93), 25 states have call predecessors, (93), 24 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 15:32:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 847 transitions. [2025-02-05 15:32:20,520 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 847 transitions. Word has length 112 [2025-02-05 15:32:20,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:20,520 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 847 transitions. [2025-02-05 15:32:20,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:32:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 847 transitions. [2025-02-05 15:32:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:32:20,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:20,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:20,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:32:20,524 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash -183208212, now seen corresponding path program 1 times [2025-02-05 15:32:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:20,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076542062] [2025-02-05 15:32:20,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:20,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:32:20,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:32:20,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:20,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:32:20,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076542062] [2025-02-05 15:32:20,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076542062] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:20,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800308625] [2025-02-05 15:32:20,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:20,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:20,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:20,679 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:32:20,682 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:32:20,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:32:21,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:32:21,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:21,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:21,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:32:21,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 15:32:21,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:21,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800308625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:21,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:21,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:32:21,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054727407] [2025-02-05 15:32:21,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:21,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:32:21,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:21,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:32:21,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:32:21,061 INFO L87 Difference]: Start difference. First operand 530 states and 847 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:21,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:21,133 INFO L93 Difference]: Finished difference Result 1499 states and 2462 transitions. [2025-02-05 15:32:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:32:21,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-02-05 15:32:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:21,142 INFO L225 Difference]: With dead ends: 1499 [2025-02-05 15:32:21,142 INFO L226 Difference]: Without dead ends: 1012 [2025-02-05 15:32:21,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:32:21,147 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 823 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:21,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1706 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-02-05 15:32:21,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1005. [2025-02-05 15:32:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 781 states have (on average 1.6274007682458387) internal successors, (1271), 809 states have internal predecessors, (1271), 178 states have call successors, (178), 46 states have call predecessors, (178), 45 states have return successors, (188), 175 states have call predecessors, (188), 176 states have call successors, (188) [2025-02-05 15:32:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1637 transitions. [2025-02-05 15:32:21,200 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1637 transitions. Word has length 113 [2025-02-05 15:32:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:21,202 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1637 transitions. [2025-02-05 15:32:21,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1637 transitions. [2025-02-05 15:32:21,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:32:21,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:21,205 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:21,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:32:21,409 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,SelfDestructingSolverStorable14 [2025-02-05 15:32:21,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:21,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash -214228019, now seen corresponding path program 1 times [2025-02-05 15:32:21,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:21,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997941419] [2025-02-05 15:32:21,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:21,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:32:21,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:32:21,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:21,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:32:21,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997941419] [2025-02-05 15:32:21,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997941419] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006775257] [2025-02-05 15:32:21,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:21,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:21,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:21,533 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:32:21,535 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:32:21,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:32:21,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:32:21,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:21,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:21,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:32:21,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:32:22,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:22,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006775257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:22,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:22,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:32:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274174366] [2025-02-05 15:32:22,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:22,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:32:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:22,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:32:22,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:32:22,012 INFO L87 Difference]: Start difference. First operand 1005 states and 1637 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:22,662 INFO L93 Difference]: Finished difference Result 1983 states and 3303 transitions. [2025-02-05 15:32:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:32:22,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-02-05 15:32:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:22,672 INFO L225 Difference]: With dead ends: 1983 [2025-02-05 15:32:22,672 INFO L226 Difference]: Without dead ends: 1021 [2025-02-05 15:32:22,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:22,681 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 785 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:22,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2060 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:32:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-02-05 15:32:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1021. [2025-02-05 15:32:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 795 states have (on average 1.628930817610063) internal successors, (1295), 823 states have internal predecessors, (1295), 178 states have call successors, (178), 48 states have call predecessors, (178), 47 states have return successors, (190), 175 states have call predecessors, (190), 176 states have call successors, (190) [2025-02-05 15:32:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1663 transitions. [2025-02-05 15:32:22,738 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1663 transitions. Word has length 113 [2025-02-05 15:32:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:22,738 INFO L471 AbstractCegarLoop]: Abstraction has 1021 states and 1663 transitions. [2025-02-05 15:32:22,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1663 transitions. [2025-02-05 15:32:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:32:22,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:22,742 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:22,752 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:32:22,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:32:22,943 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:22,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1161000288, now seen corresponding path program 1 times [2025-02-05 15:32:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:22,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834746430] [2025-02-05 15:32:22,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:22,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:32:22,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:32:22,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:22,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:32:23,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:23,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834746430] [2025-02-05 15:32:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834746430] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:23,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878833818] [2025-02-05 15:32:23,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:23,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:23,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:23,063 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:32:23,066 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:32:23,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:32:23,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:32:23,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:23,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:23,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:32:23,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:32:23,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:23,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878833818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:23,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:23,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:32:23,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246685422] [2025-02-05 15:32:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:23,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:32:23,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:23,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:32:23,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:32:23,505 INFO L87 Difference]: Start difference. First operand 1021 states and 1663 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:24,078 INFO L93 Difference]: Finished difference Result 2015 states and 3349 transitions. [2025-02-05 15:32:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:32:24,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-02-05 15:32:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:24,086 INFO L225 Difference]: With dead ends: 2015 [2025-02-05 15:32:24,086 INFO L226 Difference]: Without dead ends: 1037 [2025-02-05 15:32:24,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:24,095 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 776 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:24,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 2057 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:32:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2025-02-05 15:32:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2025-02-05 15:32:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 809 states have (on average 1.6304079110012362) internal successors, (1319), 837 states have internal predecessors, (1319), 178 states have call successors, (178), 50 states have call predecessors, (178), 49 states have return successors, (192), 175 states have call predecessors, (192), 176 states have call successors, (192) [2025-02-05 15:32:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1689 transitions. [2025-02-05 15:32:24,145 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1689 transitions. Word has length 116 [2025-02-05 15:32:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:24,146 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1689 transitions. [2025-02-05 15:32:24,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1689 transitions. [2025-02-05 15:32:24,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:32:24,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:24,149 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:24,159 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:32:24,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:24,350 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:24,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2023089046, now seen corresponding path program 1 times [2025-02-05 15:32:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:24,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487788975] [2025-02-05 15:32:24,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:24,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:24,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:32:24,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:32:24,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:24,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:32:24,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487788975] [2025-02-05 15:32:24,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487788975] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343963662] [2025-02-05 15:32:24,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:24,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:24,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:24,488 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:32:24,489 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:32:24,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:32:24,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:32:24,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:24,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:24,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:32:24,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 15:32:24,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:24,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343963662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:24,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:24,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:32:24,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970050170] [2025-02-05 15:32:24,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:24,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:32:24,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:24,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:32:24,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:32:24,878 INFO L87 Difference]: Start difference. First operand 1037 states and 1689 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:25,425 INFO L93 Difference]: Finished difference Result 2047 states and 3395 transitions. [2025-02-05 15:32:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:32:25,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-02-05 15:32:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:25,435 INFO L225 Difference]: With dead ends: 2047 [2025-02-05 15:32:25,435 INFO L226 Difference]: Without dead ends: 1053 [2025-02-05 15:32:25,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:25,443 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 767 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:25,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 2054 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:32:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-02-05 15:32:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2025-02-05 15:32:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 823 states have (on average 1.6318347509113) internal successors, (1343), 851 states have internal predecessors, (1343), 178 states have call successors, (178), 52 states have call predecessors, (178), 51 states have return successors, (194), 175 states have call predecessors, (194), 176 states have call successors, (194) [2025-02-05 15:32:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1715 transitions. [2025-02-05 15:32:25,497 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1715 transitions. Word has length 119 [2025-02-05 15:32:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:25,497 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1715 transitions. [2025-02-05 15:32:25,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1715 transitions. [2025-02-05 15:32:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:32:25,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:25,501 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:25,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:32:25,702 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,SelfDestructingSolverStorable17 [2025-02-05 15:32:25,703 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:25,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash -95256329, now seen corresponding path program 1 times [2025-02-05 15:32:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:25,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557133654] [2025-02-05 15:32:25,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:25,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:25,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:32:25,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:32:25,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:25,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 15:32:25,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:25,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557133654] [2025-02-05 15:32:25,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557133654] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:25,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342825198] [2025-02-05 15:32:25,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:25,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:25,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:25,865 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:32:25,868 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:32:26,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:32:26,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:32:26,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:26,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:26,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:32:26,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 15:32:26,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:26,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342825198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:26,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:26,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:32:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359306963] [2025-02-05 15:32:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:26,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:32:26,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:26,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:32:26,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:32:26,266 INFO L87 Difference]: Start difference. First operand 1053 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:26,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:26,798 INFO L93 Difference]: Finished difference Result 2079 states and 3441 transitions. [2025-02-05 15:32:26,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:32:26,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-05 15:32:26,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:26,806 INFO L225 Difference]: With dead ends: 2079 [2025-02-05 15:32:26,807 INFO L226 Difference]: Without dead ends: 1069 [2025-02-05 15:32:26,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:26,814 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 774 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:26,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 2051 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:32:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-02-05 15:32:26,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2025-02-05 15:32:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 837 states have (on average 1.6332138590203107) internal successors, (1367), 865 states have internal predecessors, (1367), 178 states have call successors, (178), 54 states have call predecessors, (178), 53 states have return successors, (196), 175 states have call predecessors, (196), 176 states have call successors, (196) [2025-02-05 15:32:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1741 transitions. [2025-02-05 15:32:26,859 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1741 transitions. Word has length 122 [2025-02-05 15:32:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:26,860 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1741 transitions. [2025-02-05 15:32:26,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1741 transitions. [2025-02-05 15:32:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:32:26,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:26,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:26,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:32:27,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:27,064 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:27,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:27,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1572803457, now seen corresponding path program 1 times [2025-02-05 15:32:27,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:27,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616679063] [2025-02-05 15:32:27,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:27,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:32:27,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:32:27,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:27,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:32:27,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:27,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616679063] [2025-02-05 15:32:27,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616679063] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:27,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987610253] [2025-02-05 15:32:27,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:27,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:27,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:27,215 INFO L229 MonitoredProcess]: Starting monitored process 7 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:32:27,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:32:27,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:32:27,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:32:27,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:27,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:27,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 15:32:27,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:32:27,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987610253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:27,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:27,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-05 15:32:27,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126269112] [2025-02-05 15:32:27,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:27,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:32:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:27,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:32:27,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:32:27,642 INFO L87 Difference]: Start difference. First operand 1069 states and 1741 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:28,210 INFO L93 Difference]: Finished difference Result 2099 states and 3495 transitions. [2025-02-05 15:32:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:32:28,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-02-05 15:32:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:28,219 INFO L225 Difference]: With dead ends: 2099 [2025-02-05 15:32:28,219 INFO L226 Difference]: Without dead ends: 1073 [2025-02-05 15:32:28,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:32:28,227 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 770 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:28,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 2051 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:32:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-02-05 15:32:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2025-02-05 15:32:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 839 states have (on average 1.6221692491060786) internal successors, (1361), 869 states have internal predecessors, (1361), 178 states have call successors, (178), 54 states have call predecessors, (178), 55 states have return successors, (198), 175 states have call predecessors, (198), 176 states have call successors, (198) [2025-02-05 15:32:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1737 transitions. [2025-02-05 15:32:28,283 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1737 transitions. Word has length 125 [2025-02-05 15:32:28,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:28,284 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1737 transitions. [2025-02-05 15:32:28,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:32:28,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1737 transitions. [2025-02-05 15:32:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:32:28,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:28,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:28,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:32:28,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:28,489 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:28,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash 948902535, now seen corresponding path program 1 times [2025-02-05 15:32:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:28,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418500890] [2025-02-05 15:32:28,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:28,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:28,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:32:28,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:32:28,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:28,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:32:28,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418500890] [2025-02-05 15:32:28,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418500890] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849869175] [2025-02-05 15:32:28,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:28,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:28,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:28,752 INFO L229 MonitoredProcess]: Starting monitored process 8 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:32:28,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:32:28,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:32:29,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:32:29,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:29,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:29,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 15:32:29,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 15:32:29,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849869175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:29,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:29,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-02-05 15:32:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883723506] [2025-02-05 15:32:29,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:29,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:32:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:29,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:32:29,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:32:29,221 INFO L87 Difference]: Start difference. First operand 1073 states and 1737 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:32:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:29,815 INFO L93 Difference]: Finished difference Result 2113 states and 3449 transitions. [2025-02-05 15:32:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:32:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2025-02-05 15:32:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:29,824 INFO L225 Difference]: With dead ends: 2113 [2025-02-05 15:32:29,824 INFO L226 Difference]: Without dead ends: 1083 [2025-02-05 15:32:29,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:32:29,830 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 811 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 3461 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:29,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 3461 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:32:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-02-05 15:32:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1076. [2025-02-05 15:32:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 841 states have (on average 1.6206896551724137) internal successors, (1363), 872 states have internal predecessors, (1363), 178 states have call successors, (178), 54 states have call predecessors, (178), 56 states have return successors, (199), 175 states have call predecessors, (199), 176 states have call successors, (199) [2025-02-05 15:32:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1740 transitions. [2025-02-05 15:32:29,881 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1740 transitions. Word has length 125 [2025-02-05 15:32:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:29,882 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1740 transitions. [2025-02-05 15:32:29,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:32:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1740 transitions. [2025-02-05 15:32:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:32:29,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:29,885 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:29,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 15:32:30,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:30,086 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:30,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:30,087 INFO L85 PathProgramCache]: Analyzing trace with hash 110760417, now seen corresponding path program 1 times [2025-02-05 15:32:30,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:30,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053279460] [2025-02-05 15:32:30,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:30,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:30,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:32:30,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:32:30,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:30,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:32:30,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:30,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053279460] [2025-02-05 15:32:30,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053279460] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:30,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630745480] [2025-02-05 15:32:30,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:30,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:30,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:30,349 INFO L229 MonitoredProcess]: Starting monitored process 9 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:32:30,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:32:30,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:32:30,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:32:30,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:30,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:30,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 1224 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:32:30,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:32:30,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630745480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:30,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:30,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-02-05 15:32:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142337844] [2025-02-05 15:32:30,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:30,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:32:30,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:30,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:32:30,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:32:30,768 INFO L87 Difference]: Start difference. First operand 1076 states and 1740 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:32:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:31,216 INFO L93 Difference]: Finished difference Result 2127 states and 3487 transitions. [2025-02-05 15:32:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:32:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-02-05 15:32:31,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:31,226 INFO L225 Difference]: With dead ends: 2127 [2025-02-05 15:32:31,226 INFO L226 Difference]: Without dead ends: 1094 [2025-02-05 15:32:31,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:32:31,232 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 756 mSDsluCounter, 2286 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 3138 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:31,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 3138 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:32:31,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2025-02-05 15:32:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1086. [2025-02-05 15:32:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 847 states have (on average 1.61629279811098) internal successors, (1369), 881 states have internal predecessors, (1369), 180 states have call successors, (180), 55 states have call predecessors, (180), 58 states have return successors, (209), 175 states have call predecessors, (209), 178 states have call successors, (209) [2025-02-05 15:32:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1758 transitions. [2025-02-05 15:32:31,284 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1758 transitions. Word has length 127 [2025-02-05 15:32:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:31,285 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1758 transitions. [2025-02-05 15:32:31,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:32:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1758 transitions. [2025-02-05 15:32:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:32:31,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:31,290 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:31,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 15:32:31,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:31,494 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:31,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:31,495 INFO L85 PathProgramCache]: Analyzing trace with hash 733537883, now seen corresponding path program 1 times [2025-02-05 15:32:31,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:31,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83598250] [2025-02-05 15:32:31,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:31,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:31,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:32:31,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:32:31,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:31,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:32:31,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:31,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83598250] [2025-02-05 15:32:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83598250] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:31,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643761655] [2025-02-05 15:32:31,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:31,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:31,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:31,740 INFO L229 MonitoredProcess]: Starting monitored process 10 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:32:31,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 15:32:31,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:32:32,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:32:32,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:32,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:32,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 1241 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:32:32,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:32:32,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:32,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643761655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:32,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:32,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-02-05 15:32:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001510810] [2025-02-05 15:32:32,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:32,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:32:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:32,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:32:32,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:32,027 INFO L87 Difference]: Start difference. First operand 1086 states and 1758 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:32:32,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:32,107 INFO L93 Difference]: Finished difference Result 2641 states and 4344 transitions. [2025-02-05 15:32:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:32:32,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-02-05 15:32:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:32,120 INFO L225 Difference]: With dead ends: 2641 [2025-02-05 15:32:32,120 INFO L226 Difference]: Without dead ends: 1599 [2025-02-05 15:32:32,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:32,126 INFO L435 NwaCegarLoop]: 1584 mSDtfsCounter, 786 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 2404 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:32,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 2404 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-02-05 15:32:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1086. [2025-02-05 15:32:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 847 states have (on average 1.615112160566706) internal successors, (1368), 881 states have internal predecessors, (1368), 180 states have call successors, (180), 55 states have call predecessors, (180), 58 states have return successors, (209), 175 states have call predecessors, (209), 178 states have call successors, (209) [2025-02-05 15:32:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1757 transitions. [2025-02-05 15:32:32,207 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1757 transitions. Word has length 132 [2025-02-05 15:32:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:32,207 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1757 transitions. [2025-02-05 15:32:32,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:32:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1757 transitions. [2025-02-05 15:32:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:32:32,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:32,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:32,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 15:32:32,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:32,412 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:32,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1084337820, now seen corresponding path program 1 times [2025-02-05 15:32:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:32,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114810030] [2025-02-05 15:32:32,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:32,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:32,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:32:32,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:32:32,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:32,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:32:32,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114810030] [2025-02-05 15:32:32,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114810030] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:32,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636569164] [2025-02-05 15:32:32,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:32,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:32,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:32,623 INFO L229 MonitoredProcess]: Starting monitored process 11 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:32:32,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 15:32:32,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:32:32,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:32:32,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:32,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:32,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:32:32,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:32:32,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636569164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-02-05 15:32:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571063482] [2025-02-05 15:32:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:32,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:32:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:32,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:32:32,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:32:32,989 INFO L87 Difference]: Start difference. First operand 1086 states and 1757 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:32:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:33,083 INFO L93 Difference]: Finished difference Result 2704 states and 4396 transitions. [2025-02-05 15:32:33,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:32:33,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-02-05 15:32:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:33,096 INFO L225 Difference]: With dead ends: 2704 [2025-02-05 15:32:33,096 INFO L226 Difference]: Without dead ends: 1663 [2025-02-05 15:32:33,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:32:33,102 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 344 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 3529 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:33,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 3529 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-02-05 15:32:33,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2025-02-05 15:32:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1301 states have (on average 1.5872405841660262) internal successors, (2065), 1342 states have internal predecessors, (2065), 264 states have call successors, (264), 91 states have call predecessors, (264), 97 states have return successors, (347), 255 states have call predecessors, (347), 260 states have call successors, (347) [2025-02-05 15:32:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2676 transitions. [2025-02-05 15:32:33,191 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2676 transitions. Word has length 132 [2025-02-05 15:32:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:33,192 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2676 transitions. [2025-02-05 15:32:33,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:32:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2676 transitions. [2025-02-05 15:32:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:32:33,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:33,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:33,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 15:32:33,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-05 15:32:33,397 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:33,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:33,398 INFO L85 PathProgramCache]: Analyzing trace with hash 476260957, now seen corresponding path program 1 times [2025-02-05 15:32:33,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:33,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437924387] [2025-02-05 15:32:33,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:33,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:32:33,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:32:33,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:33,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:32:33,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437924387] [2025-02-05 15:32:33,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437924387] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257504981] [2025-02-05 15:32:33,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:33,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:33,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:33,611 INFO L229 MonitoredProcess]: Starting monitored process 12 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:32:33,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 15:32:33,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:32:33,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:32:33,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:33,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:33,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 15:32:33,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:33,953 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:32:33,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:33,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257504981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:33,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:33,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 10 [2025-02-05 15:32:33,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086347333] [2025-02-05 15:32:33,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:33,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:32:33,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:33,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:32:33,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:33,954 INFO L87 Difference]: Start difference. First operand 1663 states and 2676 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:32:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:34,046 INFO L93 Difference]: Finished difference Result 3031 states and 4867 transitions. [2025-02-05 15:32:34,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:32:34,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-02-05 15:32:34,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:34,058 INFO L225 Difference]: With dead ends: 3031 [2025-02-05 15:32:34,058 INFO L226 Difference]: Without dead ends: 1413 [2025-02-05 15:32:34,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:34,067 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 548 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:34,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1322 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:32:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2025-02-05 15:32:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413. [2025-02-05 15:32:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1103 states have (on average 1.5666364460562103) internal successors, (1728), 1135 states have internal predecessors, (1728), 223 states have call successors, (223), 83 states have call predecessors, (223), 86 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-02-05 15:32:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2234 transitions. [2025-02-05 15:32:34,157 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2234 transitions. Word has length 132 [2025-02-05 15:32:34,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:34,158 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2234 transitions. [2025-02-05 15:32:34,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:32:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2234 transitions. [2025-02-05 15:32:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 15:32:34,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:34,164 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:34,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-05 15:32:34,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-05 15:32:34,365 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:34,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:34,365 INFO L85 PathProgramCache]: Analyzing trace with hash 875641641, now seen corresponding path program 1 times [2025-02-05 15:32:34,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:34,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637233020] [2025-02-05 15:32:34,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:34,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:34,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 15:32:34,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 15:32:34,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:34,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-05 15:32:34,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637233020] [2025-02-05 15:32:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637233020] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716913833] [2025-02-05 15:32:34,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:34,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:34,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:34,593 INFO L229 MonitoredProcess]: Starting monitored process 13 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:32:34,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 15:32:34,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 15:32:34,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 15:32:34,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:34,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:34,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:32:34,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:32:34,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:34,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716913833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:34,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:34,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-02-05 15:32:34,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557269363] [2025-02-05 15:32:34,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:34,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:34,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:34,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:32:34,906 INFO L87 Difference]: Start difference. First operand 1413 states and 2234 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:32:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:35,131 INFO L93 Difference]: Finished difference Result 2871 states and 4600 transitions. [2025-02-05 15:32:35,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:32:35,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 155 [2025-02-05 15:32:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:35,143 INFO L225 Difference]: With dead ends: 2871 [2025-02-05 15:32:35,143 INFO L226 Difference]: Without dead ends: 1503 [2025-02-05 15:32:35,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:32:35,150 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 144 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:35,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2275 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2025-02-05 15:32:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1491. [2025-02-05 15:32:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1179 states have (on average 1.5894826123833758) internal successors, (1874), 1211 states have internal predecessors, (1874), 223 states have call successors, (223), 85 states have call predecessors, (223), 88 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-02-05 15:32:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2380 transitions. [2025-02-05 15:32:35,217 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2380 transitions. Word has length 155 [2025-02-05 15:32:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:35,217 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 2380 transitions. [2025-02-05 15:32:35,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:32:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2380 transitions. [2025-02-05 15:32:35,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 15:32:35,223 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:35,223 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:35,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 15:32:35,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:35,425 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:35,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 390419403, now seen corresponding path program 1 times [2025-02-05 15:32:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:35,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648090830] [2025-02-05 15:32:35,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:35,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:35,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 15:32:35,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 15:32:35,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:35,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 15:32:35,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:35,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648090830] [2025-02-05 15:32:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648090830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:35,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171221288] [2025-02-05 15:32:35,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:35,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:35,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:35,643 INFO L229 MonitoredProcess]: Starting monitored process 14 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:32:35,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 15:32:35,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 15:32:35,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 15:32:35,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:35,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:35,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 1337 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:32:35,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:32:35,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:35,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171221288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:35,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:35,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-02-05 15:32:35,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675367426] [2025-02-05 15:32:35,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:35,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:35,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:35,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:35,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:32:35,979 INFO L87 Difference]: Start difference. First operand 1491 states and 2380 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:32:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:36,205 INFO L93 Difference]: Finished difference Result 3033 states and 4894 transitions. [2025-02-05 15:32:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:32:36,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 160 [2025-02-05 15:32:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:36,224 INFO L225 Difference]: With dead ends: 3033 [2025-02-05 15:32:36,224 INFO L226 Difference]: Without dead ends: 1587 [2025-02-05 15:32:36,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:32:36,230 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 142 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:36,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 2272 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2025-02-05 15:32:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1569. [2025-02-05 15:32:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1255 states have (on average 1.6095617529880477) internal successors, (2020), 1287 states have internal predecessors, (2020), 223 states have call successors, (223), 87 states have call predecessors, (223), 90 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-02-05 15:32:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2526 transitions. [2025-02-05 15:32:36,293 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2526 transitions. Word has length 160 [2025-02-05 15:32:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:36,294 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2526 transitions. [2025-02-05 15:32:36,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:32:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2526 transitions. [2025-02-05 15:32:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 15:32:36,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:36,298 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:36,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-05 15:32:36,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:36,499 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:36,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1859791765, now seen corresponding path program 1 times [2025-02-05 15:32:36,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:36,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194452172] [2025-02-05 15:32:36,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:36,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:36,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 15:32:36,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 15:32:36,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:36,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 15:32:36,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:36,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194452172] [2025-02-05 15:32:36,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194452172] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:36,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915146535] [2025-02-05 15:32:36,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:36,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:36,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:36,706 INFO L229 MonitoredProcess]: Starting monitored process 15 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:32:36,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 15:32:36,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 15:32:36,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 15:32:36,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:36,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:37,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:32:37,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:32:37,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:37,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915146535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:37,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-02-05 15:32:37,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839192534] [2025-02-05 15:32:37,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:37,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:37,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:37,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:32:37,069 INFO L87 Difference]: Start difference. First operand 1569 states and 2526 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:32:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:37,232 INFO L93 Difference]: Finished difference Result 3195 states and 5188 transitions. [2025-02-05 15:32:37,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:32:37,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2025-02-05 15:32:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:37,243 INFO L225 Difference]: With dead ends: 3195 [2025-02-05 15:32:37,244 INFO L226 Difference]: Without dead ends: 1671 [2025-02-05 15:32:37,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:32:37,250 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 140 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:37,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 2269 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:37,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-02-05 15:32:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1647. [2025-02-05 15:32:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1331 states have (on average 1.6273478587528174) internal successors, (2166), 1363 states have internal predecessors, (2166), 223 states have call successors, (223), 89 states have call predecessors, (223), 92 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-02-05 15:32:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2672 transitions. [2025-02-05 15:32:37,320 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2672 transitions. Word has length 164 [2025-02-05 15:32:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:37,321 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2672 transitions. [2025-02-05 15:32:37,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:32:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2672 transitions. [2025-02-05 15:32:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 15:32:37,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:37,327 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:37,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 15:32:37,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 15:32:37,528 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:37,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:37,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1348882041, now seen corresponding path program 1 times [2025-02-05 15:32:37,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:37,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915695704] [2025-02-05 15:32:37,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:37,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:37,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 15:32:37,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 15:32:37,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:37,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-02-05 15:32:37,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:37,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915695704] [2025-02-05 15:32:37,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915695704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:37,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308583728] [2025-02-05 15:32:37,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:37,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:37,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:37,843 INFO L229 MonitoredProcess]: Starting monitored process 16 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:32:37,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 15:32:38,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 15:32:38,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 15:32:38,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:38,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:38,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:32:38,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:32:38,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:38,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308583728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:38,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:38,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-02-05 15:32:38,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537051410] [2025-02-05 15:32:38,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:38,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:38,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:38,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:38,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:32:38,165 INFO L87 Difference]: Start difference. First operand 1647 states and 2672 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:32:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:38,365 INFO L93 Difference]: Finished difference Result 3357 states and 5482 transitions. [2025-02-05 15:32:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:32:38,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 167 [2025-02-05 15:32:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:38,378 INFO L225 Difference]: With dead ends: 3357 [2025-02-05 15:32:38,378 INFO L226 Difference]: Without dead ends: 1755 [2025-02-05 15:32:38,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:32:38,389 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 138 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:38,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2266 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2025-02-05 15:32:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1725. [2025-02-05 15:32:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1407 states have (on average 1.6432125088841507) internal successors, (2312), 1439 states have internal predecessors, (2312), 223 states have call successors, (223), 91 states have call predecessors, (223), 94 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-02-05 15:32:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2818 transitions. [2025-02-05 15:32:38,472 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2818 transitions. Word has length 167 [2025-02-05 15:32:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:38,474 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 2818 transitions. [2025-02-05 15:32:38,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:32:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2818 transitions. [2025-02-05 15:32:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 15:32:38,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:38,478 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:38,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-05 15:32:38,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-05 15:32:38,679 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:38,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:38,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1187966769, now seen corresponding path program 1 times [2025-02-05 15:32:38,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:38,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798042831] [2025-02-05 15:32:38,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:38,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 15:32:38,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 15:32:38,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:38,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 15:32:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:38,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798042831] [2025-02-05 15:32:38,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798042831] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:38,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129631092] [2025-02-05 15:32:38,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:38,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:38,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:38,881 INFO L229 MonitoredProcess]: Starting monitored process 17 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:32:38,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-05 15:32:39,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 15:32:39,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 15:32:39,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:39,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:39,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:32:39,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-05 15:32:39,199 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:39,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129631092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:39,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:39,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-02-05 15:32:39,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63752462] [2025-02-05 15:32:39,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:39,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:32:39,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:39,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:32:39,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:32:39,201 INFO L87 Difference]: Start difference. First operand 1725 states and 2818 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:32:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:39,390 INFO L93 Difference]: Finished difference Result 3519 states and 5776 transitions. [2025-02-05 15:32:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:32:39,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 169 [2025-02-05 15:32:39,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:39,402 INFO L225 Difference]: With dead ends: 3519 [2025-02-05 15:32:39,402 INFO L226 Difference]: Without dead ends: 1839 [2025-02-05 15:32:39,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:32:39,408 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 136 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:39,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 2259 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-02-05 15:32:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1803. [2025-02-05 15:32:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1483 states have (on average 1.6574511126095752) internal successors, (2458), 1515 states have internal predecessors, (2458), 223 states have call successors, (223), 93 states have call predecessors, (223), 96 states have return successors, (283), 218 states have call predecessors, (283), 219 states have call successors, (283) [2025-02-05 15:32:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2964 transitions. [2025-02-05 15:32:39,472 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2964 transitions. Word has length 169 [2025-02-05 15:32:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:39,472 INFO L471 AbstractCegarLoop]: Abstraction has 1803 states and 2964 transitions. [2025-02-05 15:32:39,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:32:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2964 transitions. [2025-02-05 15:32:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 15:32:39,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:39,477 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:39,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-05 15:32:39,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:39,678 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:39,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:39,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1088294571, now seen corresponding path program 1 times [2025-02-05 15:32:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:39,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671725467] [2025-02-05 15:32:39,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:39,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:39,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 15:32:39,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 15:32:39,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:39,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-02-05 15:32:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671725467] [2025-02-05 15:32:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671725467] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936451210] [2025-02-05 15:32:39,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:39,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:39,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:39,833 INFO L229 MonitoredProcess]: Starting monitored process 18 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:32:39,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-05 15:32:39,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 15:32:40,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 15:32:40,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:40,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:40,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 15:32:40,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-05 15:32:40,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:32:40,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936451210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:40,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:32:40,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-02-05 15:32:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743011102] [2025-02-05 15:32:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:32:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:40,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:32:40,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:32:40,280 INFO L87 Difference]: Start difference. First operand 1803 states and 2964 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:32:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:42,537 INFO L93 Difference]: Finished difference Result 5608 states and 9367 transitions. [2025-02-05 15:32:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:32:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 169 [2025-02-05 15:32:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:42,564 INFO L225 Difference]: With dead ends: 5608 [2025-02-05 15:32:42,565 INFO L226 Difference]: Without dead ends: 3474 [2025-02-05 15:32:42,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:32:42,578 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 1857 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 3899 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 2419 SdHoareTripleChecker+Invalid, 4330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 3899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:42,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1960 Valid, 2419 Invalid, 4330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 3899 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 15:32:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2025-02-05 15:32:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3458. [2025-02-05 15:32:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 2801 states have (on average 1.6633345233845056) internal successors, (4659), 2889 states have internal predecessors, (4659), 463 states have call successors, (463), 167 states have call predecessors, (463), 193 states have return successors, (613), 459 states have call predecessors, (613), 459 states have call successors, (613) [2025-02-05 15:32:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 5735 transitions. [2025-02-05 15:32:42,751 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 5735 transitions. Word has length 169 [2025-02-05 15:32:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:42,752 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 5735 transitions. [2025-02-05 15:32:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (16), 4 states have call predecessors, (16), 6 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:32:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 5735 transitions. [2025-02-05 15:32:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 15:32:42,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:42,759 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:42,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-05 15:32:42,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:42,960 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:42,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash 598521385, now seen corresponding path program 1 times [2025-02-05 15:32:42,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:42,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933293592] [2025-02-05 15:32:42,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:42,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:42,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 15:32:42,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 15:32:42,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:42,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 15:32:43,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:43,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933293592] [2025-02-05 15:32:43,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933293592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:32:43,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:32:43,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:32:43,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779241166] [2025-02-05 15:32:43,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:32:43,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:32:43,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:43,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:32:43,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:32:43,062 INFO L87 Difference]: Start difference. First operand 3458 states and 5735 transitions. Second operand has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:32:43,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:32:43,220 INFO L93 Difference]: Finished difference Result 6742 states and 11210 transitions. [2025-02-05 15:32:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:32:43,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 172 [2025-02-05 15:32:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:32:43,240 INFO L225 Difference]: With dead ends: 6742 [2025-02-05 15:32:43,240 INFO L226 Difference]: Without dead ends: 3191 [2025-02-05 15:32:43,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:32:43,254 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 30 mSDsluCounter, 4788 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 5591 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:32:43,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 5591 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:32:43,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2025-02-05 15:32:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 3179. [2025-02-05 15:32:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 2622 states have (on average 1.683447749809306) internal successors, (4414), 2697 states have internal predecessors, (4414), 383 states have call successors, (383), 155 states have call predecessors, (383), 173 states have return successors, (483), 374 states have call predecessors, (483), 379 states have call successors, (483) [2025-02-05 15:32:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 5280 transitions. [2025-02-05 15:32:43,437 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 5280 transitions. Word has length 172 [2025-02-05 15:32:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:32:43,437 INFO L471 AbstractCegarLoop]: Abstraction has 3179 states and 5280 transitions. [2025-02-05 15:32:43,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:32:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 5280 transitions. [2025-02-05 15:32:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-05 15:32:43,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:32:43,453 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:43,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 15:32:43,454 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:32:43,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:32:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash 941423516, now seen corresponding path program 1 times [2025-02-05 15:32:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:32:43,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790380946] [2025-02-05 15:32:43,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:32:43,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 15:32:43,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 15:32:43,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:43,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 36 proven. 101 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2025-02-05 15:32:43,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:32:43,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790380946] [2025-02-05 15:32:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790380946] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:32:43,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254057383] [2025-02-05 15:32:43,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:32:43,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:32:43,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:32:43,942 INFO L229 MonitoredProcess]: Starting monitored process 19 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:32:43,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-05 15:32:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-05 15:32:44,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-05 15:32:44,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:32:44,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:32:44,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 3188 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 15:32:44,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:32:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 343 proven. 50 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2025-02-05 15:32:44,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:32:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 57 proven. 93 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-02-05 15:32:45,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254057383] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:32:45,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:32:45,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 14] total 27 [2025-02-05 15:32:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978443890] [2025-02-05 15:32:45,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:32:45,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 15:32:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:32:45,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 15:32:45,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-02-05 15:32:45,604 INFO L87 Difference]: Start difference. First operand 3179 states and 5280 transitions. Second operand has 27 states, 25 states have (on average 14.64) internal successors, (366), 23 states have internal predecessors, (366), 17 states have call successors, (89), 8 states have call predecessors, (89), 14 states have return successors, (90), 20 states have call predecessors, (90), 17 states have call successors, (90) [2025-02-05 15:33:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:33:23,942 INFO L93 Difference]: Finished difference Result 35153 states and 59969 transitions. [2025-02-05 15:33:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 352 states. [2025-02-05 15:33:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 14.64) internal successors, (366), 23 states have internal predecessors, (366), 17 states have call successors, (89), 8 states have call predecessors, (89), 14 states have return successors, (90), 20 states have call predecessors, (90), 17 states have call successors, (90) Word has length 460 [2025-02-05 15:33:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:33:24,299 INFO L225 Difference]: With dead ends: 35153 [2025-02-05 15:33:24,300 INFO L226 Difference]: Without dead ends: 31656 [2025-02-05 15:33:24,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1377 GetRequests, 1005 SyntacticMatches, 4 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61282 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10952, Invalid=125578, Unknown=0, NotChecked=0, Total=136530 [2025-02-05 15:33:24,384 INFO L435 NwaCegarLoop]: 2199 mSDtfsCounter, 38559 mSDsluCounter, 21123 mSDsCounter, 0 mSdLazyCounter, 70171 mSolverCounterSat, 13498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38559 SdHoareTripleChecker+Valid, 23322 SdHoareTripleChecker+Invalid, 83669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 13498 IncrementalHoareTripleChecker+Valid, 70171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.8s IncrementalHoareTripleChecker+Time [2025-02-05 15:33:24,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38559 Valid, 23322 Invalid, 83669 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [13498 Valid, 70171 Invalid, 0 Unknown, 0 Unchecked, 29.8s Time] [2025-02-05 15:33:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31656 states. [2025-02-05 15:33:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31656 to 26404. [2025-02-05 15:33:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26404 states, 21867 states have (on average 1.6594411670553804) internal successors, (36287), 22452 states have internal predecessors, (36287), 3011 states have call successors, (3011), 1396 states have call predecessors, (3011), 1525 states have return successors, (4204), 2975 states have call predecessors, (4204), 2993 states have call successors, (4204) [2025-02-05 15:33:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26404 states to 26404 states and 43502 transitions. [2025-02-05 15:33:26,321 INFO L78 Accepts]: Start accepts. Automaton has 26404 states and 43502 transitions. Word has length 460 [2025-02-05 15:33:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:33:26,321 INFO L471 AbstractCegarLoop]: Abstraction has 26404 states and 43502 transitions. [2025-02-05 15:33:26,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 14.64) internal successors, (366), 23 states have internal predecessors, (366), 17 states have call successors, (89), 8 states have call predecessors, (89), 14 states have return successors, (90), 20 states have call predecessors, (90), 17 states have call successors, (90) [2025-02-05 15:33:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 26404 states and 43502 transitions. [2025-02-05 15:33:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2025-02-05 15:33:26,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:33:26,407 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:26,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-05 15:33:26,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:33:26,609 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:33:26,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:33:26,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1931194647, now seen corresponding path program 1 times [2025-02-05 15:33:26,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:33:26,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710002974] [2025-02-05 15:33:26,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:33:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:33:26,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 523 statements into 1 equivalence classes. [2025-02-05 15:33:26,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 523 of 523 statements. [2025-02-05 15:33:26,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:33:26,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:33:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1268 backedges. 61 proven. 70 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2025-02-05 15:33:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:33:27,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710002974] [2025-02-05 15:33:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710002974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:33:27,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108202614] [2025-02-05 15:33:27,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:33:27,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:33:27,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:33:27,125 INFO L229 MonitoredProcess]: Starting monitored process 20 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:33:27,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process