./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product23.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_spec2_product23.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 3c1ff6fd56cd2377d464f2b10cb9a0da8b8728fdfad0102577329687d925f1d9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:35:59,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:35:59,450 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:35:59,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:35:59,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:35:59,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:35:59,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:35:59,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:35:59,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:35:59,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:35:59,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:35:59,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:35:59,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:35:59,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:35:59,475 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:35:59,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:35:59,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:35:59,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:35:59,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:35:59,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:35:59,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:35:59,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:35:59,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:35:59,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:35:59,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:35:59,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:35:59,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:35:59,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:35:59,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:35:59,477 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 -> 3c1ff6fd56cd2377d464f2b10cb9a0da8b8728fdfad0102577329687d925f1d9 [2025-02-05 15:35:59,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:35:59,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:35:59,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:35:59,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:35:59,719 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:35:59,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product23.cil.c [2025-02-05 15:36:00,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4bb5dfbd/9d5211867d7745939b1a2245ca06def6/FLAG180d0bf42 [2025-02-05 15:36:01,266 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:36:01,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product23.cil.c [2025-02-05 15:36:01,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4bb5dfbd/9d5211867d7745939b1a2245ca06def6/FLAG180d0bf42 [2025-02-05 15:36:01,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4bb5dfbd/9d5211867d7745939b1a2245ca06def6 [2025-02-05 15:36:01,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:36:01,491 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:36:01,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:36:01,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:36:01,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:36:01,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:01,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e72b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01, skipping insertion in model container [2025-02-05 15:36:01,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:01,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:36:01,746 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_spec2_product23.cil.c[35995,36008] [2025-02-05 15:36:01,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:36:01,828 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:36:01,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [48] [2025-02-05 15:36:01,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [235] [2025-02-05 15:36:01,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [273] [2025-02-05 15:36:01,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [941] [2025-02-05 15:36:01,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1307] [2025-02-05 15:36:01,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1665] [2025-02-05 15:36:01,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1674] [2025-02-05 15:36:01,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1766] [2025-02-05 15:36:01,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1778] [2025-02-05 15:36:01,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1898] [2025-02-05 15:36:01,911 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_spec2_product23.cil.c[35995,36008] [2025-02-05 15:36:01,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:36:01,979 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:36:01,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01 WrapperNode [2025-02-05 15:36:01,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:36:01,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:36:01,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:36:01,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:36:01,989 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:36:01" (1/1) ... [2025-02-05 15:36:02,012 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:36:01" (1/1) ... [2025-02-05 15:36:02,055 INFO L138 Inliner]: procedures = 96, calls = 347, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 918 [2025-02-05 15:36:02,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:36:02,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:36:02,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:36:02,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:36:02,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:02,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:02,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:02,095 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 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:36:02,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:02,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:02,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:02,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:02,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:02,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:02,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:36:02,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:36:02,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:36:02,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:36:02,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (1/1) ... [2025-02-05 15:36:02,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:36:02,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:02,182 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:36:02,185 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:36:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:36:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-02-05 15:36:02,201 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-02-05 15:36:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:36:02,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:36:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:36:02,202 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:36:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:36:02,202 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:36:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-02-05 15:36:02,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-02-05 15:36:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:36:02,202 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:36:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:36:02,203 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:36:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:36:02,203 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:36:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:36:02,203 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:36:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-02-05 15:36:02,204 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-02-05 15:36:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:36:02,205 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:36:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:36:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:36:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:36:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:36:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:36:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:36:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:36:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:36:02,206 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:36:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:36:02,207 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:36:02,207 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:36:02,207 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:36:02,207 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-02-05 15:36:02,207 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:36:02,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:36:02,207 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:36:02,207 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:36:02,358 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:36:02,360 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:36:02,428 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2825-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~25#1; [2025-02-05 15:36:02,428 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2853: #res#1 := ~retValue_acc~26#1; [2025-02-05 15:36:02,449 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895: #res := ~retValue_acc~12; [2025-02-05 15:36:02,470 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1817: #res := ~retValue_acc~10; [2025-02-05 15:36:02,473 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1972: #res := ~retValue_acc~13; [2025-02-05 15:36:02,482 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: #res := ~retValue_acc~14; [2025-02-05 15:36:02,529 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3481: #res := ~retValue_acc~30; [2025-02-05 15:36:02,705 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~24#1; [2025-02-05 15:36:02,705 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2706-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~22#1; [2025-02-05 15:36:02,705 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735: #res#1 := ~retValue_acc~23#1; [2025-02-05 15:36:02,769 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2898: #res := ~retValue_acc~28; [2025-02-05 15:36:02,779 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1856: #res := ~retValue_acc~11; [2025-02-05 15:36:02,796 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2172: #res := ~retValue_acc~16; [2025-02-05 15:36:02,882 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2301-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-02-05 15:36:02,882 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2314-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-02-05 15:36:02,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1; [2025-02-05 15:36:03,025 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: #res := ~retValue_acc~3; [2025-02-05 15:36:03,120 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2666: #res := ~retValue_acc~21; [2025-02-05 15:36:03,171 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1662-1: main_#res#1 := main_~retValue_acc~9#1; [2025-02-05 15:36:03,171 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L270-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:36:03,181 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L391: #res := ~retValue_acc~2; [2025-02-05 15:36:03,183 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2138: #res := ~retValue_acc~15; [2025-02-05 15:36:03,186 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L938: #res := ~retValue_acc~4; [2025-02-05 15:36:03,316 INFO L? ?]: Removed 471 outVars from TransFormulas that were not future-live. [2025-02-05 15:36:03,316 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:36:03,331 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:36:03,332 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:36:03,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:36:03 BoogieIcfgContainer [2025-02-05 15:36:03,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:36:03,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:36:03,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:36:03,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:36:03,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:36:01" (1/3) ... [2025-02-05 15:36:03,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ceeec76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:36:03, skipping insertion in model container [2025-02-05 15:36:03,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:01" (2/3) ... [2025-02-05 15:36:03,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ceeec76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:36:03, skipping insertion in model container [2025-02-05 15:36:03,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:36:03" (3/3) ... [2025-02-05 15:36:03,339 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product23.cil.c [2025-02-05 15:36:03,348 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:36:03,350 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product23.cil.c that has 27 procedures, 587 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:36:03,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:36:03,399 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;@ae2100c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:36:03,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:36:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 587 states, 456 states have (on average 1.6776315789473684) internal successors, (765), 478 states have internal predecessors, (765), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 15:36:03,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:36:03,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:03,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:36:03,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:03,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:03,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1268346573, now seen corresponding path program 1 times [2025-02-05 15:36:03,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:03,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828930791] [2025-02-05 15:36:03,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:03,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:03,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:36:03,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:36:03,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:03,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:03,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:03,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828930791] [2025-02-05 15:36:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828930791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:03,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:03,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405085527] [2025-02-05 15:36:03,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:03,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:03,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:03,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:03,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:03,895 INFO L87 Difference]: Start difference. First operand has 587 states, 456 states have (on average 1.6776315789473684) internal successors, (765), 478 states have internal predecessors, (765), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:03,991 INFO L93 Difference]: Finished difference Result 1154 states and 1912 transitions. [2025-02-05 15:36:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:04,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-02-05 15:36:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:04,016 INFO L225 Difference]: With dead ends: 1154 [2025-02-05 15:36:04,016 INFO L226 Difference]: Without dead ends: 578 [2025-02-05 15:36:04,023 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:36:04,025 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 5 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2843 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:04,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2843 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-05 15:36:04,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-02-05 15:36:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 450 states have (on average 1.6711111111111112) internal successors, (752), 469 states have internal predecessors, (752), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 951 transitions. [2025-02-05 15:36:04,079 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 951 transitions. Word has length 122 [2025-02-05 15:36:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:04,079 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 951 transitions. [2025-02-05 15:36:04,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 951 transitions. [2025-02-05 15:36:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:36:04,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:04,089 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:36:04,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:36:04,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:04,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash 676305876, now seen corresponding path program 1 times [2025-02-05 15:36:04,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:04,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011250998] [2025-02-05 15:36:04,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:04,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:36:04,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:36:04,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:04,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:04,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:04,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011250998] [2025-02-05 15:36:04,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011250998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:04,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:04,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:04,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451139694] [2025-02-05 15:36:04,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:04,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:04,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:04,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:04,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:04,349 INFO L87 Difference]: Start difference. First operand 578 states and 951 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:04,425 INFO L93 Difference]: Finished difference Result 1138 states and 1879 transitions. [2025-02-05 15:36:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:04,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-02-05 15:36:04,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:04,434 INFO L225 Difference]: With dead ends: 1138 [2025-02-05 15:36:04,434 INFO L226 Difference]: Without dead ends: 578 [2025-02-05 15:36:04,436 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:36:04,437 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 4 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:04,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2816 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-05 15:36:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-02-05 15:36:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 450 states have (on average 1.6688888888888889) internal successors, (751), 469 states have internal predecessors, (751), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 950 transitions. [2025-02-05 15:36:04,469 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 950 transitions. Word has length 123 [2025-02-05 15:36:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:04,469 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 950 transitions. [2025-02-05 15:36:04,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 950 transitions. [2025-02-05 15:36:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:36:04,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:04,476 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:36:04,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:36:04,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:04,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash -734806416, now seen corresponding path program 1 times [2025-02-05 15:36:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:04,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441817800] [2025-02-05 15:36:04,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:04,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:04,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:36:04,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:36:04,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441817800] [2025-02-05 15:36:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441817800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:04,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634044381] [2025-02-05 15:36:04,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:04,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:04,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:04,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:04,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:04,691 INFO L87 Difference]: Start difference. First operand 578 states and 950 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:04,754 INFO L93 Difference]: Finished difference Result 1138 states and 1878 transitions. [2025-02-05 15:36:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:04,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-02-05 15:36:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:04,759 INFO L225 Difference]: With dead ends: 1138 [2025-02-05 15:36:04,760 INFO L226 Difference]: Without dead ends: 578 [2025-02-05 15:36:04,762 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:36:04,763 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 3 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:04,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2816 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-05 15:36:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-02-05 15:36:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 450 states have (on average 1.6666666666666667) internal successors, (750), 469 states have internal predecessors, (750), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 949 transitions. [2025-02-05 15:36:04,790 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 949 transitions. Word has length 124 [2025-02-05 15:36:04,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:04,791 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 949 transitions. [2025-02-05 15:36:04,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 949 transitions. [2025-02-05 15:36:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:36:04,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:04,796 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:36:04,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:36:04,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:04,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1199556721, now seen corresponding path program 1 times [2025-02-05 15:36:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:04,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470848064] [2025-02-05 15:36:04,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:04,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:04,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:36:04,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:36:04,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:04,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:04,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:04,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470848064] [2025-02-05 15:36:04,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470848064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:04,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:04,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:04,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520972212] [2025-02-05 15:36:04,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:04,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:04,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:04,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:04,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:04,950 INFO L87 Difference]: Start difference. First operand 578 states and 949 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:04,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:04,996 INFO L93 Difference]: Finished difference Result 1138 states and 1877 transitions. [2025-02-05 15:36:04,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:04,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 125 [2025-02-05 15:36:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:05,000 INFO L225 Difference]: With dead ends: 1138 [2025-02-05 15:36:05,000 INFO L226 Difference]: Without dead ends: 578 [2025-02-05 15:36:05,002 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:36:05,004 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 2 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:05,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2816 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:05,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-05 15:36:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-02-05 15:36:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 450 states have (on average 1.6644444444444444) internal successors, (749), 469 states have internal predecessors, (749), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 948 transitions. [2025-02-05 15:36:05,029 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 948 transitions. Word has length 125 [2025-02-05 15:36:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:05,029 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 948 transitions. [2025-02-05 15:36:05,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 948 transitions. [2025-02-05 15:36:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:36:05,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:05,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:36:05,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:36:05,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:05,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:05,033 INFO L85 PathProgramCache]: Analyzing trace with hash -530524243, now seen corresponding path program 1 times [2025-02-05 15:36:05,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:05,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293008015] [2025-02-05 15:36:05,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:05,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:36:05,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:36:05,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:05,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:05,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:05,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293008015] [2025-02-05 15:36:05,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293008015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:05,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:05,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828305854] [2025-02-05 15:36:05,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:05,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:05,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:05,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:05,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:05,144 INFO L87 Difference]: Start difference. First operand 578 states and 948 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:05,179 INFO L93 Difference]: Finished difference Result 1138 states and 1876 transitions. [2025-02-05 15:36:05,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:05,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-02-05 15:36:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:05,184 INFO L225 Difference]: With dead ends: 1138 [2025-02-05 15:36:05,184 INFO L226 Difference]: Without dead ends: 578 [2025-02-05 15:36:05,208 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:36:05,210 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 1 mSDsluCounter, 1876 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2816 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:36:05,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2816 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-05 15:36:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-02-05 15:36:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 450 states have (on average 1.6622222222222223) internal successors, (748), 469 states have internal predecessors, (748), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 947 transitions. [2025-02-05 15:36:05,233 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 947 transitions. Word has length 126 [2025-02-05 15:36:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:05,233 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 947 transitions. [2025-02-05 15:36:05,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 947 transitions. [2025-02-05 15:36:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:36:05,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:05,236 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:36:05,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:36:05,236 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:05,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash 105744654, now seen corresponding path program 1 times [2025-02-05 15:36:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:05,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508865633] [2025-02-05 15:36:05,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:05,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:05,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:36:05,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:36:05,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:05,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:05,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:05,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508865633] [2025-02-05 15:36:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508865633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:36:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633862898] [2025-02-05 15:36:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:05,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:36:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:05,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:36:05,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:05,503 INFO L87 Difference]: Start difference. First operand 578 states and 947 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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:36:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:05,618 INFO L93 Difference]: Finished difference Result 1104 states and 1808 transitions. [2025-02-05 15:36:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:36:05,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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 127 [2025-02-05 15:36:05,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:05,622 INFO L225 Difference]: With dead ends: 1104 [2025-02-05 15:36:05,623 INFO L226 Difference]: Without dead ends: 593 [2025-02-05 15:36:05,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:05,626 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 91 mSDsluCounter, 6462 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7397 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:05,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7397 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-05 15:36:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2025-02-05 15:36:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 460 states have (on average 1.6586956521739131) internal successors, (763), 481 states have internal predecessors, (763), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2025-02-05 15:36:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 966 transitions. [2025-02-05 15:36:05,650 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 966 transitions. Word has length 127 [2025-02-05 15:36:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:05,651 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 966 transitions. [2025-02-05 15:36:05,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 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:36:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 966 transitions. [2025-02-05 15:36:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:36:05,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:05,656 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:36:05,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:36:05,656 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:05,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:05,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1187552941, now seen corresponding path program 1 times [2025-02-05 15:36:05,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:05,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070558385] [2025-02-05 15:36:05,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:05,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:05,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:36:05,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:36:05,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:05,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:05,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070558385] [2025-02-05 15:36:05,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070558385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:05,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:05,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:05,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377285054] [2025-02-05 15:36:05,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:05,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:05,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:05,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:05,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:05,755 INFO L87 Difference]: Start difference. First operand 591 states and 966 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:05,794 INFO L93 Difference]: Finished difference Result 1156 states and 1902 transitions. [2025-02-05 15:36:05,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2025-02-05 15:36:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:05,799 INFO L225 Difference]: With dead ends: 1156 [2025-02-05 15:36:05,799 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 15:36:05,801 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:36:05,802 INFO L435 NwaCegarLoop]: 941 mSDtfsCounter, 0 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:05,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2818 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 15:36:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-05 15:36:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 444 states have (on average 1.6531531531531531) internal successors, (734), 463 states have internal predecessors, (734), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 933 transitions. [2025-02-05 15:36:05,820 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 933 transitions. Word has length 127 [2025-02-05 15:36:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:05,821 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 933 transitions. [2025-02-05 15:36:05,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 933 transitions. [2025-02-05 15:36:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:36:05,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:05,826 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:36:05,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:36:05,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:05,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1741538321, now seen corresponding path program 1 times [2025-02-05 15:36:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441812753] [2025-02-05 15:36:05,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:05,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:36:05,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:36:05,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:05,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:05,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:05,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441812753] [2025-02-05 15:36:05,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441812753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:05,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:05,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:05,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934481251] [2025-02-05 15:36:05,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:05,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:05,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:05,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:05,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:05,994 INFO L87 Difference]: Start difference. First operand 572 states and 933 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:06,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:06,162 INFO L93 Difference]: Finished difference Result 1101 states and 1800 transitions. [2025-02-05 15:36:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:06,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2025-02-05 15:36:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:06,169 INFO L225 Difference]: With dead ends: 1101 [2025-02-05 15:36:06,169 INFO L226 Difference]: Without dead ends: 581 [2025-02-05 15:36:06,171 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:36:06,172 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 55 mSDsluCounter, 3531 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4421 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:06,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4421 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-02-05 15:36:06,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 572. [2025-02-05 15:36:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 444 states have (on average 1.6441441441441442) internal successors, (730), 463 states have internal predecessors, (730), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 929 transitions. [2025-02-05 15:36:06,191 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 929 transitions. Word has length 128 [2025-02-05 15:36:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:06,191 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 929 transitions. [2025-02-05 15:36:06,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 929 transitions. [2025-02-05 15:36:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:36:06,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:06,195 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:36:06,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:36:06,195 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:06,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:06,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1862746683, now seen corresponding path program 1 times [2025-02-05 15:36:06,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:06,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791965282] [2025-02-05 15:36:06,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:06,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:06,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:36:06,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:36:06,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:06,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:06,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:06,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791965282] [2025-02-05 15:36:06,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791965282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:06,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:06,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:06,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449300351] [2025-02-05 15:36:06,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:06,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:06,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:06,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:06,328 INFO L87 Difference]: Start difference. First operand 572 states and 929 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:06,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:06,487 INFO L93 Difference]: Finished difference Result 1101 states and 1796 transitions. [2025-02-05 15:36:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:06,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-02-05 15:36:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:06,491 INFO L225 Difference]: With dead ends: 1101 [2025-02-05 15:36:06,491 INFO L226 Difference]: Without dead ends: 581 [2025-02-05 15:36:06,493 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:36:06,494 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 54 mSDsluCounter, 3531 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4421 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:06,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4421 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-02-05 15:36:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 572. [2025-02-05 15:36:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 444 states have (on average 1.635135135135135) internal successors, (726), 463 states have internal predecessors, (726), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 925 transitions. [2025-02-05 15:36:06,510 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 925 transitions. Word has length 129 [2025-02-05 15:36:06,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:06,510 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 925 transitions. [2025-02-05 15:36:06,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 925 transitions. [2025-02-05 15:36:06,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:36:06,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:06,514 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:36:06,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:36:06,514 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:06,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2110027796, now seen corresponding path program 1 times [2025-02-05 15:36:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:06,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450019188] [2025-02-05 15:36:06,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:06,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:36:06,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:36:06,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:06,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:06,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:06,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450019188] [2025-02-05 15:36:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450019188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:06,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:06,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368760348] [2025-02-05 15:36:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:06,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:06,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:06,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:06,634 INFO L87 Difference]: Start difference. First operand 572 states and 925 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:06,762 INFO L93 Difference]: Finished difference Result 1101 states and 1792 transitions. [2025-02-05 15:36:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:06,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-02-05 15:36:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:06,766 INFO L225 Difference]: With dead ends: 1101 [2025-02-05 15:36:06,767 INFO L226 Difference]: Without dead ends: 581 [2025-02-05 15:36:06,769 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:36:06,769 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 53 mSDsluCounter, 3514 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4403 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:06,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4403 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:06,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-02-05 15:36:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 572. [2025-02-05 15:36:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 444 states have (on average 1.6261261261261262) internal successors, (722), 463 states have internal predecessors, (722), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 921 transitions. [2025-02-05 15:36:06,784 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 921 transitions. Word has length 130 [2025-02-05 15:36:06,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:06,784 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 921 transitions. [2025-02-05 15:36:06,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 921 transitions. [2025-02-05 15:36:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:36:06,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:06,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:36:06,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:36:06,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:06,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:06,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2133672957, now seen corresponding path program 1 times [2025-02-05 15:36:06,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:06,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441888586] [2025-02-05 15:36:06,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:06,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:06,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:36:06,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:36:06,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:06,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:06,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:06,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441888586] [2025-02-05 15:36:06,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441888586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:06,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:06,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:36:06,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841952985] [2025-02-05 15:36:06,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:06,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:36:06,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:06,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:36:06,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:06,927 INFO L87 Difference]: Start difference. First operand 572 states and 921 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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:36:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:06,984 INFO L93 Difference]: Finished difference Result 1092 states and 1774 transitions. [2025-02-05 15:36:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:06,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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 130 [2025-02-05 15:36:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:06,988 INFO L225 Difference]: With dead ends: 1092 [2025-02-05 15:36:06,988 INFO L226 Difference]: Without dead ends: 551 [2025-02-05 15:36:06,991 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:36:06,991 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 84 mSDsluCounter, 4477 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5387 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:06,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5387 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:06,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-02-05 15:36:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-02-05 15:36:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 423 states have (on average 1.6264775413711583) internal successors, (688), 442 states have internal predecessors, (688), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 887 transitions. [2025-02-05 15:36:07,009 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 887 transitions. Word has length 130 [2025-02-05 15:36:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:07,009 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 887 transitions. [2025-02-05 15:36:07,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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:36:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 887 transitions. [2025-02-05 15:36:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:36:07,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:07,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:36:07,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:36:07,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:07,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash 453477672, now seen corresponding path program 1 times [2025-02-05 15:36:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:07,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475368225] [2025-02-05 15:36:07,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:07,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:07,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:36:07,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:36:07,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:07,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:07,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:07,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475368225] [2025-02-05 15:36:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475368225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:07,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766510605] [2025-02-05 15:36:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:07,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:07,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:07,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:07,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:07,122 INFO L87 Difference]: Start difference. First operand 551 states and 887 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:07,184 INFO L93 Difference]: Finished difference Result 1071 states and 1740 transitions. [2025-02-05 15:36:07,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:07,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-02-05 15:36:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:07,189 INFO L225 Difference]: With dead ends: 1071 [2025-02-05 15:36:07,189 INFO L226 Difference]: Without dead ends: 551 [2025-02-05 15:36:07,191 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:36:07,192 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 17 mSDsluCounter, 3471 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4341 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:07,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4341 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-02-05 15:36:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-02-05 15:36:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 423 states have (on average 1.624113475177305) internal successors, (687), 442 states have internal predecessors, (687), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 886 transitions. [2025-02-05 15:36:07,209 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 886 transitions. Word has length 131 [2025-02-05 15:36:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:07,209 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 886 transitions. [2025-02-05 15:36:07,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 886 transitions. [2025-02-05 15:36:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:36:07,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:07,212 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:36:07,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:36:07,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:07,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 381523991, now seen corresponding path program 1 times [2025-02-05 15:36:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892759377] [2025-02-05 15:36:07,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:07,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:36:07,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:36:07,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:07,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:07,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:07,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892759377] [2025-02-05 15:36:07,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892759377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:07,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:07,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:07,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404507696] [2025-02-05 15:36:07,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:07,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:07,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:07,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:07,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:07,353 INFO L87 Difference]: Start difference. First operand 551 states and 886 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:07,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:07,411 INFO L93 Difference]: Finished difference Result 1071 states and 1739 transitions. [2025-02-05 15:36:07,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:07,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-02-05 15:36:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:07,415 INFO L225 Difference]: With dead ends: 1071 [2025-02-05 15:36:07,415 INFO L226 Difference]: Without dead ends: 551 [2025-02-05 15:36:07,417 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:36:07,417 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 16 mSDsluCounter, 3471 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4341 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:07,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4341 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-02-05 15:36:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-02-05 15:36:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 423 states have (on average 1.6217494089834514) internal successors, (686), 442 states have internal predecessors, (686), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 885 transitions. [2025-02-05 15:36:07,432 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 885 transitions. Word has length 132 [2025-02-05 15:36:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:07,432 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 885 transitions. [2025-02-05 15:36:07,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:36:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 885 transitions. [2025-02-05 15:36:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:36:07,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:07,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:36:07,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:36:07,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:07,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -2107547509, now seen corresponding path program 1 times [2025-02-05 15:36:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:07,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400443303] [2025-02-05 15:36:07,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:07,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:07,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:36:07,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:36:07,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:07,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:36:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:07,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400443303] [2025-02-05 15:36:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400443303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:07,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:07,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:36:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009359690] [2025-02-05 15:36:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:07,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:36:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:07,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:36:07,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:07,689 INFO L87 Difference]: Start difference. First operand 551 states and 885 transitions. Second operand has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:36:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:07,783 INFO L93 Difference]: Finished difference Result 1065 states and 1727 transitions. [2025-02-05 15:36:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:36:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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 133 [2025-02-05 15:36:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:07,788 INFO L225 Difference]: With dead ends: 1065 [2025-02-05 15:36:07,789 INFO L226 Difference]: Without dead ends: 551 [2025-02-05 15:36:07,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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:36:07,791 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 6 mSDsluCounter, 6930 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7799 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:07,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7799 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-02-05 15:36:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2025-02-05 15:36:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 423 states have (on average 1.6193853427895981) internal successors, (685), 442 states have internal predecessors, (685), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 15:36:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 884 transitions. [2025-02-05 15:36:07,811 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 884 transitions. Word has length 133 [2025-02-05 15:36:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:07,813 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 884 transitions. [2025-02-05 15:36:07,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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:36:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 884 transitions. [2025-02-05 15:36:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:36:07,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:07,817 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:36:07,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:36:07,817 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:07,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:07,817 INFO L85 PathProgramCache]: Analyzing trace with hash -495349686, now seen corresponding path program 1 times [2025-02-05 15:36:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788060970] [2025-02-05 15:36:07,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:07,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:36:07,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:36:07,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:07,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:36:07,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788060970] [2025-02-05 15:36:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788060970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157000666] [2025-02-05 15:36:07,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:07,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:07,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:07,972 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:36:07,974 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:36:08,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:36:08,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:36:08,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:08,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:08,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:36:08,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:36:08,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:08,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157000666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:08,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:08,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:36:08,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796623897] [2025-02-05 15:36:08,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:08,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:08,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:08,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:08,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:08,399 INFO L87 Difference]: Start difference. First operand 551 states and 884 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 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:36:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:08,866 INFO L93 Difference]: Finished difference Result 1065 states and 1752 transitions. [2025-02-05 15:36:08,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:08,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 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 134 [2025-02-05 15:36:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:08,871 INFO L225 Difference]: With dead ends: 1065 [2025-02-05 15:36:08,871 INFO L226 Difference]: Without dead ends: 559 [2025-02-05 15:36:08,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 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:36:08,874 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 844 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:08,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 2206 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:36:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-02-05 15:36:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-02-05 15:36:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 430 states have (on average 1.6209302325581396) internal successors, (697), 449 states have internal predecessors, (697), 102 states have call successors, (102), 27 states have call predecessors, (102), 26 states have return successors, (98), 95 states have call predecessors, (98), 97 states have call successors, (98) [2025-02-05 15:36:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 897 transitions. [2025-02-05 15:36:08,894 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 897 transitions. Word has length 134 [2025-02-05 15:36:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:08,895 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 897 transitions. [2025-02-05 15:36:08,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 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:36:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 897 transitions. [2025-02-05 15:36:08,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:36:08,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:08,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:36:08,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:36:09,099 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:36:09,099 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:09,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1706073604, now seen corresponding path program 1 times [2025-02-05 15:36:09,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:09,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866156234] [2025-02-05 15:36:09,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:09,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:09,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:36:09,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:36:09,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:09,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:36:09,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866156234] [2025-02-05 15:36:09,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866156234] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:09,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031257299] [2025-02-05 15:36:09,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:09,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:09,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:09,255 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:36:09,256 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:36:09,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:36:09,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:36:09,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:09,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:09,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:36:09,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:36:09,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:09,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031257299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:09,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:09,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:36:09,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085706034] [2025-02-05 15:36:09,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:09,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:09,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:09,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:09,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:09,700 INFO L87 Difference]: Start difference. First operand 559 states and 897 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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:36:10,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:10,182 INFO L93 Difference]: Finished difference Result 1081 states and 1775 transitions. [2025-02-05 15:36:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:10,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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 136 [2025-02-05 15:36:10,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:10,186 INFO L225 Difference]: With dead ends: 1081 [2025-02-05 15:36:10,186 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:36:10,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 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:36:10,189 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 831 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:10,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 2203 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:36:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:36:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-02-05 15:36:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 437 states have (on average 1.6224256292906178) internal successors, (709), 456 states have internal predecessors, (709), 102 states have call successors, (102), 28 states have call predecessors, (102), 27 states have return successors, (99), 95 states have call predecessors, (99), 97 states have call successors, (99) [2025-02-05 15:36:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 910 transitions. [2025-02-05 15:36:10,207 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 910 transitions. Word has length 136 [2025-02-05 15:36:10,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:10,207 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 910 transitions. [2025-02-05 15:36:10,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 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:36:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 910 transitions. [2025-02-05 15:36:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:36:10,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:10,210 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:36:10,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:36:10,411 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:36:10,411 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:10,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:10,411 INFO L85 PathProgramCache]: Analyzing trace with hash 946354410, now seen corresponding path program 1 times [2025-02-05 15:36:10,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:10,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64514479] [2025-02-05 15:36:10,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:10,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:10,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:36:10,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:36:10,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:10,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:36:10,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:10,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64514479] [2025-02-05 15:36:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64514479] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:10,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988697791] [2025-02-05 15:36:10,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:10,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:10,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:10,509 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:36:10,511 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:36:10,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:36:10,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:36:10,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:10,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:10,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:36:10,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:36:10,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:10,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988697791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:10,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:10,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:36:10,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984753428] [2025-02-05 15:36:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:10,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:10,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:10,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:10,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:10,856 INFO L87 Difference]: Start difference. First operand 567 states and 910 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:36:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:11,260 INFO L93 Difference]: Finished difference Result 1097 states and 1798 transitions. [2025-02-05 15:36:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:11,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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 138 [2025-02-05 15:36:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:11,265 INFO L225 Difference]: With dead ends: 1097 [2025-02-05 15:36:11,265 INFO L226 Difference]: Without dead ends: 575 [2025-02-05 15:36:11,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 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:36:11,267 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 835 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:11,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 2200 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:36:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-02-05 15:36:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2025-02-05 15:36:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 444 states have (on average 1.6238738738738738) internal successors, (721), 463 states have internal predecessors, (721), 102 states have call successors, (102), 29 states have call predecessors, (102), 28 states have return successors, (100), 95 states have call predecessors, (100), 97 states have call successors, (100) [2025-02-05 15:36:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 923 transitions. [2025-02-05 15:36:11,287 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 923 transitions. Word has length 138 [2025-02-05 15:36:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:11,288 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 923 transitions. [2025-02-05 15:36:11,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 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:36:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 923 transitions. [2025-02-05 15:36:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:36:11,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:11,292 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:36:11,302 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:36:11,496 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:36:11,496 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:11,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:11,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2128958014, now seen corresponding path program 1 times [2025-02-05 15:36:11,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:11,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930992344] [2025-02-05 15:36:11,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:11,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:11,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:36:11,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:36:11,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:11,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:36:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930992344] [2025-02-05 15:36:11,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930992344] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:11,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619541630] [2025-02-05 15:36:11,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:11,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:11,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:11,609 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:36:11,611 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:36:11,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:36:11,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:36:11,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:11,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:11,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:36:11,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:36:11,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:11,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619541630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:11,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 15:36:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373722965] [2025-02-05 15:36:11,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:11,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:11,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:11,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:11,991 INFO L87 Difference]: Start difference. First operand 575 states and 923 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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:36:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:12,390 INFO L93 Difference]: Finished difference Result 1113 states and 1821 transitions. [2025-02-05 15:36:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:12,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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 140 [2025-02-05 15:36:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:12,394 INFO L225 Difference]: With dead ends: 1113 [2025-02-05 15:36:12,396 INFO L226 Difference]: Without dead ends: 583 [2025-02-05 15:36:12,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 138 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:36:12,399 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 829 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:12,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 2197 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:36:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-02-05 15:36:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2025-02-05 15:36:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 451 states have (on average 1.6252771618625277) internal successors, (733), 470 states have internal predecessors, (733), 102 states have call successors, (102), 30 states have call predecessors, (102), 29 states have return successors, (101), 95 states have call predecessors, (101), 97 states have call successors, (101) [2025-02-05 15:36:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 936 transitions. [2025-02-05 15:36:12,417 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 936 transitions. Word has length 140 [2025-02-05 15:36:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:12,417 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 936 transitions. [2025-02-05 15:36:12,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 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:36:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 936 transitions. [2025-02-05 15:36:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:36:12,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:12,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:36:12,430 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:36:12,671 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:36:12,672 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:12,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash 655438794, now seen corresponding path program 1 times [2025-02-05 15:36:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486211239] [2025-02-05 15:36:12,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:12,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:12,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:36:12,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:36:12,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:12,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:36:12,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:12,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486211239] [2025-02-05 15:36:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486211239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:12,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108820123] [2025-02-05 15:36:12,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:12,824 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:36:12,829 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:36:12,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:36:13,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:36:13,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:13,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:13,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 1498 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 15:36:13,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:36:13,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108820123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:13,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:13,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-05 15:36:13,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506969842] [2025-02-05 15:36:13,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:13,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:13,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:13,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:13,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:36:13,146 INFO L87 Difference]: Start difference. First operand 583 states and 936 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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:36:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:13,507 INFO L93 Difference]: Finished difference Result 1123 states and 1848 transitions. [2025-02-05 15:36:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:13,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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 142 [2025-02-05 15:36:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:13,511 INFO L225 Difference]: With dead ends: 1123 [2025-02-05 15:36:13,511 INFO L226 Difference]: Without dead ends: 585 [2025-02-05 15:36:13,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 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:36:13,514 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 809 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:13,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2197 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:36:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-02-05 15:36:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2025-02-05 15:36:13,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 452 states have (on average 1.6150442477876106) internal successors, (730), 472 states have internal predecessors, (730), 102 states have call successors, (102), 30 states have call predecessors, (102), 30 states have return successors, (102), 95 states have call predecessors, (102), 97 states have call successors, (102) [2025-02-05 15:36:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 934 transitions. [2025-02-05 15:36:13,533 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 934 transitions. Word has length 142 [2025-02-05 15:36:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:13,534 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 934 transitions. [2025-02-05 15:36:13,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 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:36:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 934 transitions. [2025-02-05 15:36:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:36:13,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:13,537 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:36:13,548 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:36:13,737 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:36:13,738 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:13,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1949571062, now seen corresponding path program 1 times [2025-02-05 15:36:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:13,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311011283] [2025-02-05 15:36:13,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:13,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:13,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:36:13,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:36:13,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:13,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:36:13,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:13,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311011283] [2025-02-05 15:36:13,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311011283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:13,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502055383] [2025-02-05 15:36:13,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:13,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:13,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:13,949 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:36:13,951 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:36:14,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:36:14,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:36:14,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:14,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:14,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 1500 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 15:36:14,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:14,309 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:36:14,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502055383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:14,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:14,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2025-02-05 15:36:14,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917816902] [2025-02-05 15:36:14,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:14,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:36:14,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:14,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:36:14,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:36:14,312 INFO L87 Difference]: Start difference. First operand 585 states and 934 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:36:16,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:16,468 INFO L93 Difference]: Finished difference Result 1848 states and 3017 transitions. [2025-02-05 15:36:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:36:16,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 142 [2025-02-05 15:36:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:16,476 INFO L225 Difference]: With dead ends: 1848 [2025-02-05 15:36:16,476 INFO L226 Difference]: Without dead ends: 1308 [2025-02-05 15:36:16,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:36:16,480 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 2168 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 3498 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2258 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 4001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 3498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:16,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2258 Valid, 2019 Invalid, 4001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 3498 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 15:36:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-02-05 15:36:16,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1220. [2025-02-05 15:36:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1220 states, 942 states have (on average 1.6263269639065818) internal successors, (1532), 981 states have internal predecessors, (1532), 212 states have call successors, (212), 58 states have call predecessors, (212), 65 states have return successors, (240), 205 states have call predecessors, (240), 207 states have call successors, (240) [2025-02-05 15:36:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1984 transitions. [2025-02-05 15:36:16,541 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1984 transitions. Word has length 142 [2025-02-05 15:36:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:16,542 INFO L471 AbstractCegarLoop]: Abstraction has 1220 states and 1984 transitions. [2025-02-05 15:36:16,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 5 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:36:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1984 transitions. [2025-02-05 15:36:16,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:36:16,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:16,545 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:36:16,556 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:36:16,750 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:36:16,750 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:16,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1955575654, now seen corresponding path program 1 times [2025-02-05 15:36:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925846010] [2025-02-05 15:36:16,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:16,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:36:16,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:36:16,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:16,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:36:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:17,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925846010] [2025-02-05 15:36:17,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925846010] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:17,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833725187] [2025-02-05 15:36:17,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:17,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:17,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:17,013 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:36:17,014 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:36:17,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:36:17,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:36:17,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:17,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:17,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:36:17,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:36:17,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:17,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833725187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:17,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:17,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-02-05 15:36:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782596183] [2025-02-05 15:36:17,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:17,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:36:17,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:17,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:36:17,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:36:17,259 INFO L87 Difference]: Start difference. First operand 1220 states and 1984 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:36:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:17,324 INFO L93 Difference]: Finished difference Result 2956 states and 4860 transitions. [2025-02-05 15:36:17,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:36:17,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-02-05 15:36:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:17,335 INFO L225 Difference]: With dead ends: 2956 [2025-02-05 15:36:17,335 INFO L226 Difference]: Without dead ends: 1782 [2025-02-05 15:36:17,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:36:17,340 INFO L435 NwaCegarLoop]: 1580 mSDtfsCounter, 824 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 2454 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:36:17,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 2454 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-02-05 15:36:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1218. [2025-02-05 15:36:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 941 states have (on average 1.6259298618490967) internal successors, (1530), 979 states have internal predecessors, (1530), 212 states have call successors, (212), 58 states have call predecessors, (212), 64 states have return successors, (234), 205 states have call predecessors, (234), 207 states have call successors, (234) [2025-02-05 15:36:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1976 transitions. [2025-02-05 15:36:17,394 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1976 transitions. Word has length 147 [2025-02-05 15:36:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:17,394 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1976 transitions. [2025-02-05 15:36:17,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:36:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1976 transitions. [2025-02-05 15:36:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:36:17,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:17,397 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:36:17,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 15:36:17,598 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:36:17,598 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:17,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:17,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1506879015, now seen corresponding path program 1 times [2025-02-05 15:36:17,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:17,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618614088] [2025-02-05 15:36:17,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:17,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:36:17,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:36:17,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:17,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:36:17,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:17,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618614088] [2025-02-05 15:36:17,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618614088] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:17,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466721948] [2025-02-05 15:36:17,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:17,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:17,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:17,809 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:36:17,815 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:36:17,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:36:18,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:36:18,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:18,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:18,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:36:18,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:18,123 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:36:18,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:18,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466721948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:18,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:18,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:36:18,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253999127] [2025-02-05 15:36:18,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:18,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:18,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:18,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:36:18,125 INFO L87 Difference]: Start difference. First operand 1218 states and 1976 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:19,513 INFO L93 Difference]: Finished difference Result 3831 states and 6340 transitions. [2025-02-05 15:36:19,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:19,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 147 [2025-02-05 15:36:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:19,527 INFO L225 Difference]: With dead ends: 3831 [2025-02-05 15:36:19,527 INFO L226 Difference]: Without dead ends: 2658 [2025-02-05 15:36:19,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:36:19,535 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 1949 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2033 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:19,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2033 Valid, 912 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 15:36:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2025-02-05 15:36:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2569. [2025-02-05 15:36:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 1957 states have (on average 1.6290240163515586) internal successors, (3188), 2044 states have internal predecessors, (3188), 479 states have call successors, (479), 111 states have call predecessors, (479), 132 states have return successors, (580), 473 states have call predecessors, (580), 474 states have call successors, (580) [2025-02-05 15:36:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 4247 transitions. [2025-02-05 15:36:19,640 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 4247 transitions. Word has length 147 [2025-02-05 15:36:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:19,641 INFO L471 AbstractCegarLoop]: Abstraction has 2569 states and 4247 transitions. [2025-02-05 15:36:19,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 4247 transitions. [2025-02-05 15:36:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:36:19,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:19,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:36:19,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 15:36:19,849 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:36:19,849 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:19,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:19,850 INFO L85 PathProgramCache]: Analyzing trace with hash -531583584, now seen corresponding path program 1 times [2025-02-05 15:36:19,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:19,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124357587] [2025-02-05 15:36:19,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:19,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:19,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:36:19,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:36:19,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:19,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:36:20,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:20,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124357587] [2025-02-05 15:36:20,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124357587] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:20,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292558447] [2025-02-05 15:36:20,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:20,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:20,091 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:36:20,095 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:36:20,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:36:20,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:36:20,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:20,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:20,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 1518 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:36:20,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:20,410 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:36:20,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:20,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292558447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:20,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:20,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:36:20,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761795592] [2025-02-05 15:36:20,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:20,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:20,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:20,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:20,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:36:20,411 INFO L87 Difference]: Start difference. First operand 2569 states and 4247 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:21,964 INFO L93 Difference]: Finished difference Result 8349 states and 14151 transitions. [2025-02-05 15:36:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:21,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2025-02-05 15:36:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:21,995 INFO L225 Difference]: With dead ends: 8349 [2025-02-05 15:36:21,995 INFO L226 Difference]: Without dead ends: 5825 [2025-02-05 15:36:22,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:36:22,008 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1956 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:22,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 872 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 15:36:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5825 states. [2025-02-05 15:36:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5825 to 5604. [2025-02-05 15:36:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5604 states, 4194 states have (on average 1.6251788268955651) internal successors, (6816), 4403 states have internal predecessors, (6816), 1131 states have call successors, (1131), 217 states have call predecessors, (1131), 278 states have return successors, (1530), 1131 states have call predecessors, (1530), 1126 states have call successors, (1530) [2025-02-05 15:36:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5604 states to 5604 states and 9477 transitions. [2025-02-05 15:36:22,300 INFO L78 Accepts]: Start accepts. Automaton has 5604 states and 9477 transitions. Word has length 148 [2025-02-05 15:36:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:22,300 INFO L471 AbstractCegarLoop]: Abstraction has 5604 states and 9477 transitions. [2025-02-05 15:36:22,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5604 states and 9477 transitions. [2025-02-05 15:36:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:36:22,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:22,305 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:36:22,315 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:36:22,505 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:36:22,506 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:22,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:22,507 INFO L85 PathProgramCache]: Analyzing trace with hash 700581505, now seen corresponding path program 1 times [2025-02-05 15:36:22,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:22,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619844122] [2025-02-05 15:36:22,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:22,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:22,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:36:22,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:36:22,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:22,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:36:22,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:22,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619844122] [2025-02-05 15:36:22,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619844122] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:22,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579718671] [2025-02-05 15:36:22,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:22,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:22,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:22,748 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:36:22,753 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:36:22,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:36:22,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:36:22,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:22,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:22,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:36:23,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:23,087 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:36:23,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:23,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579718671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:23,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:23,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:36:23,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810325291] [2025-02-05 15:36:23,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:23,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:23,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:23,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:36:23,089 INFO L87 Difference]: Start difference. First operand 5604 states and 9477 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:24,873 INFO L93 Difference]: Finished difference Result 18664 states and 32797 transitions. [2025-02-05 15:36:24,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:24,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 149 [2025-02-05 15:36:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,973 INFO L225 Difference]: With dead ends: 18664 [2025-02-05 15:36:24,974 INFO L226 Difference]: Without dead ends: 13105 [2025-02-05 15:36:25,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:36:25,008 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 1941 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:25,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 869 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 15:36:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2025-02-05 15:36:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 12544. [2025-02-05 15:36:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12544 states, 9195 states have (on average 1.6166394779771616) internal successors, (14865), 9709 states have internal predecessors, (14865), 2755 states have call successors, (2755), 429 states have call predecessors, (2755), 593 states have return successors, (4247), 2779 states have call predecessors, (4247), 2750 states have call successors, (4247) [2025-02-05 15:36:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12544 states to 12544 states and 21867 transitions. [2025-02-05 15:36:25,944 INFO L78 Accepts]: Start accepts. Automaton has 12544 states and 21867 transitions. Word has length 149 [2025-02-05 15:36:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:25,944 INFO L471 AbstractCegarLoop]: Abstraction has 12544 states and 21867 transitions. [2025-02-05 15:36:25,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 12544 states and 21867 transitions. [2025-02-05 15:36:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:36:25,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:25,949 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:36:25,958 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:36:26,149 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:36:26,149 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:26,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:26,150 INFO L85 PathProgramCache]: Analyzing trace with hash 242989818, now seen corresponding path program 1 times [2025-02-05 15:36:26,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:26,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391014937] [2025-02-05 15:36:26,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:26,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:36:26,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:36:26,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:26,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:36:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:26,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391014937] [2025-02-05 15:36:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391014937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:26,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125729835] [2025-02-05 15:36:26,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:26,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:26,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:26,345 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:36:26,357 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:36:26,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:36:26,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:36:26,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:26,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:26,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 1522 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:36:26,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:26,690 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:36:26,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125729835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:26,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:36:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452189077] [2025-02-05 15:36:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:26,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:26,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:26,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:26,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:36:26,692 INFO L87 Difference]: Start difference. First operand 12544 states and 21867 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:29,457 INFO L93 Difference]: Finished difference Result 42519 states and 78855 transitions. [2025-02-05 15:36:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 150 [2025-02-05 15:36:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:29,681 INFO L225 Difference]: With dead ends: 42519 [2025-02-05 15:36:29,681 INFO L226 Difference]: Without dead ends: 30020 [2025-02-05 15:36:29,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:36:29,761 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 1929 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:29,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 863 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 15:36:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30020 states. [2025-02-05 15:36:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30020 to 28812. [2025-02-05 15:36:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28812 states, 20644 states have (on average 1.6049215268358845) internal successors, (33132), 21927 states have internal predecessors, (33132), 6887 states have call successors, (6887), 853 states have call predecessors, (6887), 1280 states have return successors, (12384), 6995 states have call predecessors, (12384), 6882 states have call successors, (12384) [2025-02-05 15:36:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28812 states to 28812 states and 52403 transitions. [2025-02-05 15:36:31,614 INFO L78 Accepts]: Start accepts. Automaton has 28812 states and 52403 transitions. Word has length 150 [2025-02-05 15:36:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:31,616 INFO L471 AbstractCegarLoop]: Abstraction has 28812 states and 52403 transitions. [2025-02-05 15:36:31,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:31,617 INFO L276 IsEmpty]: Start isEmpty. Operand 28812 states and 52403 transitions. [2025-02-05 15:36:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:36:31,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:31,620 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-05 15:36:31,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 15:36:31,821 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:36:31,821 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:31,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:31,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1057454373, now seen corresponding path program 1 times [2025-02-05 15:36:31,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:31,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108805146] [2025-02-05 15:36:31,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:31,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:36:31,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:36:31,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:31,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:36:32,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:32,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108805146] [2025-02-05 15:36:32,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108805146] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:32,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408508146] [2025-02-05 15:36:32,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:32,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:32,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:32,013 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:36:32,014 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:36:32,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:36:32,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:36:32,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:32,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:32,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1524 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:36:32,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:32,349 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:36:32,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:32,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408508146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:32,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:32,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:36:32,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477562697] [2025-02-05 15:36:32,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:32,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:32,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:32,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:36:32,350 INFO L87 Difference]: Start difference. First operand 28812 states and 52403 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:38,147 INFO L93 Difference]: Finished difference Result 98871 states and 199016 transitions. [2025-02-05 15:36:38,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 151 [2025-02-05 15:36:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:38,671 INFO L225 Difference]: With dead ends: 98871 [2025-02-05 15:36:38,671 INFO L226 Difference]: Without dead ends: 70094 [2025-02-05 15:36:38,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:36:38,840 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 1904 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:38,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1984 Valid, 959 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 15:36:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70094 states. [2025-02-05 15:36:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70094 to 67924. [2025-02-05 15:36:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67924 states, 47531 states have (on average 1.5912772716753276) internal successors, (75635), 50771 states have internal predecessors, (75635), 17593 states have call successors, (17593), 1698 states have call predecessors, (17593), 2799 states have return successors, (37934), 17976 states have call predecessors, (37934), 17588 states have call successors, (37934) [2025-02-05 15:36:44,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67924 states to 67924 states and 131162 transitions. [2025-02-05 15:36:44,052 INFO L78 Accepts]: Start accepts. Automaton has 67924 states and 131162 transitions. Word has length 151 [2025-02-05 15:36:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:44,053 INFO L471 AbstractCegarLoop]: Abstraction has 67924 states and 131162 transitions. [2025-02-05 15:36:44,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:36:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 67924 states and 131162 transitions. [2025-02-05 15:36:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 15:36:44,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:44,080 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:44,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-05 15:36:44,282 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:36:44,283 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:44,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:44,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2105916063, now seen corresponding path program 1 times [2025-02-05 15:36:44,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:44,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319645889] [2025-02-05 15:36:44,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:44,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:44,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 15:36:44,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 15:36:44,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:44,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 15:36:44,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:44,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319645889] [2025-02-05 15:36:44,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319645889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:44,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11891785] [2025-02-05 15:36:44,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:44,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:44,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:44,734 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:36:44,739 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:36:44,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 15:36:44,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 15:36:44,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:45,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:45,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:36:45,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:36:45,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:45,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11891785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:45,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:45,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:36:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489342161] [2025-02-05 15:36:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:45,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:45,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:45,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:45,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:36:45,032 INFO L87 Difference]: Start difference. First operand 67924 states and 131162 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:36:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:49,423 INFO L93 Difference]: Finished difference Result 138682 states and 278640 transitions. [2025-02-05 15:36:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:49,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 206 [2025-02-05 15:36:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:50,172 INFO L225 Difference]: With dead ends: 138682 [2025-02-05 15:36:50,172 INFO L226 Difference]: Without dead ends: 70804 [2025-02-05 15:36:50,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:36:50,721 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 144 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2446 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:36:50,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2446 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70804 states. [2025-02-05 15:36:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70804 to 70420. [2025-02-05 15:36:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70420 states, 49963 states have (on average 1.6073294237735924) internal successors, (80307), 53203 states have internal predecessors, (80307), 17593 states have call successors, (17593), 1762 states have call predecessors, (17593), 2863 states have return successors, (37934), 17976 states have call predecessors, (37934), 17588 states have call successors, (37934) [2025-02-05 15:36:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70420 states to 70420 states and 135834 transitions. [2025-02-05 15:36:55,260 INFO L78 Accepts]: Start accepts. Automaton has 70420 states and 135834 transitions. Word has length 206 [2025-02-05 15:36:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:55,260 INFO L471 AbstractCegarLoop]: Abstraction has 70420 states and 135834 transitions. [2025-02-05 15:36:55,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:36:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 70420 states and 135834 transitions. [2025-02-05 15:36:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-02-05 15:36:55,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:55,275 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:55,286 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:36:55,475 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:36:55,476 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:55,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:55,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1435888384, now seen corresponding path program 1 times [2025-02-05 15:36:55,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:55,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672202808] [2025-02-05 15:36:55,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:55,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-05 15:36:55,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-05 15:36:55,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:55,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 15:36:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672202808] [2025-02-05 15:36:56,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672202808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:56,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601549057] [2025-02-05 15:36:56,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:56,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:56,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:56,033 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:36:56,036 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:36:56,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-05 15:36:56,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-05 15:36:56,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:56,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:56,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 1942 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:36:56,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:36:56,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:56,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601549057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:56,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:56,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-05 15:36:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489589335] [2025-02-05 15:36:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:56,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:56,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:56,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:56,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:36:56,494 INFO L87 Difference]: Start difference. First operand 70420 states and 135834 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)