./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product32.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_spec3_product32.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 d14be9b096a9cbd7bae6b76d9713e8ec6e66d6633cec6a9d1cec5445761f8a9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:38:13,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:38:13,502 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:38:13,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:38:13,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:38:13,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:38:13,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:38:13,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:38:13,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:38:13,532 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:38:13,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:38:13,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:38:13,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:38:13,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:38:13,532 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:38:13,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:38:13,533 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:38:13,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:38:13,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:38:13,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:38:13,534 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:38:13,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:38:13,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:38:13,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:38:13,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:38:13,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:38:13,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:38:13,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:38:13,534 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 -> d14be9b096a9cbd7bae6b76d9713e8ec6e66d6633cec6a9d1cec5445761f8a9c [2025-02-05 15:38:13,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:38:13,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:38:13,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:38:13,748 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:38:13,748 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:38:13,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product32.cil.c [2025-02-05 15:38:14,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d68e1a4b4/a214cd1af8d04c0e8455748b3e6fcbd7/FLAG14724dc63 [2025-02-05 15:38:15,226 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:38:15,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product32.cil.c [2025-02-05 15:38:15,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d68e1a4b4/a214cd1af8d04c0e8455748b3e6fcbd7/FLAG14724dc63 [2025-02-05 15:38:15,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d68e1a4b4/a214cd1af8d04c0e8455748b3e6fcbd7 [2025-02-05 15:38:15,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:38:15,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:38:15,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:38:15,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:38:15,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:38:15,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:38:15" (1/1) ... [2025-02-05 15:38:15,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@afa4efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:15, skipping insertion in model container [2025-02-05 15:38:15,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:38:15" (1/1) ... [2025-02-05 15:38:15,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:38:15,686 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_spec3_product32.cil.c[3233,3246] [2025-02-05 15:38:15,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:38:15,939 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:38:15,947 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-02-05 15:38:15,948 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [151] [2025-02-05 15:38:15,948 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [160] [2025-02-05 15:38:15,948 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [198] [2025-02-05 15:38:15,949 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [564] [2025-02-05 15:38:15,949 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [753] [2025-02-05 15:38:15,949 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [873] [2025-02-05 15:38:15,949 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1540] [2025-02-05 15:38:15,949 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1558] [2025-02-05 15:38:15,949 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1907] [2025-02-05 15:38:15,956 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_spec3_product32.cil.c[3233,3246] [2025-02-05 15:38:16,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:38:16,063 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:38:16,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16 WrapperNode [2025-02-05 15:38:16,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:38:16,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:38:16,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:38:16,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:38:16,070 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:38:16" (1/1) ... [2025-02-05 15:38:16,086 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:38:16" (1/1) ... [2025-02-05 15:38:16,116 INFO L138 Inliner]: procedures = 97, calls = 361, calls flagged for inlining = 29, calls inlined = 25, statements flattened = 1006 [2025-02-05 15:38:16,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:38:16,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:38:16,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:38:16,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:38:16,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (1/1) ... [2025-02-05 15:38:16,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (1/1) ... [2025-02-05 15:38:16,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (1/1) ... [2025-02-05 15:38:16,169 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:38:16,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (1/1) ... [2025-02-05 15:38:16,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (1/1) ... [2025-02-05 15:38:16,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (1/1) ... [2025-02-05 15:38:16,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (1/1) ... [2025-02-05 15:38:16,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (1/1) ... [2025-02-05 15:38:16,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (1/1) ... [2025-02-05 15:38:16,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:38:16,205 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:38:16,205 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:38:16,205 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:38:16,206 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (1/1) ... [2025-02-05 15:38:16,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:38:16,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:16,238 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:38:16,241 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:38:16,256 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-02-05 15:38:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-02-05 15:38:16,256 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:38:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:38:16,256 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:38:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:38:16,256 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-02-05 15:38:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-02-05 15:38:16,256 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:38:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:38:16,256 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:38:16,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:38:16,257 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-02-05 15:38:16,257 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:38:16,258 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-02-05 15:38:16,258 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:38:16,258 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:38:16,258 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:38:16,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:38:16,258 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:38:16,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:38:16,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:38:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:38:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:38:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:38:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:38:16,263 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:38:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:38:16,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:38:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:38:16,263 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:38:16,263 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-02-05 15:38:16,263 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-02-05 15:38:16,415 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:38:16,418 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:38:16,504 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2850-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~25#1; [2025-02-05 15:38:16,505 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2878: #res#1 := ~retValue_acc~26#1; [2025-02-05 15:38:16,509 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: #res := ~retValue_acc~17; [2025-02-05 15:38:16,530 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L792: #res := ~retValue_acc~5; [2025-02-05 15:38:16,563 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3554: #res := ~retValue_acc~30; [2025-02-05 15:38:16,624 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2794-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~24#1; [2025-02-05 15:38:16,624 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~22#1; [2025-02-05 15:38:16,624 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2760: #res#1 := ~retValue_acc~23#1; [2025-02-05 15:38:16,637 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2923: #res := ~retValue_acc~28; [2025-02-05 15:38:16,818 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2691: #res := ~retValue_acc~21; [2025-02-05 15:38:16,928 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2163-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; [2025-02-05 15:38:16,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2326-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-02-05 15:38:16,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2339-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-02-05 15:38:17,002 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1537: #res := ~retValue_acc~10; [2025-02-05 15:38:17,017 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L870: #res := ~retValue_acc~7; [2025-02-05 15:38:17,020 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981: #res := ~retValue_acc~13; [2025-02-05 15:38:17,022 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2154: #res := ~retValue_acc~14; [2025-02-05 15:38:17,188 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L831: #res := ~retValue_acc~6; [2025-02-05 15:38:17,208 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2197: #res := ~retValue_acc~16; [2025-02-05 15:38:17,251 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2246-1: isEmpty_#res#1 := isEmpty_~retValue_acc~18#1; [2025-02-05 15:38:17,306 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1226: #res := ~retValue_acc~9; [2025-02-05 15:38:17,363 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904-1: main_#res#1 := main_~retValue_acc~12#1; [2025-02-05 15:38:17,363 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L195-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:38:17,372 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L990: #res := ~retValue_acc~8; [2025-02-05 15:38:17,447 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2909-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~27#1; [2025-02-05 15:38:17,590 INFO L? ?]: Removed 497 outVars from TransFormulas that were not future-live. [2025-02-05 15:38:17,591 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:38:17,610 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:38:17,610 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:38:17,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:38:17 BoogieIcfgContainer [2025-02-05 15:38:17,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:38:17,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:38:17,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:38:17,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:38:17,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:38:15" (1/3) ... [2025-02-05 15:38:17,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a14c8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:38:17, skipping insertion in model container [2025-02-05 15:38:17,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:16" (2/3) ... [2025-02-05 15:38:17,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a14c8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:38:17, skipping insertion in model container [2025-02-05 15:38:17,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:38:17" (3/3) ... [2025-02-05 15:38:17,619 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product32.cil.c [2025-02-05 15:38:17,635 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:38:17,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product32.cil.c that has 30 procedures, 629 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:38:17,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:38:17,713 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;@62d4b848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:38:17,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:38:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 629 states, 482 states have (on average 1.6597510373443984) internal successors, (800), 503 states have internal predecessors, (800), 115 states have call successors, (115), 29 states have call predecessors, (115), 29 states have return successors, (115), 111 states have call predecessors, (115), 115 states have call successors, (115) [2025-02-05 15:38:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 15:38:17,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:17,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:17,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:17,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1888915641, now seen corresponding path program 1 times [2025-02-05 15:38:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219844075] [2025-02-05 15:38:17,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:17,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 15:38:17,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 15:38:17,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:17,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:18,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:18,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219844075] [2025-02-05 15:38:18,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219844075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:18,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:18,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456593454] [2025-02-05 15:38:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:18,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:18,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:18,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:18,296 INFO L87 Difference]: Start difference. First operand has 629 states, 482 states have (on average 1.6597510373443984) internal successors, (800), 503 states have internal predecessors, (800), 115 states have call successors, (115), 29 states have call predecessors, (115), 29 states have return successors, (115), 111 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:18,498 INFO L93 Difference]: Finished difference Result 1255 states and 2072 transitions. [2025-02-05 15:38:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:18,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2025-02-05 15:38:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:18,516 INFO L225 Difference]: With dead ends: 1255 [2025-02-05 15:38:18,517 INFO L226 Difference]: Without dead ends: 633 [2025-02-05 15:38:18,522 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:38:18,523 INFO L435 NwaCegarLoop]: 1016 mSDtfsCounter, 91 mSDsluCounter, 4994 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6010 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:18,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6010 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:18,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-02-05 15:38:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 631. [2025-02-05 15:38:18,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 485 states have (on average 1.6536082474226803) internal successors, (802), 505 states have internal predecessors, (802), 116 states have call successors, (116), 29 states have call predecessors, (116), 29 states have return successors, (115), 110 states have call predecessors, (115), 113 states have call successors, (115) [2025-02-05 15:38:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1033 transitions. [2025-02-05 15:38:18,599 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1033 transitions. Word has length 67 [2025-02-05 15:38:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:18,600 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 1033 transitions. [2025-02-05 15:38:18,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1033 transitions. [2025-02-05 15:38:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 15:38:18,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:18,603 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:18,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:38:18,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:18,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash 440805100, now seen corresponding path program 1 times [2025-02-05 15:38:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:18,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694415039] [2025-02-05 15:38:18,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:18,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 15:38:18,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:38:18,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:18,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:18,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:18,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694415039] [2025-02-05 15:38:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694415039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:18,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:18,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:18,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904138531] [2025-02-05 15:38:18,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:18,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:18,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:18,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:18,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:18,753 INFO L87 Difference]: Start difference. First operand 631 states and 1033 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:18,832 INFO L93 Difference]: Finished difference Result 1244 states and 2047 transitions. [2025-02-05 15:38:18,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:18,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-02-05 15:38:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:18,840 INFO L225 Difference]: With dead ends: 1244 [2025-02-05 15:38:18,840 INFO L226 Difference]: Without dead ends: 607 [2025-02-05 15:38:18,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:18,845 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 14 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:18,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3004 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-02-05 15:38:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2025-02-05 15:38:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 464 states have (on average 1.644396551724138) internal successors, (763), 482 states have internal predecessors, (763), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:38:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 990 transitions. [2025-02-05 15:38:18,877 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 990 transitions. Word has length 68 [2025-02-05 15:38:18,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:18,878 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 990 transitions. [2025-02-05 15:38:18,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 990 transitions. [2025-02-05 15:38:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 15:38:18,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:18,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:18,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:38:18,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:18,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:18,883 INFO L85 PathProgramCache]: Analyzing trace with hash 931593515, now seen corresponding path program 1 times [2025-02-05 15:38:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:18,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812729322] [2025-02-05 15:38:18,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:18,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 15:38:18,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:38:18,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:18,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:19,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:19,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812729322] [2025-02-05 15:38:19,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812729322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:19,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:19,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:19,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808775662] [2025-02-05 15:38:19,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:19,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:19,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:19,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:19,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:19,114 INFO L87 Difference]: Start difference. First operand 607 states and 990 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:19,200 INFO L93 Difference]: Finished difference Result 1207 states and 1979 transitions. [2025-02-05 15:38:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:19,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-02-05 15:38:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:19,206 INFO L225 Difference]: With dead ends: 1207 [2025-02-05 15:38:19,206 INFO L226 Difference]: Without dead ends: 601 [2025-02-05 15:38:19,209 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:38:19,210 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 77 mSDsluCounter, 4825 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5804 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:19,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5804 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-02-05 15:38:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-02-05 15:38:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 458 states have (on average 1.6375545851528384) internal successors, (750), 476 states have internal predecessors, (750), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:38:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 977 transitions. [2025-02-05 15:38:19,237 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 977 transitions. Word has length 68 [2025-02-05 15:38:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:19,237 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 977 transitions. [2025-02-05 15:38:19,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 977 transitions. [2025-02-05 15:38:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 15:38:19,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:19,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:19,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:38:19,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:19,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:19,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1022080991, now seen corresponding path program 1 times [2025-02-05 15:38:19,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:19,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287744616] [2025-02-05 15:38:19,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:19,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:19,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 15:38:19,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 15:38:19,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:19,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:19,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:19,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287744616] [2025-02-05 15:38:19,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287744616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:19,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:19,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:19,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556179598] [2025-02-05 15:38:19,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:19,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:19,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:19,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:19,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:19,432 INFO L87 Difference]: Start difference. First operand 601 states and 977 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:19,498 INFO L93 Difference]: Finished difference Result 1195 states and 1953 transitions. [2025-02-05 15:38:19,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:19,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-02-05 15:38:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:19,503 INFO L225 Difference]: With dead ends: 1195 [2025-02-05 15:38:19,504 INFO L226 Difference]: Without dead ends: 595 [2025-02-05 15:38:19,507 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:38:19,508 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 63 mSDsluCounter, 4777 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5744 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:19,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5744 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-05 15:38:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-02-05 15:38:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 452 states have (on average 1.6305309734513274) internal successors, (737), 470 states have internal predecessors, (737), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:38:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 964 transitions. [2025-02-05 15:38:19,544 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 964 transitions. Word has length 69 [2025-02-05 15:38:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:19,544 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 964 transitions. [2025-02-05 15:38:19,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 964 transitions. [2025-02-05 15:38:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 15:38:19,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:19,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:19,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:38:19,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:19,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash -651593659, now seen corresponding path program 1 times [2025-02-05 15:38:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:19,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012648868] [2025-02-05 15:38:19,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:19,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 15:38:19,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 15:38:19,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:19,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:19,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012648868] [2025-02-05 15:38:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012648868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:19,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:19,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:19,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479631276] [2025-02-05 15:38:19,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:19,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:19,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:19,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:19,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:19,684 INFO L87 Difference]: Start difference. First operand 595 states and 964 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:19,769 INFO L93 Difference]: Finished difference Result 1183 states and 1927 transitions. [2025-02-05 15:38:19,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:19,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-02-05 15:38:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:19,773 INFO L225 Difference]: With dead ends: 1183 [2025-02-05 15:38:19,773 INFO L226 Difference]: Without dead ends: 589 [2025-02-05 15:38:19,778 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:38:19,779 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 49 mSDsluCounter, 4729 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5684 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:19,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5684 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-05 15:38:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-02-05 15:38:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6233183856502242) internal successors, (724), 464 states have internal predecessors, (724), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:38:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 951 transitions. [2025-02-05 15:38:19,805 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 951 transitions. Word has length 70 [2025-02-05 15:38:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:19,805 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 951 transitions. [2025-02-05 15:38:19,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 951 transitions. [2025-02-05 15:38:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 15:38:19,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:19,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:19,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:38:19,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:19,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1674387331, now seen corresponding path program 1 times [2025-02-05 15:38:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:19,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137884838] [2025-02-05 15:38:19,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:19,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:19,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 15:38:19,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 15:38:19,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:19,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:19,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137884838] [2025-02-05 15:38:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137884838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:19,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:19,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789142578] [2025-02-05 15:38:19,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:19,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:19,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:19,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:19,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:19,936 INFO L87 Difference]: Start difference. First operand 589 states and 951 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:19,992 INFO L93 Difference]: Finished difference Result 1171 states and 1901 transitions. [2025-02-05 15:38:19,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:19,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-02-05 15:38:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:20,000 INFO L225 Difference]: With dead ends: 1171 [2025-02-05 15:38:20,000 INFO L226 Difference]: Without dead ends: 589 [2025-02-05 15:38:20,002 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:38:20,003 INFO L435 NwaCegarLoop]: 943 mSDtfsCounter, 24 mSDsluCounter, 4693 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5636 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:20,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5636 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-05 15:38:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-02-05 15:38:20,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6210762331838564) internal successors, (723), 464 states have internal predecessors, (723), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:38:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 950 transitions. [2025-02-05 15:38:20,026 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 950 transitions. Word has length 70 [2025-02-05 15:38:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:20,026 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 950 transitions. [2025-02-05 15:38:20,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 950 transitions. [2025-02-05 15:38:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 15:38:20,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:20,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:20,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:38:20,027 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:20,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1246533381, now seen corresponding path program 1 times [2025-02-05 15:38:20,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:20,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180487667] [2025-02-05 15:38:20,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:20,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:20,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 15:38:20,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 15:38:20,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:20,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180487667] [2025-02-05 15:38:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180487667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:20,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735952984] [2025-02-05 15:38:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:20,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:20,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:20,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:20,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:20,121 INFO L87 Difference]: Start difference. First operand 589 states and 950 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:20,165 INFO L93 Difference]: Finished difference Result 1162 states and 1886 transitions. [2025-02-05 15:38:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:20,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-02-05 15:38:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:20,169 INFO L225 Difference]: With dead ends: 1162 [2025-02-05 15:38:20,169 INFO L226 Difference]: Without dead ends: 589 [2025-02-05 15:38:20,172 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:38:20,173 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 15 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:20,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2790 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-05 15:38:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-02-05 15:38:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6188340807174888) internal successors, (722), 464 states have internal predecessors, (722), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:38:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 949 transitions. [2025-02-05 15:38:20,194 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 949 transitions. Word has length 71 [2025-02-05 15:38:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:20,195 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 949 transitions. [2025-02-05 15:38:20,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 949 transitions. [2025-02-05 15:38:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 15:38:20,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:20,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:20,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:38:20,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:20,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:20,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1524887693, now seen corresponding path program 1 times [2025-02-05 15:38:20,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:20,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162357076] [2025-02-05 15:38:20,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:20,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:20,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 15:38:20,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 15:38:20,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:20,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:20,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:20,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162357076] [2025-02-05 15:38:20,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162357076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:20,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:20,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:20,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497167505] [2025-02-05 15:38:20,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:20,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:20,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:20,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:20,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:20,282 INFO L87 Difference]: Start difference. First operand 589 states and 949 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:20,323 INFO L93 Difference]: Finished difference Result 1162 states and 1884 transitions. [2025-02-05 15:38:20,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:20,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-02-05 15:38:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:20,328 INFO L225 Difference]: With dead ends: 1162 [2025-02-05 15:38:20,328 INFO L226 Difference]: Without dead ends: 589 [2025-02-05 15:38:20,330 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:38:20,331 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 14 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:20,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2792 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:20,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-05 15:38:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-02-05 15:38:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.616591928251121) internal successors, (721), 464 states have internal predecessors, (721), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:38:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 948 transitions. [2025-02-05 15:38:20,347 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 948 transitions. Word has length 72 [2025-02-05 15:38:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:20,347 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 948 transitions. [2025-02-05 15:38:20,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:20,348 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 948 transitions. [2025-02-05 15:38:20,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 15:38:20,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:20,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:20,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:38:20,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:20,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:20,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1988718782, now seen corresponding path program 1 times [2025-02-05 15:38:20,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:20,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850639428] [2025-02-05 15:38:20,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:20,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:20,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 15:38:20,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 15:38:20,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:20,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:20,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:20,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850639428] [2025-02-05 15:38:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850639428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:20,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:20,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:20,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773397116] [2025-02-05 15:38:20,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:20,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:20,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:20,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:20,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:20,450 INFO L87 Difference]: Start difference. First operand 589 states and 948 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:20,483 INFO L93 Difference]: Finished difference Result 1162 states and 1882 transitions. [2025-02-05 15:38:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:20,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-02-05 15:38:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:20,488 INFO L225 Difference]: With dead ends: 1162 [2025-02-05 15:38:20,488 INFO L226 Difference]: Without dead ends: 589 [2025-02-05 15:38:20,491 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:38:20,491 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 13 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2794 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:38:20,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2794 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-05 15:38:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-02-05 15:38:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6143497757847534) internal successors, (720), 464 states have internal predecessors, (720), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:38:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 947 transitions. [2025-02-05 15:38:20,509 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 947 transitions. Word has length 73 [2025-02-05 15:38:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:20,510 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 947 transitions. [2025-02-05 15:38:20,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 947 transitions. [2025-02-05 15:38:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 15:38:20,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:20,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:20,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:38:20,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:20,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash -363262928, now seen corresponding path program 1 times [2025-02-05 15:38:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:20,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454546853] [2025-02-05 15:38:20,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:20,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:20,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 15:38:20,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 15:38:20,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:20,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:20,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454546853] [2025-02-05 15:38:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454546853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:20,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:20,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:20,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788969025] [2025-02-05 15:38:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:20,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:20,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:20,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:20,585 INFO L87 Difference]: Start difference. First operand 589 states and 947 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:20,625 INFO L93 Difference]: Finished difference Result 1162 states and 1880 transitions. [2025-02-05 15:38:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:20,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-02-05 15:38:20,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:20,630 INFO L225 Difference]: With dead ends: 1162 [2025-02-05 15:38:20,630 INFO L226 Difference]: Without dead ends: 589 [2025-02-05 15:38:20,633 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:38:20,633 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 12 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:20,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2796 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-05 15:38:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-02-05 15:38:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 446 states have (on average 1.6121076233183858) internal successors, (719), 464 states have internal predecessors, (719), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:38:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 946 transitions. [2025-02-05 15:38:20,649 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 946 transitions. Word has length 74 [2025-02-05 15:38:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:20,649 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 946 transitions. [2025-02-05 15:38:20,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 946 transitions. [2025-02-05 15:38:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 15:38:20,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:20,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:20,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:38:20,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:20,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash 188871809, now seen corresponding path program 1 times [2025-02-05 15:38:20,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:20,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498151307] [2025-02-05 15:38:20,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:20,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:20,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 15:38:20,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:38:20,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:20,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:38:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498151307] [2025-02-05 15:38:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498151307] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582617128] [2025-02-05 15:38:20,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:20,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:20,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:20,811 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:38:20,813 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:38:20,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 15:38:21,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:38:21,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:21,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:21,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:38:21,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:21,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:21,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582617128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:21,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:21,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:38:21,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440277212] [2025-02-05 15:38:21,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:21,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:38:21,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:21,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:38:21,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:21,116 INFO L87 Difference]: Start difference. First operand 589 states and 946 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:21,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:21,169 INFO L93 Difference]: Finished difference Result 1678 states and 2726 transitions. [2025-02-05 15:38:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:38:21,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-02-05 15:38:21,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:21,177 INFO L225 Difference]: With dead ends: 1678 [2025-02-05 15:38:21,177 INFO L226 Difference]: Without dead ends: 1107 [2025-02-05 15:38:21,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:21,180 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 908 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:21,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 2450 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:21,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2025-02-05 15:38:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1092. [2025-02-05 15:38:21,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 834 states have (on average 1.6235011990407673) internal successors, (1354), 869 states have internal predecessors, (1354), 205 states have call successors, (205), 53 states have call predecessors, (205), 52 states have return successors, (207), 197 states have call predecessors, (207), 202 states have call successors, (207) [2025-02-05 15:38:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1766 transitions. [2025-02-05 15:38:21,216 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1766 transitions. Word has length 75 [2025-02-05 15:38:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:21,216 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1766 transitions. [2025-02-05 15:38:21,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1766 transitions. [2025-02-05 15:38:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 15:38:21,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:21,217 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:21,225 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:38:21,417 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,SelfDestructingSolverStorable10 [2025-02-05 15:38:21,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:21,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1553745434, now seen corresponding path program 1 times [2025-02-05 15:38:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:21,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599000894] [2025-02-05 15:38:21,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:21,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 15:38:21,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 15:38:21,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:21,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:38:21,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:21,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599000894] [2025-02-05 15:38:21,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599000894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:21,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309166753] [2025-02-05 15:38:21,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:21,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:21,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:21,577 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:38:21,578 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:38:21,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 15:38:21,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 15:38:21,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:21,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:21,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:38:21,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:21,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:21,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309166753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:21,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:21,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:38:21,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838261769] [2025-02-05 15:38:21,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:21,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:38:21,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:21,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:38:21,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:21,879 INFO L87 Difference]: Start difference. First operand 1092 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:21,948 INFO L93 Difference]: Finished difference Result 2684 states and 4368 transitions. [2025-02-05 15:38:21,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:38:21,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-02-05 15:38:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:21,959 INFO L225 Difference]: With dead ends: 2684 [2025-02-05 15:38:21,960 INFO L226 Difference]: Without dead ends: 1610 [2025-02-05 15:38:21,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:21,966 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 907 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 2508 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:21,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 2508 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2025-02-05 15:38:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1562. [2025-02-05 15:38:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1195 states have (on average 1.6343096234309624) internal successors, (1953), 1247 states have internal predecessors, (1953), 292 states have call successors, (292), 74 states have call predecessors, (292), 74 states have return successors, (299), 282 states have call predecessors, (299), 289 states have call successors, (299) [2025-02-05 15:38:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2544 transitions. [2025-02-05 15:38:22,044 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2544 transitions. Word has length 76 [2025-02-05 15:38:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:22,045 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2544 transitions. [2025-02-05 15:38:22,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2544 transitions. [2025-02-05 15:38:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 15:38:22,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:22,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:22,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:38:22,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:22,250 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:22,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash 810804980, now seen corresponding path program 1 times [2025-02-05 15:38:22,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:22,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799479082] [2025-02-05 15:38:22,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:22,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:22,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 15:38:22,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 15:38:22,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:22,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:22,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799479082] [2025-02-05 15:38:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799479082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:22,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:22,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84577400] [2025-02-05 15:38:22,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:22,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:22,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:22,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:22,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:22,380 INFO L87 Difference]: Start difference. First operand 1562 states and 2544 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:38:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:22,967 INFO L93 Difference]: Finished difference Result 4610 states and 7681 transitions. [2025-02-05 15:38:22,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:22,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2025-02-05 15:38:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:22,994 INFO L225 Difference]: With dead ends: 4610 [2025-02-05 15:38:22,995 INFO L226 Difference]: Without dead ends: 3066 [2025-02-05 15:38:23,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:23,005 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 941 mSDsluCounter, 3875 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 4958 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:23,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 4958 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:38:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2025-02-05 15:38:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3019. [2025-02-05 15:38:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2311 states have (on average 1.6339247079186499) internal successors, (3776), 2411 states have internal predecessors, (3776), 563 states have call successors, (563), 142 states have call predecessors, (563), 144 states have return successors, (679), 549 states have call predecessors, (679), 559 states have call successors, (679) [2025-02-05 15:38:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 5018 transitions. [2025-02-05 15:38:23,162 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 5018 transitions. Word has length 78 [2025-02-05 15:38:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:23,163 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 5018 transitions. [2025-02-05 15:38:23,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:38:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 5018 transitions. [2025-02-05 15:38:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:38:23,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:23,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:23,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:38:23,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:23,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1750443354, now seen corresponding path program 1 times [2025-02-05 15:38:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:23,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679292093] [2025-02-05 15:38:23,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:23,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:23,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:38:23,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:38:23,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:23,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:38:23,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:23,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679292093] [2025-02-05 15:38:23,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679292093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:23,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638696341] [2025-02-05 15:38:23,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:23,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:23,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:23,330 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:38:23,331 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:38:23,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:38:23,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:38:23,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:23,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:23,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:38:23,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:23,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638696341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:23,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:23,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-05 15:38:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005908056] [2025-02-05 15:38:23,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:23,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:23,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:23,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:23,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:23,714 INFO L87 Difference]: Start difference. First operand 3019 states and 5018 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:38:24,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:24,526 INFO L93 Difference]: Finished difference Result 8192 states and 13882 transitions. [2025-02-05 15:38:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2025-02-05 15:38:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:24,563 INFO L225 Difference]: With dead ends: 8192 [2025-02-05 15:38:24,563 INFO L226 Difference]: Without dead ends: 5191 [2025-02-05 15:38:24,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:38:24,583 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 805 mSDsluCounter, 3507 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 4476 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:24,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 4476 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:38:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5191 states. [2025-02-05 15:38:24,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5191 to 5148. [2025-02-05 15:38:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 3934 states have (on average 1.5882053889171326) internal successors, (6248), 4100 states have internal predecessors, (6248), 950 states have call successors, (950), 256 states have call predecessors, (950), 263 states have return successors, (1283), 931 states have call predecessors, (1283), 944 states have call successors, (1283) [2025-02-05 15:38:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 8481 transitions. [2025-02-05 15:38:24,781 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 8481 transitions. Word has length 79 [2025-02-05 15:38:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:24,781 INFO L471 AbstractCegarLoop]: Abstraction has 5148 states and 8481 transitions. [2025-02-05 15:38:24,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:38:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 8481 transitions. [2025-02-05 15:38:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:38:24,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:24,782 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:24,811 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:38:24,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:24,983 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:24,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:24,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1702049862, now seen corresponding path program 1 times [2025-02-05 15:38:24,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552342462] [2025-02-05 15:38:24,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:24,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:24,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:38:25,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:38:25,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:25,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:25,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:25,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552342462] [2025-02-05 15:38:25,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552342462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:25,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:25,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:25,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583933202] [2025-02-05 15:38:25,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:25,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:25,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:25,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:25,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:25,065 INFO L87 Difference]: Start difference. First operand 5148 states and 8481 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:38:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:25,303 INFO L93 Difference]: Finished difference Result 10302 states and 17137 transitions. [2025-02-05 15:38:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:25,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-02-05 15:38:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:25,348 INFO L225 Difference]: With dead ends: 10302 [2025-02-05 15:38:25,348 INFO L226 Difference]: Without dead ends: 5172 [2025-02-05 15:38:25,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:25,373 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 12 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:25,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2760 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2025-02-05 15:38:25,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 5156. [2025-02-05 15:38:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5156 states, 3940 states have (on average 1.5868020304568529) internal successors, (6252), 4106 states have internal predecessors, (6252), 950 states have call successors, (950), 260 states have call predecessors, (950), 265 states have return successors, (1272), 929 states have call predecessors, (1272), 944 states have call successors, (1272) [2025-02-05 15:38:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5156 states to 5156 states and 8474 transitions. [2025-02-05 15:38:25,582 INFO L78 Accepts]: Start accepts. Automaton has 5156 states and 8474 transitions. Word has length 79 [2025-02-05 15:38:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:25,583 INFO L471 AbstractCegarLoop]: Abstraction has 5156 states and 8474 transitions. [2025-02-05 15:38:25,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:38:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5156 states and 8474 transitions. [2025-02-05 15:38:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:38:25,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:25,584 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:38:25,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:38:25,584 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:25,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:25,585 INFO L85 PathProgramCache]: Analyzing trace with hash 794423674, now seen corresponding path program 1 times [2025-02-05 15:38:25,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:25,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893832850] [2025-02-05 15:38:25,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:25,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:38:25,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:38:25,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:25,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:38:25,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:25,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893832850] [2025-02-05 15:38:25,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893832850] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:25,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:25,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:25,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847561452] [2025-02-05 15:38:25,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:25,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:25,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:25,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:25,725 INFO L87 Difference]: Start difference. First operand 5156 states and 8474 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:38:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:26,546 INFO L93 Difference]: Finished difference Result 15401 states and 26333 transitions. [2025-02-05 15:38:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:26,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-02-05 15:38:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:26,641 INFO L225 Difference]: With dead ends: 15401 [2025-02-05 15:38:26,641 INFO L226 Difference]: Without dead ends: 10263 [2025-02-05 15:38:26,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:26,672 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 939 mSDsluCounter, 3680 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 4694 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:26,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 4694 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:38:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10263 states. [2025-02-05 15:38:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10263 to 10194. [2025-02-05 15:38:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10194 states, 7792 states have (on average 1.582777207392197) internal successors, (12333), 8118 states have internal predecessors, (12333), 1872 states have call successors, (1872), 514 states have call predecessors, (1872), 529 states have return successors, (3066), 1841 states have call predecessors, (3066), 1862 states have call successors, (3066) [2025-02-05 15:38:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10194 states to 10194 states and 17271 transitions. [2025-02-05 15:38:27,069 INFO L78 Accepts]: Start accepts. Automaton has 10194 states and 17271 transitions. Word has length 87 [2025-02-05 15:38:27,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:27,070 INFO L471 AbstractCegarLoop]: Abstraction has 10194 states and 17271 transitions. [2025-02-05 15:38:27,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:38:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10194 states and 17271 transitions. [2025-02-05 15:38:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 15:38:27,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:27,071 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:38:27,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:38:27,071 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:27,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:27,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1059686405, now seen corresponding path program 1 times [2025-02-05 15:38:27,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:27,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463165265] [2025-02-05 15:38:27,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:27,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:27,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 15:38:27,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 15:38:27,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:27,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:38:27,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:27,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463165265] [2025-02-05 15:38:27,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463165265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:27,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:27,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416388502] [2025-02-05 15:38:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:27,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:27,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:27,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:27,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:27,191 INFO L87 Difference]: Start difference. First operand 10194 states and 17271 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:27,657 INFO L93 Difference]: Finished difference Result 20442 states and 35115 transitions. [2025-02-05 15:38:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-02-05 15:38:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:27,744 INFO L225 Difference]: With dead ends: 20442 [2025-02-05 15:38:27,745 INFO L226 Difference]: Without dead ends: 10266 [2025-02-05 15:38:27,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:27,782 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 12 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:27,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2751 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10266 states. [2025-02-05 15:38:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10266 to 10234. [2025-02-05 15:38:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10234 states, 7828 states have (on average 1.5806080735820134) internal successors, (12373), 8146 states have internal predecessors, (12373), 1872 states have call successors, (1872), 530 states have call predecessors, (1872), 533 states have return successors, (3050), 1837 states have call predecessors, (3050), 1862 states have call successors, (3050) [2025-02-05 15:38:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10234 states to 10234 states and 17295 transitions. [2025-02-05 15:38:28,215 INFO L78 Accepts]: Start accepts. Automaton has 10234 states and 17295 transitions. Word has length 88 [2025-02-05 15:38:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:28,217 INFO L471 AbstractCegarLoop]: Abstraction has 10234 states and 17295 transitions. [2025-02-05 15:38:28,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10234 states and 17295 transitions. [2025-02-05 15:38:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 15:38:28,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:28,219 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:38:28,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:38:28,219 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:28,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1977863271, now seen corresponding path program 1 times [2025-02-05 15:38:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:28,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838080196] [2025-02-05 15:38:28,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:28,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 15:38:28,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 15:38:28,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:28,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:38:28,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838080196] [2025-02-05 15:38:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838080196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:28,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:28,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772495783] [2025-02-05 15:38:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:28,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:28,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:28,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:28,393 INFO L87 Difference]: Start difference. First operand 10234 states and 17295 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:38:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:29,603 INFO L93 Difference]: Finished difference Result 30713 states and 54978 transitions. [2025-02-05 15:38:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:29,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-02-05 15:38:29,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:29,759 INFO L225 Difference]: With dead ends: 30713 [2025-02-05 15:38:29,759 INFO L226 Difference]: Without dead ends: 20497 [2025-02-05 15:38:29,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:29,822 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 934 mSDsluCounter, 3761 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 4799 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:29,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 4799 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:38:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20497 states. [2025-02-05 15:38:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20497 to 20396. [2025-02-05 15:38:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20396 states, 15604 states have (on average 1.5772237887721097) internal successors, (24611), 16234 states have internal predecessors, (24611), 3722 states have call successors, (3722), 1054 states have call predecessors, (3722), 1069 states have return successors, (7782), 3667 states have call predecessors, (7782), 3704 states have call successors, (7782) [2025-02-05 15:38:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20396 states to 20396 states and 36115 transitions. [2025-02-05 15:38:30,693 INFO L78 Accepts]: Start accepts. Automaton has 20396 states and 36115 transitions. Word has length 97 [2025-02-05 15:38:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:30,693 INFO L471 AbstractCegarLoop]: Abstraction has 20396 states and 36115 transitions. [2025-02-05 15:38:30,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:38:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 20396 states and 36115 transitions. [2025-02-05 15:38:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:38:30,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:30,695 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:38:30,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:38:30,695 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:30,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:30,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1877580619, now seen corresponding path program 1 times [2025-02-05 15:38:30,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:30,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104022729] [2025-02-05 15:38:30,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:30,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:38:30,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:38:30,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:30,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 15:38:30,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:30,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104022729] [2025-02-05 15:38:30,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104022729] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:30,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:30,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:30,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708912877] [2025-02-05 15:38:30,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:30,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:30,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:30,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:30,776 INFO L87 Difference]: Start difference. First operand 20396 states and 36115 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:38:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:31,604 INFO L93 Difference]: Finished difference Result 40918 states and 74065 transitions. [2025-02-05 15:38:31,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:31,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-02-05 15:38:31,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:31,808 INFO L225 Difference]: With dead ends: 40918 [2025-02-05 15:38:31,808 INFO L226 Difference]: Without dead ends: 20540 [2025-02-05 15:38:32,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:32,074 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 11 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:32,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2751 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20540 states. [2025-02-05 15:38:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20540 to 20476. [2025-02-05 15:38:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20476 states, 15676 states have (on average 1.5750829293187039) internal successors, (24691), 16306 states have internal predecessors, (24691), 3722 states have call successors, (3722), 1070 states have call predecessors, (3722), 1077 states have return successors, (7762), 3659 states have call predecessors, (7762), 3704 states have call successors, (7762) [2025-02-05 15:38:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20476 states to 20476 states and 36175 transitions. [2025-02-05 15:38:33,204 INFO L78 Accepts]: Start accepts. Automaton has 20476 states and 36175 transitions. Word has length 98 [2025-02-05 15:38:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:33,204 INFO L471 AbstractCegarLoop]: Abstraction has 20476 states and 36175 transitions. [2025-02-05 15:38:33,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:38:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 20476 states and 36175 transitions. [2025-02-05 15:38:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:38:33,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:33,207 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:33,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:38:33,207 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:33,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:33,208 INFO L85 PathProgramCache]: Analyzing trace with hash 196892101, now seen corresponding path program 1 times [2025-02-05 15:38:33,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:33,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397406820] [2025-02-05 15:38:33,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:33,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:33,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:38:33,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:38:33,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:33,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:38:33,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:33,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397406820] [2025-02-05 15:38:33,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397406820] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:33,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237176093] [2025-02-05 15:38:33,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:33,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:33,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:33,428 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:38:33,429 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:38:33,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:38:33,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:38:33,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:33,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:33,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1850 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:38:33,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:38:33,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:33,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237176093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:33,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:33,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-02-05 15:38:33,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462824184] [2025-02-05 15:38:33,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:33,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:38:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:33,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:38:33,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:38:33,900 INFO L87 Difference]: Start difference. First operand 20476 states and 36175 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:38:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:39,114 INFO L93 Difference]: Finished difference Result 72917 states and 136718 transitions. [2025-02-05 15:38:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:38:39,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 136 [2025-02-05 15:38:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:39,678 INFO L225 Difference]: With dead ends: 72917 [2025-02-05 15:38:39,679 INFO L226 Difference]: Without dead ends: 52459 [2025-02-05 15:38:39,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:38:39,878 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 3309 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 6986 mSolverCounterSat, 739 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3501 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 7725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 739 IncrementalHoareTripleChecker+Valid, 6986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:39,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3501 Valid, 2381 Invalid, 7725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [739 Valid, 6986 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 15:38:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52459 states. [2025-02-05 15:38:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52459 to 51798. [2025-02-05 15:38:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51798 states, 39708 states have (on average 1.570288103153017) internal successors, (62353), 41234 states have internal predecessors, (62353), 9300 states have call successors, (9300), 2646 states have call predecessors, (9300), 2789 states have return successors, (23574), 9285 states have call predecessors, (23574), 9266 states have call successors, (23574) [2025-02-05 15:38:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51798 states to 51798 states and 95227 transitions. [2025-02-05 15:38:43,041 INFO L78 Accepts]: Start accepts. Automaton has 51798 states and 95227 transitions. Word has length 136 [2025-02-05 15:38:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:43,041 INFO L471 AbstractCegarLoop]: Abstraction has 51798 states and 95227 transitions. [2025-02-05 15:38:43,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 7 states have internal predecessors, (93), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:38:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 51798 states and 95227 transitions. [2025-02-05 15:38:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:38:43,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:43,043 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-02-05 15:38:43,058 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:38:43,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:43,243 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:43,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash 709823494, now seen corresponding path program 1 times [2025-02-05 15:38:43,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:43,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470316577] [2025-02-05 15:38:43,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:43,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:38:43,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:38:43,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:43,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:38:43,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:43,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470316577] [2025-02-05 15:38:43,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470316577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:43,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:43,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:43,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137452646] [2025-02-05 15:38:43,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:43,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:43,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:43,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:43,362 INFO L87 Difference]: Start difference. First operand 51798 states and 95227 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:38:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:48,218 INFO L93 Difference]: Finished difference Result 155809 states and 320055 transitions. [2025-02-05 15:38:48,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:48,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-05 15:38:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:49,514 INFO L225 Difference]: With dead ends: 155809 [2025-02-05 15:38:49,514 INFO L226 Difference]: Without dead ends: 104029 [2025-02-05 15:38:50,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:50,304 INFO L435 NwaCegarLoop]: 1033 mSDtfsCounter, 931 mSDsluCounter, 3760 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 4793 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:50,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 4793 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:38:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104029 states. [2025-02-05 15:38:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104029 to 103672. [2025-02-05 15:38:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103672 states, 79482 states have (on average 1.5675121411137112) internal successors, (124589), 82520 states have internal predecessors, (124589), 18568 states have call successors, (18568), 5286 states have call predecessors, (18568), 5621 states have return successors, (65636), 18601 states have call predecessors, (65636), 18502 states have call successors, (65636) [2025-02-05 15:38:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103672 states to 103672 states and 208793 transitions. [2025-02-05 15:38:56,789 INFO L78 Accepts]: Start accepts. Automaton has 103672 states and 208793 transitions. Word has length 108 [2025-02-05 15:38:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:56,790 INFO L471 AbstractCegarLoop]: Abstraction has 103672 states and 208793 transitions. [2025-02-05 15:38:56,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:38:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 103672 states and 208793 transitions. [2025-02-05 15:38:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:38:56,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:56,791 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-02-05 15:38:56,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:38:56,791 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:56,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:56,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1381924099, now seen corresponding path program 1 times [2025-02-05 15:38:56,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:56,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619273025] [2025-02-05 15:38:56,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:56,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:56,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:38:56,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:38:56,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:56,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:38:56,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:56,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619273025] [2025-02-05 15:38:56,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619273025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:56,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:56,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911510259] [2025-02-05 15:38:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:56,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:56,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:56,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:56,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:56,872 INFO L87 Difference]: Start difference. First operand 103672 states and 208793 transitions. 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:03,548 INFO L93 Difference]: Finished difference Result 208222 states and 439998 transitions. [2025-02-05 15:39:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:03,548 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-05 15:39:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:04,558 INFO L225 Difference]: With dead ends: 208222 [2025-02-05 15:39:04,558 INFO L226 Difference]: Without dead ends: 104568 [2025-02-05 15:39:05,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:05,469 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 10 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:05,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2751 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104568 states.