./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product28.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/email_spec3_product28.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 6f40464de6444b4c527a3fd043e201dc912ddaed5b163e61d0d1df63c7a25d4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:44:10,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:44:10,709 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:44:10,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:44:10,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:44:10,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:44:10,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:44:10,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:44:10,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:44:10,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:44:10,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:44:10,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:44:10,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:44:10,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:44:10,730 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:44:10,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:44:10,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:44:10,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:44:10,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:44:10,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:44:10,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:44:10,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:44:10,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:44:10,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:44:10,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:44:10,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:44:10,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:44:10,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:44:10,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:44:10,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:44:10,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:44:10,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:44:10,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:44:10,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:44:10,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:44:10,732 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:44:10,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:44:10,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:44:10,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:44:10,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:44:10,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:44:10,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:44:10,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:44:10,732 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-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 -> 6f40464de6444b4c527a3fd043e201dc912ddaed5b163e61d0d1df63c7a25d4d [2025-02-05 15:44:10,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:44:10,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:44:10,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:44:10,946 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:44:10,946 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:44:10,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product28.cil.c [2025-02-05 15:44:12,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83c5fec0a/66ae42b8ed99463d8a35ac25d74aa2e5/FLAG9aac238af [2025-02-05 15:44:12,550 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:44:12,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product28.cil.c [2025-02-05 15:44:12,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83c5fec0a/66ae42b8ed99463d8a35ac25d74aa2e5/FLAG9aac238af [2025-02-05 15:44:12,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83c5fec0a/66ae42b8ed99463d8a35ac25d74aa2e5 [2025-02-05 15:44:12,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:44:12,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:44:12,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:44:12,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:44:12,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:44:12,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:44:12" (1/1) ... [2025-02-05 15:44:12,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c438551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:12, skipping insertion in model container [2025-02-05 15:44:12,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:44:12" (1/1) ... [2025-02-05 15:44:12,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:44:12,808 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/email_spec3_product28.cil.c[6522,6535] [2025-02-05 15:44:13,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:44:13,019 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:44:13,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-02-05 15:44:13,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [208] [2025-02-05 15:44:13,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [270] [2025-02-05 15:44:13,026 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [279] [2025-02-05 15:44:13,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [645] [2025-02-05 15:44:13,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1724] [2025-02-05 15:44:13,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2007] [2025-02-05 15:44:13,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2409] [2025-02-05 15:44:13,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2622] [2025-02-05 15:44:13,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2639] [2025-02-05 15:44:13,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2674] [2025-02-05 15:44:13,036 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/email_spec3_product28.cil.c[6522,6535] [2025-02-05 15:44:13,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:44:13,149 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:44:13,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13 WrapperNode [2025-02-05 15:44:13,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:44:13,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:44:13,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:44:13,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:44:13,157 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:44:13" (1/1) ... [2025-02-05 15:44:13,175 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:44:13" (1/1) ... [2025-02-05 15:44:13,204 INFO L138 Inliner]: procedures = 129, calls = 203, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 885 [2025-02-05 15:44:13,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:44:13,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:44:13,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:44:13,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:44:13,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (1/1) ... [2025-02-05 15:44:13,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (1/1) ... [2025-02-05 15:44:13,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (1/1) ... [2025-02-05 15:44:13,237 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:44:13,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (1/1) ... [2025-02-05 15:44:13,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (1/1) ... [2025-02-05 15:44:13,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (1/1) ... [2025-02-05 15:44:13,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (1/1) ... [2025-02-05 15:44:13,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (1/1) ... [2025-02-05 15:44:13,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (1/1) ... [2025-02-05 15:44:13,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:44:13,285 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:44:13,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:44:13,286 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:44:13,287 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (1/1) ... [2025-02-05 15:44:13,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:44:13,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:13,317 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:44:13,326 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:44:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:44:13,345 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:44:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:44:13,345 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:44:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:44:13,345 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:44:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:44:13,345 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:44:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:44:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:44:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:44:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:44:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:44:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:44:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:44:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:44:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:44:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:44:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:44:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:44:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:44:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:44:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:44:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:44:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:44:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:44:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:44:13,348 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:44:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:44:13,348 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:44:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:44:13,348 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:44:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:44:13,348 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:44:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:44:13,349 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:44:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:44:13,350 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:44:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:44:13,350 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:44:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:44:13,350 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:44:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:44:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:44:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:44:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:44:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:44:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:44:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:44:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:44:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:44:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:44:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:44:13,528 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:44:13,531 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:44:13,716 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1701-1: getClientId_#res#1 := getClientId_~retValue_acc~23#1; [2025-02-05 15:44:13,724 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2316: #res := ~retValue_acc~33; [2025-02-05 15:44:13,737 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2909: #res := ~retValue_acc~43; [2025-02-05 15:44:13,790 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1313-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~17#1; [2025-02-05 15:44:13,790 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1358: #res#1 := ~retValue_acc~18#1; [2025-02-05 15:44:13,805 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582: #res := ~retValue_acc~21; [2025-02-05 15:44:13,812 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1266: #res := ~retValue_acc~16; [2025-02-05 15:44:13,823 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L205-1: createEmail_#res#1 := createEmail_~retValue_acc~3#1; [2025-02-05 15:44:13,832 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2242: #res := ~retValue_acc~31; [2025-02-05 15:44:13,840 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2279: #res := ~retValue_acc~32; [2025-02-05 15:44:13,845 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2353: #res := ~retValue_acc~34; [2025-02-05 15:44:13,868 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127: #res := ~retValue_acc~28; [2025-02-05 15:44:14,093 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2671-1: valid_product_#res#1 := valid_product_~retValue_acc~38#1; [2025-02-05 15:44:14,093 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~20#1; [2025-02-05 15:44:14,094 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2866-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~40#1; [2025-02-05 15:44:14,094 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1421-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~19#1; [2025-02-05 15:44:14,094 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~41#1; [2025-02-05 15:44:14,094 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~42#1; [2025-02-05 15:44:14,103 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2090: #res := ~retValue_acc~27; [2025-02-05 15:44:14,112 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L161-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~0#1; [2025-02-05 15:44:14,113 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L181: #res#1 := ~retValue_acc~1#1; [2025-02-05 15:44:14,209 INFO L? ?]: Removed 405 outVars from TransFormulas that were not future-live. [2025-02-05 15:44:14,210 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:44:14,226 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:44:14,226 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:44:14,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:44:14 BoogieIcfgContainer [2025-02-05 15:44:14,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:44:14,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:44:14,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:44:14,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:44:14,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:44:12" (1/3) ... [2025-02-05 15:44:14,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d9c88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:44:14, skipping insertion in model container [2025-02-05 15:44:14,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:13" (2/3) ... [2025-02-05 15:44:14,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d9c88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:44:14, skipping insertion in model container [2025-02-05 15:44:14,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:44:14" (3/3) ... [2025-02-05 15:44:14,236 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product28.cil.c [2025-02-05 15:44:14,250 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:44:14,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product28.cil.c that has 24 procedures, 337 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:44:14,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:44:14,369 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;@626aa283, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:44:14,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:44:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 337 states, 257 states have (on average 1.5136186770428015) internal successors, (389), 263 states have internal predecessors, (389), 55 states have call successors, (55), 23 states have call predecessors, (55), 23 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-05 15:44:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:44:14,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:14,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:44:14,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1827520178, now seen corresponding path program 1 times [2025-02-05 15:44:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:14,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295845915] [2025-02-05 15:44:14,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:14,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:14,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:44:14,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:44:14,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:14,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:44:14,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295845915] [2025-02-05 15:44:14,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295845915] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58984936] [2025-02-05 15:44:14,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:14,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:14,981 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:44:14,982 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:44:15,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:44:15,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:44:15,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:15,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:15,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:44:15,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:44:15,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:15,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58984936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:15,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:15,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:44:15,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391610692] [2025-02-05 15:44:15,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:15,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:44:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:15,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:44:15,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:15,310 INFO L87 Difference]: Start difference. First operand has 337 states, 257 states have (on average 1.5136186770428015) internal successors, (389), 263 states have internal predecessors, (389), 55 states have call successors, (55), 23 states have call predecessors, (55), 23 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:15,342 INFO L93 Difference]: Finished difference Result 525 states and 762 transitions. [2025-02-05 15:44:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:44:15,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 127 [2025-02-05 15:44:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:15,356 INFO L225 Difference]: With dead ends: 525 [2025-02-05 15:44:15,356 INFO L226 Difference]: Without dead ends: 329 [2025-02-05 15:44:15,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:15,364 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:15,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-05 15:44:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-02-05 15:44:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 251 states have (on average 1.5099601593625498) internal successors, (379), 255 states have internal predecessors, (379), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 15:44:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 486 transitions. [2025-02-05 15:44:15,418 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 486 transitions. Word has length 127 [2025-02-05 15:44:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:15,420 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 486 transitions. [2025-02-05 15:44:15,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 486 transitions. [2025-02-05 15:44:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:44:15,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:15,428 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-02-05 15:44:15,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:44:15,628 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,SelfDestructingSolverStorable0 [2025-02-05 15:44:15,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:15,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:15,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1994072240, now seen corresponding path program 1 times [2025-02-05 15:44:15,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:15,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373735521] [2025-02-05 15:44:15,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:15,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:44:15,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:44:15,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:15,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:44:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373735521] [2025-02-05 15:44:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373735521] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138409267] [2025-02-05 15:44:15,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:15,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:15,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:15,900 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:44:15,901 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:44:16,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:44:16,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:44:16,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:16,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:16,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:44:16,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:44:16,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138409267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:16,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:16,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:44:16,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875753474] [2025-02-05 15:44:16,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:16,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:16,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:16,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:16,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:16,215 INFO L87 Difference]: Start difference. First operand 329 states and 486 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:16,268 INFO L93 Difference]: Finished difference Result 513 states and 739 transitions. [2025-02-05 15:44:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:16,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2025-02-05 15:44:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:16,272 INFO L225 Difference]: With dead ends: 513 [2025-02-05 15:44:16,275 INFO L226 Difference]: Without dead ends: 331 [2025-02-05 15:44:16,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:16,277 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:16,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-02-05 15:44:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2025-02-05 15:44:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 253 states have (on average 1.5059288537549407) internal successors, (381), 257 states have internal predecessors, (381), 55 states have call successors, (55), 23 states have call predecessors, (55), 22 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 15:44:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 488 transitions. [2025-02-05 15:44:16,311 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 488 transitions. Word has length 128 [2025-02-05 15:44:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:16,312 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 488 transitions. [2025-02-05 15:44:16,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 488 transitions. [2025-02-05 15:44:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:44:16,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:16,314 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:16,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:44:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:16,515 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:16,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1303064985, now seen corresponding path program 1 times [2025-02-05 15:44:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:16,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88104974] [2025-02-05 15:44:16,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:16,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:16,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:44:16,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:44:16,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:16,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:44:16,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:16,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88104974] [2025-02-05 15:44:16,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88104974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:16,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694540824] [2025-02-05 15:44:16,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:16,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:16,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:16,753 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:44:16,755 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:44:16,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:44:17,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:44:17,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:17,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:44:17,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:44:17,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694540824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:17,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:44:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150705834] [2025-02-05 15:44:17,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:17,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:17,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:17,099 INFO L87 Difference]: Start difference. First operand 331 states and 488 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:17,129 INFO L93 Difference]: Finished difference Result 686 states and 1026 transitions. [2025-02-05 15:44:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:17,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-02-05 15:44:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:17,135 INFO L225 Difference]: With dead ends: 686 [2025-02-05 15:44:17,135 INFO L226 Difference]: Without dead ends: 382 [2025-02-05 15:44:17,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:17,136 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 99 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:17,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 946 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-05 15:44:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2025-02-05 15:44:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 285 states have (on average 1.5228070175438597) internal successors, (434), 289 states have internal predecessors, (434), 66 states have call successors, (66), 23 states have call predecessors, (66), 22 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-05 15:44:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 563 transitions. [2025-02-05 15:44:17,162 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 563 transitions. Word has length 133 [2025-02-05 15:44:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:17,163 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 563 transitions. [2025-02-05 15:44:17,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 563 transitions. [2025-02-05 15:44:17,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:44:17,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:17,166 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:17,174 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:44:17,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:17,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:17,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:17,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1145006613, now seen corresponding path program 1 times [2025-02-05 15:44:17,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:17,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264734265] [2025-02-05 15:44:17,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:17,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:17,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:44:17,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:44:17,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:17,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:44:17,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:17,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264734265] [2025-02-05 15:44:17,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264734265] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:17,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164787676] [2025-02-05 15:44:17,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:17,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:17,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:17,523 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:44:17,525 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:44:17,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:44:17,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:44:17,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:17,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:17,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:44:17,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:44:17,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164787676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:17,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:44:17,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445513542] [2025-02-05 15:44:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:17,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:17,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:17,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:17,851 INFO L87 Difference]: Start difference. First operand 374 states and 563 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:17,898 INFO L93 Difference]: Finished difference Result 739 states and 1116 transitions. [2025-02-05 15:44:17,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:17,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 134 [2025-02-05 15:44:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:17,901 INFO L225 Difference]: With dead ends: 739 [2025-02-05 15:44:17,902 INFO L226 Difference]: Without dead ends: 376 [2025-02-05 15:44:17,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:17,903 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 2 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:17,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1901 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-05 15:44:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-02-05 15:44:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 286 states have (on average 1.520979020979021) internal successors, (435), 291 states have internal predecessors, (435), 66 states have call successors, (66), 23 states have call predecessors, (66), 23 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) [2025-02-05 15:44:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 566 transitions. [2025-02-05 15:44:17,921 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 566 transitions. Word has length 134 [2025-02-05 15:44:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:17,921 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 566 transitions. [2025-02-05 15:44:17,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 566 transitions. [2025-02-05 15:44:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:44:17,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:17,923 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2025-02-05 15:44:17,935 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:44:18,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:18,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:18,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1966551970, now seen corresponding path program 1 times [2025-02-05 15:44:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:18,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075408190] [2025-02-05 15:44:18,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:18,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:44:18,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:44:18,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:18,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:44:18,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:18,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075408190] [2025-02-05 15:44:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075408190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445552236] [2025-02-05 15:44:18,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:18,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:18,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:18,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:44:18,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:44:18,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:44:18,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:44:18,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:18,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:18,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:44:18,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:44:18,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:18,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445552236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:18,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:18,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:44:18,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155834007] [2025-02-05 15:44:18,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:18,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:18,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:18,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:18,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:18,727 INFO L87 Difference]: Start difference. First operand 376 states and 566 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:18,801 INFO L93 Difference]: Finished difference Result 741 states and 1121 transitions. [2025-02-05 15:44:18,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:18,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 135 [2025-02-05 15:44:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:18,806 INFO L225 Difference]: With dead ends: 741 [2025-02-05 15:44:18,807 INFO L226 Difference]: Without dead ends: 378 [2025-02-05 15:44:18,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:18,809 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 2 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1887 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:44:18,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1887 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-05 15:44:18,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-02-05 15:44:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 287 states have (on average 1.519163763066202) internal successors, (436), 293 states have internal predecessors, (436), 66 states have call successors, (66), 23 states have call predecessors, (66), 24 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2025-02-05 15:44:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 572 transitions. [2025-02-05 15:44:18,828 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 572 transitions. Word has length 135 [2025-02-05 15:44:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:18,828 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 572 transitions. [2025-02-05 15:44:18,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 572 transitions. [2025-02-05 15:44:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:44:18,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:18,831 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:18,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:44:19,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:19,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:19,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash 467184384, now seen corresponding path program 1 times [2025-02-05 15:44:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:19,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215583683] [2025-02-05 15:44:19,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:19,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:44:19,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:44:19,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:19,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:44:19,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:19,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215583683] [2025-02-05 15:44:19,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215583683] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:19,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:19,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:19,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416370672] [2025-02-05 15:44:19,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:19,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:19,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:19,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:19,203 INFO L87 Difference]: Start difference. First operand 378 states and 572 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:19,248 INFO L93 Difference]: Finished difference Result 733 states and 1112 transitions. [2025-02-05 15:44:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 136 [2025-02-05 15:44:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:19,251 INFO L225 Difference]: With dead ends: 733 [2025-02-05 15:44:19,252 INFO L226 Difference]: Without dead ends: 378 [2025-02-05 15:44:19,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:19,254 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 2 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:19,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1905 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:19,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-05 15:44:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-02-05 15:44:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 287 states have (on average 1.519163763066202) internal successors, (436), 293 states have internal predecessors, (436), 66 states have call successors, (66), 23 states have call predecessors, (66), 24 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2025-02-05 15:44:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 571 transitions. [2025-02-05 15:44:19,280 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 571 transitions. Word has length 136 [2025-02-05 15:44:19,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:19,281 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 571 transitions. [2025-02-05 15:44:19,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 571 transitions. [2025-02-05 15:44:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:44:19,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:19,285 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:19,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:44:19,286 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:19,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1910651563, now seen corresponding path program 2 times [2025-02-05 15:44:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:19,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189273098] [2025-02-05 15:44:19,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:44:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:19,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-02-05 15:44:19,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 137 statements. [2025-02-05 15:44:19,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:44:19,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:44:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189273098] [2025-02-05 15:44:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189273098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:19,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:44:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624482401] [2025-02-05 15:44:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:19,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:44:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:19,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:44:19,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:19,498 INFO L87 Difference]: Start difference. First operand 378 states and 571 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:19,867 INFO L93 Difference]: Finished difference Result 968 states and 1451 transitions. [2025-02-05 15:44:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:44:19,868 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 137 [2025-02-05 15:44:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:19,875 INFO L225 Difference]: With dead ends: 968 [2025-02-05 15:44:19,875 INFO L226 Difference]: Without dead ends: 796 [2025-02-05 15:44:19,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:44:19,877 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 526 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:19,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 3215 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:44:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-02-05 15:44:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 735. [2025-02-05 15:44:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 563 states have (on average 1.5293072824156306) internal successors, (861), 571 states have internal predecessors, (861), 124 states have call successors, (124), 45 states have call predecessors, (124), 47 states have return successors, (135), 122 states have call predecessors, (135), 120 states have call successors, (135) [2025-02-05 15:44:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1120 transitions. [2025-02-05 15:44:19,931 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1120 transitions. Word has length 137 [2025-02-05 15:44:19,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:19,932 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1120 transitions. [2025-02-05 15:44:19,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1120 transitions. [2025-02-05 15:44:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:44:19,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:19,938 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:19,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:44:19,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:19,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:19,939 INFO L85 PathProgramCache]: Analyzing trace with hash 185727335, now seen corresponding path program 3 times [2025-02-05 15:44:19,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032011021] [2025-02-05 15:44:19,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:44:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:19,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 138 statements into 3 equivalence classes. [2025-02-05 15:44:19,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 126 of 138 statements. [2025-02-05 15:44:19,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:44:19,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:44:20,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:20,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032011021] [2025-02-05 15:44:20,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032011021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:20,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:20,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:20,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115291529] [2025-02-05 15:44:20,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:20,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:20,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:20,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:20,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:20,200 INFO L87 Difference]: Start difference. First operand 735 states and 1120 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:20,289 INFO L93 Difference]: Finished difference Result 1094 states and 1668 transitions. [2025-02-05 15:44:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:20,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 138 [2025-02-05 15:44:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:20,305 INFO L225 Difference]: With dead ends: 1094 [2025-02-05 15:44:20,305 INFO L226 Difference]: Without dead ends: 741 [2025-02-05 15:44:20,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:20,307 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 1 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1894 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:44:20,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1894 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-02-05 15:44:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 737. [2025-02-05 15:44:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 564 states have (on average 1.5283687943262412) internal successors, (862), 573 states have internal predecessors, (862), 124 states have call successors, (124), 45 states have call predecessors, (124), 48 states have return successors, (140), 122 states have call predecessors, (140), 120 states have call successors, (140) [2025-02-05 15:44:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1126 transitions. [2025-02-05 15:44:20,371 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1126 transitions. Word has length 138 [2025-02-05 15:44:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:20,372 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1126 transitions. [2025-02-05 15:44:20,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1126 transitions. [2025-02-05 15:44:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:44:20,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:20,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:20,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:44:20,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:20,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:20,380 INFO L85 PathProgramCache]: Analyzing trace with hash 400735475, now seen corresponding path program 1 times [2025-02-05 15:44:20,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:20,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600490389] [2025-02-05 15:44:20,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:20,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:44:20,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:44:20,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:20,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:44:20,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:20,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600490389] [2025-02-05 15:44:20,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600490389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:20,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:20,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:20,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782762984] [2025-02-05 15:44:20,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:20,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:20,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:20,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:20,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:20,660 INFO L87 Difference]: Start difference. First operand 737 states and 1126 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:20,754 INFO L93 Difference]: Finished difference Result 1453 states and 2223 transitions. [2025-02-05 15:44:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:20,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 138 [2025-02-05 15:44:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:20,767 INFO L225 Difference]: With dead ends: 1453 [2025-02-05 15:44:20,767 INFO L226 Difference]: Without dead ends: 739 [2025-02-05 15:44:20,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:20,773 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 1 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:20,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1908 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-02-05 15:44:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2025-02-05 15:44:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 565 states have (on average 1.527433628318584) internal successors, (863), 575 states have internal predecessors, (863), 124 states have call successors, (124), 45 states have call predecessors, (124), 49 states have return successors, (142), 122 states have call predecessors, (142), 120 states have call successors, (142) [2025-02-05 15:44:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1129 transitions. [2025-02-05 15:44:20,830 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1129 transitions. Word has length 138 [2025-02-05 15:44:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:20,830 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1129 transitions. [2025-02-05 15:44:20,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1129 transitions. [2025-02-05 15:44:20,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:44:20,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:20,837 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:20,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:44:20,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:20,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1170537122, now seen corresponding path program 1 times [2025-02-05 15:44:20,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:20,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144415658] [2025-02-05 15:44:20,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:20,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:44:20,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:44:20,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:20,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:44:21,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:21,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144415658] [2025-02-05 15:44:21,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144415658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:21,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:21,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:21,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615603483] [2025-02-05 15:44:21,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:21,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:21,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:21,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:21,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:21,081 INFO L87 Difference]: Start difference. First operand 739 states and 1129 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:21,178 INFO L93 Difference]: Finished difference Result 1455 states and 2226 transitions. [2025-02-05 15:44:21,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:21,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 139 [2025-02-05 15:44:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:21,188 INFO L225 Difference]: With dead ends: 1455 [2025-02-05 15:44:21,188 INFO L226 Difference]: Without dead ends: 741 [2025-02-05 15:44:21,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:21,190 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 0 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:21,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1901 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-02-05 15:44:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2025-02-05 15:44:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 565 states have (on average 1.527433628318584) internal successors, (863), 575 states have internal predecessors, (863), 124 states have call successors, (124), 45 states have call predecessors, (124), 49 states have return successors, (142), 122 states have call predecessors, (142), 120 states have call successors, (142) [2025-02-05 15:44:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1129 transitions. [2025-02-05 15:44:21,257 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1129 transitions. Word has length 139 [2025-02-05 15:44:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:21,257 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1129 transitions. [2025-02-05 15:44:21,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:44:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1129 transitions. [2025-02-05 15:44:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:44:21,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:21,268 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:21,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:44:21,269 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:21,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash 39750497, now seen corresponding path program 1 times [2025-02-05 15:44:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:21,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917498704] [2025-02-05 15:44:21,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:21,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:21,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:44:21,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:44:21,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:21,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:44:21,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:21,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917498704] [2025-02-05 15:44:21,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917498704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:21,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:21,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:44:21,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084994152] [2025-02-05 15:44:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:21,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:44:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:21,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:44:21,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:21,551 INFO L87 Difference]: Start difference. First operand 739 states and 1129 transitions. Second operand has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:44:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:21,717 INFO L93 Difference]: Finished difference Result 1094 states and 1669 transitions. [2025-02-05 15:44:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:44:21,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 139 [2025-02-05 15:44:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:21,721 INFO L225 Difference]: With dead ends: 1094 [2025-02-05 15:44:21,721 INFO L226 Difference]: Without dead ends: 384 [2025-02-05 15:44:21,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:44:21,723 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 7 mSDsluCounter, 2791 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3261 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:21,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3261 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:44:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-05 15:44:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-02-05 15:44:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 291 states have (on average 1.5120274914089347) internal successors, (440), 298 states have internal predecessors, (440), 66 states have call successors, (66), 24 states have call predecessors, (66), 26 states have return successors, (75), 63 states have call predecessors, (75), 63 states have call successors, (75) [2025-02-05 15:44:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 581 transitions. [2025-02-05 15:44:21,735 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 581 transitions. Word has length 139 [2025-02-05 15:44:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:21,736 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 581 transitions. [2025-02-05 15:44:21,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.428571428571429) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:44:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 581 transitions. [2025-02-05 15:44:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:44:21,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:21,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:21,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:44:21,738 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:21,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2112581978, now seen corresponding path program 1 times [2025-02-05 15:44:21,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:21,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905137093] [2025-02-05 15:44:21,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:21,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:21,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:44:21,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:44:21,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:21,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:21,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:21,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905137093] [2025-02-05 15:44:21,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905137093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:21,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002899869] [2025-02-05 15:44:21,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:21,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:21,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:21,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:44:21,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:44:21,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:44:22,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:44:22,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:22,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:22,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:44:22,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:22,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:44:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:22,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002899869] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:44:22,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:44:22,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:44:22,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031444258] [2025-02-05 15:44:22,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:44:22,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:44:22,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:22,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:44:22,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:44:22,164 INFO L87 Difference]: Start difference. First operand 384 states and 581 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 15:44:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:22,280 INFO L93 Difference]: Finished difference Result 888 states and 1395 transitions. [2025-02-05 15:44:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:44:22,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 140 [2025-02-05 15:44:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:22,292 INFO L225 Difference]: With dead ends: 888 [2025-02-05 15:44:22,293 INFO L226 Difference]: Without dead ends: 706 [2025-02-05 15:44:22,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:44:22,294 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 374 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:22,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 2649 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:44:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-02-05 15:44:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 682. [2025-02-05 15:44:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 525 states have (on average 1.5866666666666667) internal successors, (833), 532 states have internal predecessors, (833), 130 states have call successors, (130), 24 states have call predecessors, (130), 26 states have return successors, (149), 127 states have call predecessors, (149), 127 states have call successors, (149) [2025-02-05 15:44:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1112 transitions. [2025-02-05 15:44:22,319 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1112 transitions. Word has length 140 [2025-02-05 15:44:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:22,320 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1112 transitions. [2025-02-05 15:44:22,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 15:44:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1112 transitions. [2025-02-05 15:44:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:44:22,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:22,323 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:22,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:44:22,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 15:44:22,524 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:22,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1347692474, now seen corresponding path program 1 times [2025-02-05 15:44:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:22,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920938505] [2025-02-05 15:44:22,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:22,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:22,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:44:22,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:44:22,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:22,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:22,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920938505] [2025-02-05 15:44:22,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920938505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:22,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:22,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:22,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043562206] [2025-02-05 15:44:22,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:22,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:22,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:22,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:22,581 INFO L87 Difference]: Start difference. First operand 682 states and 1112 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:22,611 INFO L93 Difference]: Finished difference Result 1599 states and 2651 transitions. [2025-02-05 15:44:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:22,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-02-05 15:44:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:22,617 INFO L225 Difference]: With dead ends: 1599 [2025-02-05 15:44:22,617 INFO L226 Difference]: Without dead ends: 985 [2025-02-05 15:44:22,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:22,619 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 97 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:22,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 976 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-02-05 15:44:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 977. [2025-02-05 15:44:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 756 states have (on average 1.6044973544973544) internal successors, (1213), 763 states have internal predecessors, (1213), 194 states have call successors, (194), 24 states have call predecessors, (194), 26 states have return successors, (223), 191 states have call predecessors, (223), 191 states have call successors, (223) [2025-02-05 15:44:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1630 transitions. [2025-02-05 15:44:22,685 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1630 transitions. Word has length 146 [2025-02-05 15:44:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:22,685 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1630 transitions. [2025-02-05 15:44:22,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1630 transitions. [2025-02-05 15:44:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:44:22,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:22,732 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:22,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:44:22,732 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:22,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash -359787981, now seen corresponding path program 1 times [2025-02-05 15:44:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:22,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538548236] [2025-02-05 15:44:22,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:22,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:22,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:44:22,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:44:22,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:22,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:22,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:22,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538548236] [2025-02-05 15:44:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538548236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:22,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:22,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:22,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484192623] [2025-02-05 15:44:22,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:22,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:22,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:22,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:22,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:22,852 INFO L87 Difference]: Start difference. First operand 977 states and 1630 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:22,926 INFO L93 Difference]: Finished difference Result 2303 states and 3869 transitions. [2025-02-05 15:44:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:22,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-02-05 15:44:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:22,946 INFO L225 Difference]: With dead ends: 2303 [2025-02-05 15:44:22,946 INFO L226 Difference]: Without dead ends: 1445 [2025-02-05 15:44:22,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:22,953 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 95 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:22,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 966 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-02-05 15:44:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1437. [2025-02-05 15:44:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1121 states have (on average 1.616413916146298) internal successors, (1812), 1128 states have internal predecessors, (1812), 289 states have call successors, (289), 24 states have call predecessors, (289), 26 states have return successors, (318), 286 states have call predecessors, (318), 286 states have call successors, (318) [2025-02-05 15:44:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2419 transitions. [2025-02-05 15:44:23,013 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2419 transitions. Word has length 147 [2025-02-05 15:44:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:23,013 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2419 transitions. [2025-02-05 15:44:23,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2419 transitions. [2025-02-05 15:44:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:44:23,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:23,021 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:23,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:44:23,021 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:23,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1781561467, now seen corresponding path program 1 times [2025-02-05 15:44:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:23,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346801072] [2025-02-05 15:44:23,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:23,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:44:23,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:44:23,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:23,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346801072] [2025-02-05 15:44:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346801072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:23,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:23,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:23,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129289597] [2025-02-05 15:44:23,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:23,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:23,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:23,079 INFO L87 Difference]: Start difference. First operand 1437 states and 2419 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:23,128 INFO L93 Difference]: Finished difference Result 3332 states and 5658 transitions. [2025-02-05 15:44:23,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:23,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 148 [2025-02-05 15:44:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:23,140 INFO L225 Difference]: With dead ends: 3332 [2025-02-05 15:44:23,140 INFO L226 Difference]: Without dead ends: 2136 [2025-02-05 15:44:23,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:23,144 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 93 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:23,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 961 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2025-02-05 15:44:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2128. [2025-02-05 15:44:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 1689 states have (on average 1.625814091178212) internal successors, (2746), 1696 states have internal predecessors, (2746), 412 states have call successors, (412), 24 states have call predecessors, (412), 26 states have return successors, (457), 409 states have call predecessors, (457), 409 states have call successors, (457) [2025-02-05 15:44:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 3615 transitions. [2025-02-05 15:44:23,223 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 3615 transitions. Word has length 148 [2025-02-05 15:44:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:23,223 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 3615 transitions. [2025-02-05 15:44:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 3615 transitions. [2025-02-05 15:44:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:44:23,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:23,234 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:23,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:44:23,234 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:23,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1935756242, now seen corresponding path program 1 times [2025-02-05 15:44:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:23,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860400606] [2025-02-05 15:44:23,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:23,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:44:23,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:44:23,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:23,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:23,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:23,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860400606] [2025-02-05 15:44:23,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860400606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:23,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:23,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928238956] [2025-02-05 15:44:23,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:23,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:23,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:23,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:23,349 INFO L87 Difference]: Start difference. First operand 2128 states and 3615 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:23,506 INFO L93 Difference]: Finished difference Result 4920 states and 8424 transitions. [2025-02-05 15:44:23,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:23,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 149 [2025-02-05 15:44:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:23,541 INFO L225 Difference]: With dead ends: 4920 [2025-02-05 15:44:23,544 INFO L226 Difference]: Without dead ends: 3233 [2025-02-05 15:44:23,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:23,559 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 91 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:23,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 961 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:23,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2025-02-05 15:44:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3225. [2025-02-05 15:44:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3225 states, 2607 states have (on average 1.6321442270809359) internal successors, (4255), 2614 states have internal predecessors, (4255), 591 states have call successors, (591), 24 states have call predecessors, (591), 26 states have return successors, (662), 588 states have call predecessors, (662), 588 states have call successors, (662) [2025-02-05 15:44:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3225 states to 3225 states and 5508 transitions. [2025-02-05 15:44:23,753 INFO L78 Accepts]: Start accepts. Automaton has 3225 states and 5508 transitions. Word has length 149 [2025-02-05 15:44:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:23,754 INFO L471 AbstractCegarLoop]: Abstraction has 3225 states and 5508 transitions. [2025-02-05 15:44:23,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3225 states and 5508 transitions. [2025-02-05 15:44:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:44:23,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:23,770 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:23,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:44:23,771 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:23,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:23,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2119850980, now seen corresponding path program 1 times [2025-02-05 15:44:23,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:23,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711811406] [2025-02-05 15:44:23,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:23,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:44:23,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:44:23,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:23,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:23,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711811406] [2025-02-05 15:44:23,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711811406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:23,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:23,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:23,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181331074] [2025-02-05 15:44:23,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:23,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:23,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:23,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:23,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:23,834 INFO L87 Difference]: Start difference. First operand 3225 states and 5508 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:23,970 INFO L93 Difference]: Finished difference Result 7782 states and 13367 transitions. [2025-02-05 15:44:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:23,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 150 [2025-02-05 15:44:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:23,998 INFO L225 Difference]: With dead ends: 7782 [2025-02-05 15:44:23,998 INFO L226 Difference]: Without dead ends: 5225 [2025-02-05 15:44:24,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:24,010 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 89 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:24,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 987 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2025-02-05 15:44:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 5217. [2025-02-05 15:44:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5217 states, 4223 states have (on average 1.6263319914752545) internal successors, (6868), 4230 states have internal predecessors, (6868), 967 states have call successors, (967), 24 states have call predecessors, (967), 26 states have return successors, (1082), 964 states have call predecessors, (1082), 964 states have call successors, (1082) [2025-02-05 15:44:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5217 states to 5217 states and 8917 transitions. [2025-02-05 15:44:24,423 INFO L78 Accepts]: Start accepts. Automaton has 5217 states and 8917 transitions. Word has length 150 [2025-02-05 15:44:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:24,423 INFO L471 AbstractCegarLoop]: Abstraction has 5217 states and 8917 transitions. [2025-02-05 15:44:24,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5217 states and 8917 transitions. [2025-02-05 15:44:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:44:24,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:24,451 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:24,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:44:24,451 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:24,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:24,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1064554033, now seen corresponding path program 1 times [2025-02-05 15:44:24,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:24,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430227670] [2025-02-05 15:44:24,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:24,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:24,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:44:24,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:44:24,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:24,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:24,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:24,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430227670] [2025-02-05 15:44:24,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430227670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:24,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:24,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:24,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087470156] [2025-02-05 15:44:24,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:24,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:24,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:24,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:24,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:24,510 INFO L87 Difference]: Start difference. First operand 5217 states and 8917 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:24,717 INFO L93 Difference]: Finished difference Result 12819 states and 22060 transitions. [2025-02-05 15:44:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:24,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 151 [2025-02-05 15:44:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:24,766 INFO L225 Difference]: With dead ends: 12819 [2025-02-05 15:44:24,767 INFO L226 Difference]: Without dead ends: 8641 [2025-02-05 15:44:24,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:24,790 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 87 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:24,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 974 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8641 states. [2025-02-05 15:44:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8641 to 8633. [2025-02-05 15:44:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8633 states, 7033 states have (on average 1.6251955068960615) internal successors, (11430), 7040 states have internal predecessors, (11430), 1573 states have call successors, (1573), 24 states have call predecessors, (1573), 26 states have return successors, (1766), 1570 states have call predecessors, (1766), 1570 states have call successors, (1766) [2025-02-05 15:44:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8633 states to 8633 states and 14769 transitions. [2025-02-05 15:44:25,247 INFO L78 Accepts]: Start accepts. Automaton has 8633 states and 14769 transitions. Word has length 151 [2025-02-05 15:44:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:25,247 INFO L471 AbstractCegarLoop]: Abstraction has 8633 states and 14769 transitions. [2025-02-05 15:44:25,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8633 states and 14769 transitions. [2025-02-05 15:44:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 15:44:25,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:25,279 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 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:44:25,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:44:25,279 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash 315362333, now seen corresponding path program 1 times [2025-02-05 15:44:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047663781] [2025-02-05 15:44:25,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:25,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:44:25,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:44:25,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:25,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:25,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:25,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047663781] [2025-02-05 15:44:25,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047663781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:25,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:25,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:25,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490001872] [2025-02-05 15:44:25,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:25,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:25,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:25,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:25,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:25,330 INFO L87 Difference]: Start difference. First operand 8633 states and 14769 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:25,636 INFO L93 Difference]: Finished difference Result 22276 states and 38283 transitions. [2025-02-05 15:44:25,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:25,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 152 [2025-02-05 15:44:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:25,693 INFO L225 Difference]: With dead ends: 22276 [2025-02-05 15:44:25,693 INFO L226 Difference]: Without dead ends: 15097 [2025-02-05 15:44:25,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:25,719 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 85 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:25,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 986 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15097 states. [2025-02-05 15:44:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15097 to 15089. [2025-02-05 15:44:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15089 states, 12286 states have (on average 1.6163926420315806) internal successors, (19859), 12293 states have internal predecessors, (19859), 2776 states have call successors, (2776), 24 states have call predecessors, (2776), 26 states have return successors, (3113), 2773 states have call predecessors, (3113), 2773 states have call successors, (3113) [2025-02-05 15:44:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15089 states to 15089 states and 25748 transitions. [2025-02-05 15:44:26,263 INFO L78 Accepts]: Start accepts. Automaton has 15089 states and 25748 transitions. Word has length 152 [2025-02-05 15:44:26,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:26,263 INFO L471 AbstractCegarLoop]: Abstraction has 15089 states and 25748 transitions. [2025-02-05 15:44:26,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:26,264 INFO L276 IsEmpty]: Start isEmpty. Operand 15089 states and 25748 transitions. [2025-02-05 15:44:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 15:44:26,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:26,304 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 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:44:26,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:44:26,305 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:26,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:26,305 INFO L85 PathProgramCache]: Analyzing trace with hash 821272528, now seen corresponding path program 1 times [2025-02-05 15:44:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:26,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779485326] [2025-02-05 15:44:26,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:26,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:26,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:44:26,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:44:26,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:26,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779485326] [2025-02-05 15:44:26,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779485326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:26,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:26,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:26,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442171299] [2025-02-05 15:44:26,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:26,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:26,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:26,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:26,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:26,354 INFO L87 Difference]: Start difference. First operand 15089 states and 25748 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:26,861 INFO L93 Difference]: Finished difference Result 39837 states and 68331 transitions. [2025-02-05 15:44:26,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:26,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 153 [2025-02-05 15:44:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:26,955 INFO L225 Difference]: With dead ends: 39837 [2025-02-05 15:44:26,956 INFO L226 Difference]: Without dead ends: 26801 [2025-02-05 15:44:27,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:27,151 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 83 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:27,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 964 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26801 states. [2025-02-05 15:44:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26801 to 26793. [2025-02-05 15:44:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26793 states, 21951 states have (on average 1.6127283495057172) internal successors, (35401), 21958 states have internal predecessors, (35401), 4815 states have call successors, (4815), 24 states have call predecessors, (4815), 26 states have return successors, (5426), 4812 states have call predecessors, (5426), 4812 states have call successors, (5426) [2025-02-05 15:44:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26793 states to 26793 states and 45642 transitions. [2025-02-05 15:44:28,269 INFO L78 Accepts]: Start accepts. Automaton has 26793 states and 45642 transitions. Word has length 153 [2025-02-05 15:44:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:28,269 INFO L471 AbstractCegarLoop]: Abstraction has 26793 states and 45642 transitions. [2025-02-05 15:44:28,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 26793 states and 45642 transitions. [2025-02-05 15:44:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 15:44:28,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:28,323 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 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:44:28,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:44:28,324 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:28,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash 816017662, now seen corresponding path program 1 times [2025-02-05 15:44:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672225082] [2025-02-05 15:44:28,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:28,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 15:44:28,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 15:44:28,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:28,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:28,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:28,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672225082] [2025-02-05 15:44:28,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672225082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:28,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:28,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:28,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442622256] [2025-02-05 15:44:28,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:28,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:28,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:28,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:28,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:28,371 INFO L87 Difference]: Start difference. First operand 26793 states and 45642 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:29,358 INFO L93 Difference]: Finished difference Result 72844 states and 124618 transitions. [2025-02-05 15:44:29,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:29,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 154 [2025-02-05 15:44:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:29,540 INFO L225 Difference]: With dead ends: 72844 [2025-02-05 15:44:29,540 INFO L226 Difference]: Without dead ends: 48827 [2025-02-05 15:44:29,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:29,597 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 81 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:29,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 966 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48827 states. [2025-02-05 15:44:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48827 to 48819. [2025-02-05 15:44:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48819 states, 40262 states have (on average 1.607446227211763) internal successors, (64719), 40269 states have internal predecessors, (64719), 8530 states have call successors, (8530), 24 states have call predecessors, (8530), 26 states have return successors, (9673), 8527 states have call predecessors, (9673), 8527 states have call successors, (9673) [2025-02-05 15:44:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48819 states to 48819 states and 82922 transitions. [2025-02-05 15:44:31,174 INFO L78 Accepts]: Start accepts. Automaton has 48819 states and 82922 transitions. Word has length 154 [2025-02-05 15:44:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:31,175 INFO L471 AbstractCegarLoop]: Abstraction has 48819 states and 82922 transitions. [2025-02-05 15:44:31,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 48819 states and 82922 transitions. [2025-02-05 15:44:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 15:44:31,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:31,248 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 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:44:31,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:44:31,249 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:31,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2075375823, now seen corresponding path program 1 times [2025-02-05 15:44:31,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:31,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627246302] [2025-02-05 15:44:31,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:31,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:31,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 15:44:31,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 15:44:31,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:31,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:31,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627246302] [2025-02-05 15:44:31,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627246302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:31,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908911394] [2025-02-05 15:44:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:31,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:31,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:31,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:31,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:31,310 INFO L87 Difference]: Start difference. First operand 48819 states and 82922 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:33,160 INFO L93 Difference]: Finished difference Result 90820 states and 154670 transitions. [2025-02-05 15:44:33,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:33,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 155 [2025-02-05 15:44:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:33,491 INFO L225 Difference]: With dead ends: 90820 [2025-02-05 15:44:33,491 INFO L226 Difference]: Without dead ends: 90638 [2025-02-05 15:44:33,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:33,536 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 76 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:33,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 970 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90638 states. [2025-02-05 15:44:36,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90638 to 90630. [2025-02-05 15:44:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90630 states, 75274 states have (on average 1.6004463692642878) internal successors, (120472), 75281 states have internal predecessors, (120472), 15329 states have call successors, (15329), 24 states have call predecessors, (15329), 26 states have return successors, (17518), 15326 states have call predecessors, (17518), 15326 states have call successors, (17518) [2025-02-05 15:44:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90630 states to 90630 states and 153319 transitions. [2025-02-05 15:44:36,622 INFO L78 Accepts]: Start accepts. Automaton has 90630 states and 153319 transitions. Word has length 155 [2025-02-05 15:44:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:36,622 INFO L471 AbstractCegarLoop]: Abstraction has 90630 states and 153319 transitions. [2025-02-05 15:44:36,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:44:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 90630 states and 153319 transitions. [2025-02-05 15:44:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 15:44:36,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:36,944 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 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:44:36,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:44:36,945 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:36,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash 886089247, now seen corresponding path program 1 times [2025-02-05 15:44:36,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:36,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962247881] [2025-02-05 15:44:36,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:36,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:36,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 15:44:36,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 15:44:36,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:36,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:44:37,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:37,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962247881] [2025-02-05 15:44:37,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962247881] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:37,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997633823] [2025-02-05 15:44:37,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:37,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:37,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:37,203 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:44:37,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:44:37,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 15:44:37,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 15:44:37,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:37,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:37,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:44:37,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:37,710 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:44:37,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:44:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:44:38,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997633823] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:44:38,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:44:38,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2025-02-05 15:44:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14652930] [2025-02-05 15:44:38,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:44:38,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 15:44:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:38,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 15:44:38,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2025-02-05 15:44:38,099 INFO L87 Difference]: Start difference. First operand 90630 states and 153319 transitions. Second operand has 27 states, 26 states have (on average 9.307692307692308) internal successors, (242), 23 states have internal predecessors, (242), 9 states have call successors, (47), 8 states have call predecessors, (47), 11 states have return successors, (41), 11 states have call predecessors, (41), 9 states have call successors, (41) [2025-02-05 15:44:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:51,607 INFO L93 Difference]: Finished difference Result 361512 states and 635513 transitions. [2025-02-05 15:44:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-02-05 15:44:51,611 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 9.307692307692308) internal successors, (242), 23 states have internal predecessors, (242), 9 states have call successors, (47), 8 states have call predecessors, (47), 11 states have return successors, (41), 11 states have call predecessors, (41), 9 states have call successors, (41) Word has length 156 [2025-02-05 15:44:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:54,145 INFO L225 Difference]: With dead ends: 361512 [2025-02-05 15:44:54,146 INFO L226 Difference]: Without dead ends: 361336 [2025-02-05 15:44:54,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1172, Invalid=8728, Unknown=0, NotChecked=0, Total=9900 [2025-02-05 15:44:54,396 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 6662 mSDsluCounter, 4394 mSDsCounter, 0 mSdLazyCounter, 9743 mSolverCounterSat, 2129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6711 SdHoareTripleChecker+Valid, 4618 SdHoareTripleChecker+Invalid, 11872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2129 IncrementalHoareTripleChecker+Valid, 9743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:54,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6711 Valid, 4618 Invalid, 11872 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2129 Valid, 9743 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 15:44:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361336 states.