./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec7_productSimulator.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_spec7_productSimulator.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 1d8908adfa5a1758f016a2fa64af2c05db2b3cc5d1fb9ac5b8aa70e5689b8434 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:47:50,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:47:51,026 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:47:51,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:47:51,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:47:51,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:47:51,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:47:51,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:47:51,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:47:51,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:47:51,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:47:51,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:47:51,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:47:51,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:47:51,046 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:47:51,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:47:51,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:47:51,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:47:51,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:47:51,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:47:51,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:47:51,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:47:51,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:47:51,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:47:51,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:47:51,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:47:51,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:47:51,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:47:51,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:47:51,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:47:51,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:47:51,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:47:51,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:47:51,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:47:51,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:47:51,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:47:51,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:47:51,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:47:51,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:47:51,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:47:51,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:47:51,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:47:51,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:47:51,049 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 -> 1d8908adfa5a1758f016a2fa64af2c05db2b3cc5d1fb9ac5b8aa70e5689b8434 [2025-02-05 15:47:51,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:47:51,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:47:51,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:47:51,285 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:47:51,285 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:47:51,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec7_productSimulator.cil.c [2025-02-05 15:47:52,494 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e3b13d65/356de09288a04e39a7b6d6588c1183b5/FLAGe977eb2d0 [2025-02-05 15:47:52,914 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:47:52,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_productSimulator.cil.c [2025-02-05 15:47:52,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e3b13d65/356de09288a04e39a7b6d6588c1183b5/FLAGe977eb2d0 [2025-02-05 15:47:53,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e3b13d65/356de09288a04e39a7b6d6588c1183b5 [2025-02-05 15:47:53,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:47:53,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:47:53,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:47:53,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:47:53,087 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:47:53,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74781be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53, skipping insertion in model container [2025-02-05 15:47:53,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:47:53,429 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_spec7_productSimulator.cil.c[72622,72635] [2025-02-05 15:47:53,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:47:53,440 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:47:53,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2025-02-05 15:47:53,446 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [642] [2025-02-05 15:47:53,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1041] [2025-02-05 15:47:53,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [1416] [2025-02-05 15:47:53,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1435] [2025-02-05 15:47:53,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1639] [2025-02-05 15:47:53,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2699] [2025-02-05 15:47:53,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2965] [2025-02-05 15:47:53,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [3072] [2025-02-05 15:47:53,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3089] [2025-02-05 15:47:53,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3455] [2025-02-05 15:47:53,521 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_spec7_productSimulator.cil.c[72622,72635] [2025-02-05 15:47:53,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:47:53,546 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:47:53,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53 WrapperNode [2025-02-05 15:47:53,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:47:53,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:47:53,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:47:53,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:47:53,553 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:47:53" (1/1) ... [2025-02-05 15:47:53,571 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:47:53" (1/1) ... [2025-02-05 15:47:53,607 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1303 [2025-02-05 15:47:53,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:47:53,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:47:53,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:47:53,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:47:53,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,644 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:47:53,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:47:53,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:47:53,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:47:53,668 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:47:53,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (1/1) ... [2025-02-05 15:47:53,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:47:53,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:53,692 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:47:53,696 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:47:53,711 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:47:53,712 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:47:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-02-05 15:47:53,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-02-05 15:47:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-02-05 15:47:53,712 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-02-05 15:47:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:47:53,712 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:47:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:47:53,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:47:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:47:53,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:47:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:47:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:47:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-02-05 15:47:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-02-05 15:47:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:47:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:47:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-02-05 15:47:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-02-05 15:47:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:47:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:47:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:47:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-02-05 15:47:53,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:47:53,714 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:47:53,715 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:47:53,717 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:47:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:47:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:47:53,719 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-02-05 15:47:53,719 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-02-05 15:47:53,719 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-02-05 15:47:53,719 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-02-05 15:47:53,719 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:47:53,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:47:53,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:47:53,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:47:53,885 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:47:53,887 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:47:53,909 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1574: #res := ~retValue_acc~17; [2025-02-05 15:47:53,917 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L948: #res := ~retValue_acc~13; [2025-02-05 15:47:53,926 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L522: #res := ~retValue_acc~4; [2025-02-05 15:47:53,938 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2241: #res := ~retValue_acc~31; [2025-02-05 15:47:53,999 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1785: #res := ~retValue_acc~25; [2025-02-05 15:47:54,046 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L685-1: getEmailId_#res#1 := getEmailId_~retValue_acc~6#1; [2025-02-05 15:47:54,083 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L911: #res := ~retValue_acc~12; [2025-02-05 15:47:54,098 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L759: #res := ~retValue_acc~8; [2025-02-05 15:47:54,140 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1594-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~18#1; [2025-02-05 15:47:54,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1612: #res#1 := ~retValue_acc~19#1; [2025-02-05 15:47:54,199 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2333: #res#1 := ~retValue_acc~33#1; [2025-02-05 15:47:54,200 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~32#1; [2025-02-05 15:47:54,249 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2557: #res := ~retValue_acc~36; [2025-02-05 15:47:54,258 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636-1: createEmail_#res#1 := createEmail_~retValue_acc~21#1; [2025-02-05 15:47:54,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L874: #res := ~retValue_acc~11; [2025-02-05 15:47:54,293 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676-1: getClientId_#res#1 := getClientId_~retValue_acc~38#1; [2025-02-05 15:47:54,329 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1022-1: isVerified_#res#1 := isVerified_~retValue_acc~15#1; [2025-02-05 15:47:54,330 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2629-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~37#1; [2025-02-05 15:47:54,334 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L985: #res := ~retValue_acc~14; [2025-02-05 15:47:54,354 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: #res := ~retValue_acc~39; [2025-02-05 15:47:54,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2111: #res := ~retValue_acc~29; [2025-02-05 15:47:54,421 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2194-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~30#1; [2025-02-05 15:47:54,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L488-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~2#1; [2025-02-05 15:47:54,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2503-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~35#1; [2025-02-05 15:47:54,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3069-1: valid_product_#res#1 := valid_product_~retValue_acc~40#1; [2025-02-05 15:47:54,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L479-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~1#1; [2025-02-05 15:47:54,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2396-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~34#1; [2025-02-05 15:47:54,638 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L497-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~3#1; [2025-02-05 15:47:54,643 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: #res := ~retValue_acc~7; [2025-02-05 15:47:54,804 INFO L? ?]: Removed 623 outVars from TransFormulas that were not future-live. [2025-02-05 15:47:54,804 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:47:54,819 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:47:54,820 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:47:54,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:47:54 BoogieIcfgContainer [2025-02-05 15:47:54,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:47:54,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:47:54,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:47:54,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:47:54,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:47:53" (1/3) ... [2025-02-05 15:47:54,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605bc44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:47:54, skipping insertion in model container [2025-02-05 15:47:54,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:53" (2/3) ... [2025-02-05 15:47:54,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605bc44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:47:54, skipping insertion in model container [2025-02-05 15:47:54,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:47:54" (3/3) ... [2025-02-05 15:47:54,826 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec7_productSimulator.cil.c [2025-02-05 15:47:54,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:47:54,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec7_productSimulator.cil.c that has 44 procedures, 599 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:47:54,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:47:54,896 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;@7ef3f65b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:47:54,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:47:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 15:47:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:47:54,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:54,916 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:54,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:54,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash -615627010, now seen corresponding path program 1 times [2025-02-05 15:47:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569447188] [2025-02-05 15:47:54,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:55,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:47:55,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:47:55,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:55,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:47:55,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:55,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569447188] [2025-02-05 15:47:55,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569447188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:55,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:55,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:47:55,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733461541] [2025-02-05 15:47:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:55,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:47:55,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:55,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:47:55,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:47:55,288 INFO L87 Difference]: Start difference. First operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:47:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:55,352 INFO L93 Difference]: Finished difference Result 930 states and 1367 transitions. [2025-02-05 15:47:55,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:47:55,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 148 [2025-02-05 15:47:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:55,362 INFO L225 Difference]: With dead ends: 930 [2025-02-05 15:47:55,363 INFO L226 Difference]: Without dead ends: 592 [2025-02-05 15:47:55,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:47:55,368 INFO L435 NwaCegarLoop]: 889 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, 889 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:47:55,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-05 15:47:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-02-05 15:47:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.5125284738041003) internal successors, (664), 458 states have internal predecessors, (664), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 15:47:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 881 transitions. [2025-02-05 15:47:55,419 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 881 transitions. Word has length 148 [2025-02-05 15:47:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:55,420 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 881 transitions. [2025-02-05 15:47:55,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:47:55,420 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 881 transitions. [2025-02-05 15:47:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:47:55,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:55,425 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:55,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:47:55,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:55,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash -183618343, now seen corresponding path program 1 times [2025-02-05 15:47:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:55,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934317538] [2025-02-05 15:47:55,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:55,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:55,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:47:55,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:47:55,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:55,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:47:55,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:55,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934317538] [2025-02-05 15:47:55,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934317538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:55,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:55,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:47:55,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095454671] [2025-02-05 15:47:55,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:55,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:47:55,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:55,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:47:55,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:47:55,783 INFO L87 Difference]: Start difference. First operand 592 states and 881 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:47:55,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:55,855 INFO L93 Difference]: Finished difference Result 1148 states and 1706 transitions. [2025-02-05 15:47:55,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:47:55,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 149 [2025-02-05 15:47:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:55,862 INFO L225 Difference]: With dead ends: 1148 [2025-02-05 15:47:55,862 INFO L226 Difference]: Without dead ends: 592 [2025-02-05 15:47:55,865 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:47:55,865 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 0 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:55,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-05 15:47:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-02-05 15:47:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.4965831435079726) internal successors, (657), 458 states have internal predecessors, (657), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 15:47:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 874 transitions. [2025-02-05 15:47:55,888 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 874 transitions. Word has length 149 [2025-02-05 15:47:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:55,889 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 874 transitions. [2025-02-05 15:47:55,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:47:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 874 transitions. [2025-02-05 15:47:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 15:47:55,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:55,891 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:55,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:47:55,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:55,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1054715547, now seen corresponding path program 1 times [2025-02-05 15:47:55,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:55,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887633164] [2025-02-05 15:47:55,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:55,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:55,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 15:47:55,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 15:47:55,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:55,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:47:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887633164] [2025-02-05 15:47:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887633164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758788733] [2025-02-05 15:47:56,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:56,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:56,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:56,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:56,074 INFO L87 Difference]: Start difference. First operand 592 states and 874 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-05 15:47:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:56,136 INFO L93 Difference]: Finished difference Result 1152 states and 1714 transitions. [2025-02-05 15:47:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:56,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 154 [2025-02-05 15:47:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:56,143 INFO L225 Difference]: With dead ends: 1152 [2025-02-05 15:47:56,143 INFO L226 Difference]: Without dead ends: 593 [2025-02-05 15:47:56,145 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:47:56,146 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 836 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:56,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 889 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-05 15:47:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-02-05 15:47:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 441 states have (on average 1.4875283446712018) internal successors, (656), 458 states have internal predecessors, (656), 107 states have call successors, (107), 44 states have call predecessors, (107), 44 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-05 15:47:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 869 transitions. [2025-02-05 15:47:56,197 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 869 transitions. Word has length 154 [2025-02-05 15:47:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:56,199 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 869 transitions. [2025-02-05 15:47:56,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-05 15:47:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 869 transitions. [2025-02-05 15:47:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:47:56,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:56,201 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:47:56,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:56,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1174805882, now seen corresponding path program 1 times [2025-02-05 15:47:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:56,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107073439] [2025-02-05 15:47:56,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:56,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:56,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:47:56,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:47:56,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:56,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:47:56,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107073439] [2025-02-05 15:47:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107073439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:56,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:56,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427228612] [2025-02-05 15:47:56,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:56,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:56,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:56,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:56,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:56,343 INFO L87 Difference]: Start difference. First operand 593 states and 869 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 15:47:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:56,431 INFO L93 Difference]: Finished difference Result 1691 states and 2514 transitions. [2025-02-05 15:47:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2025-02-05 15:47:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:56,443 INFO L225 Difference]: With dead ends: 1691 [2025-02-05 15:47:56,443 INFO L226 Difference]: Without dead ends: 1132 [2025-02-05 15:47:56,446 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:47:56,448 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 824 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:56,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1709 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-02-05 15:47:56,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1130. [2025-02-05 15:47:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 843 states have (on average 1.4946619217081851) internal successors, (1260), 873 states have internal predecessors, (1260), 199 states have call successors, (199), 87 states have call predecessors, (199), 87 states have return successors, (210), 196 states have call predecessors, (210), 197 states have call successors, (210) [2025-02-05 15:47:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1669 transitions. [2025-02-05 15:47:56,525 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1669 transitions. Word has length 148 [2025-02-05 15:47:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:56,525 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1669 transitions. [2025-02-05 15:47:56,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 15:47:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1669 transitions. [2025-02-05 15:47:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 15:47:56,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:56,532 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:47:56,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:56,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1407120315, now seen corresponding path program 1 times [2025-02-05 15:47:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:56,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411764427] [2025-02-05 15:47:56,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:56,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 15:47:56,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 15:47:56,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:56,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:47:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411764427] [2025-02-05 15:47:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411764427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:56,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:56,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:56,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008562111] [2025-02-05 15:47:56,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:56,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:56,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:56,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:56,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:56,633 INFO L87 Difference]: Start difference. First operand 1130 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:47:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:56,672 INFO L93 Difference]: Finished difference Result 1132 states and 1670 transitions. [2025-02-05 15:47:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:56,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 156 [2025-02-05 15:47:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:56,678 INFO L225 Difference]: With dead ends: 1132 [2025-02-05 15:47:56,678 INFO L226 Difference]: Without dead ends: 594 [2025-02-05 15:47:56,679 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:47:56,680 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 816 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:56,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 892 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-02-05 15:47:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-02-05 15:47:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 443 states have (on average 1.4762979683972912) internal successors, (654), 458 states have internal predecessors, (654), 105 states have call successors, (105), 45 states have call predecessors, (105), 45 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-02-05 15:47:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 863 transitions. [2025-02-05 15:47:56,731 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 863 transitions. Word has length 156 [2025-02-05 15:47:56,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:56,732 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 863 transitions. [2025-02-05 15:47:56,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:47:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 863 transitions. [2025-02-05 15:47:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 15:47:56,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:56,734 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:47:56,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:47:56,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:56,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash 139293321, now seen corresponding path program 1 times [2025-02-05 15:47:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:56,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393940937] [2025-02-05 15:47:56,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:56,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:56,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 15:47:56,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 15:47:56,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:56,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 15:47:56,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:56,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393940937] [2025-02-05 15:47:56,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393940937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:56,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:56,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:56,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152140278] [2025-02-05 15:47:56,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:56,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:56,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:56,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:56,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:56,850 INFO L87 Difference]: Start difference. First operand 594 states and 863 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:47:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:56,911 INFO L93 Difference]: Finished difference Result 1142 states and 1666 transitions. [2025-02-05 15:47:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:56,912 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 165 [2025-02-05 15:47:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:56,915 INFO L225 Difference]: With dead ends: 1142 [2025-02-05 15:47:56,915 INFO L226 Difference]: Without dead ends: 597 [2025-02-05 15:47:56,917 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:47:56,918 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 798 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:56,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 877 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-02-05 15:47:56,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 591. [2025-02-05 15:47:56,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 443 states have (on average 1.4514672686230248) internal successors, (643), 453 states have internal predecessors, (643), 102 states have call successors, (102), 45 states have call predecessors, (102), 45 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-02-05 15:47:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 846 transitions. [2025-02-05 15:47:56,952 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 846 transitions. Word has length 165 [2025-02-05 15:47:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:56,952 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 846 transitions. [2025-02-05 15:47:56,952 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, (28), 2 states have call predecessors, (28), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:47:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 846 transitions. [2025-02-05 15:47:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 15:47:56,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:56,954 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:47:56,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:56,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1012825353, now seen corresponding path program 1 times [2025-02-05 15:47:56,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:56,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827973514] [2025-02-05 15:47:56,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:56,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 15:47:56,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 15:47:56,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:56,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 15:47:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827973514] [2025-02-05 15:47:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827973514] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638656000] [2025-02-05 15:47:57,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:57,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:57,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:57,236 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:47:57,241 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:47:57,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 15:47:57,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 15:47:57,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:57,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:57,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:47:57,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:47:57,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638656000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:57,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:57,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:47:57,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768539116] [2025-02-05 15:47:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:57,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:57,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:57,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:47:57,607 INFO L87 Difference]: Start difference. First operand 591 states and 846 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:47:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:57,646 INFO L93 Difference]: Finished difference Result 914 states and 1291 transitions. [2025-02-05 15:47:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:57,646 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 176 [2025-02-05 15:47:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:57,650 INFO L225 Difference]: With dead ends: 914 [2025-02-05 15:47:57,650 INFO L226 Difference]: Without dead ends: 593 [2025-02-05 15:47:57,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:47:57,652 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 0 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1680 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:47:57,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1680 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-05 15:47:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-02-05 15:47:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 445 states have (on average 1.449438202247191) internal successors, (645), 455 states have internal predecessors, (645), 102 states have call successors, (102), 45 states have call predecessors, (102), 45 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-02-05 15:47:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 848 transitions. [2025-02-05 15:47:57,678 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 848 transitions. Word has length 176 [2025-02-05 15:47:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:57,679 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 848 transitions. [2025-02-05 15:47:57,679 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:47:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 848 transitions. [2025-02-05 15:47:57,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 15:47:57,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:57,681 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:57,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:47:57,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:57,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:57,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:57,883 INFO L85 PathProgramCache]: Analyzing trace with hash 732654666, now seen corresponding path program 1 times [2025-02-05 15:47:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:57,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482620764] [2025-02-05 15:47:57,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:57,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 15:47:57,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 15:47:57,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:57,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:47:58,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482620764] [2025-02-05 15:47:58,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482620764] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709883474] [2025-02-05 15:47:58,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:58,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:58,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:58,176 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:47:58,177 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:47:58,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 15:47:58,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 15:47:58,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:58,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:58,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:47:58,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:47:58,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:58,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709883474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:58,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:58,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:47:58,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178160446] [2025-02-05 15:47:58,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:58,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:58,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:58,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:58,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:47:58,531 INFO L87 Difference]: Start difference. First operand 593 states and 848 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-05 15:47:58,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:58,572 INFO L93 Difference]: Finished difference Result 1202 states and 1754 transitions. [2025-02-05 15:47:58,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:58,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2025-02-05 15:47:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:58,577 INFO L225 Difference]: With dead ends: 1202 [2025-02-05 15:47:58,577 INFO L226 Difference]: Without dead ends: 690 [2025-02-05 15:47:58,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:47:58,579 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 165 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1641 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:47:58,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1641 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-02-05 15:47:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 682. [2025-02-05 15:47:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 520 states have (on average 1.4653846153846153) internal successors, (762), 530 states have internal predecessors, (762), 116 states have call successors, (116), 45 states have call predecessors, (116), 45 states have return successors, (115), 114 states have call predecessors, (115), 115 states have call successors, (115) [2025-02-05 15:47:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 993 transitions. [2025-02-05 15:47:58,625 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 993 transitions. Word has length 190 [2025-02-05 15:47:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:58,625 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 993 transitions. [2025-02-05 15:47:58,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-05 15:47:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 993 transitions. [2025-02-05 15:47:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 15:47:58,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:58,628 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:58,639 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:47:58,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:58,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:58,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash -809336047, now seen corresponding path program 1 times [2025-02-05 15:47:58,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:58,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411668107] [2025-02-05 15:47:58,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:58,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:58,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 15:47:58,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 15:47:58,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:58,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:47:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411668107] [2025-02-05 15:47:59,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411668107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:59,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486681948] [2025-02-05 15:47:59,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:59,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:59,071 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:47:59,073 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:47:59,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 15:47:59,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 15:47:59,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:59,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:59,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1477 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:47:59,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:47:59,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486681948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:59,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:59,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:47:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923367555] [2025-02-05 15:47:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:59,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:59,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:59,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:47:59,714 INFO L87 Difference]: Start difference. First operand 682 states and 993 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-02-05 15:47:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:59,889 INFO L93 Difference]: Finished difference Result 1628 states and 2370 transitions. [2025-02-05 15:47:59,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:59,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 191 [2025-02-05 15:47:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:59,898 INFO L225 Difference]: With dead ends: 1628 [2025-02-05 15:47:59,898 INFO L226 Difference]: Without dead ends: 1315 [2025-02-05 15:47:59,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:47:59,900 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 708 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:59,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1662 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2025-02-05 15:47:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1313. [2025-02-05 15:47:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1009 states have (on average 1.4737363726461843) internal successors, (1487), 1026 states have internal predecessors, (1487), 216 states have call successors, (216), 87 states have call predecessors, (216), 87 states have return successors, (223), 212 states have call predecessors, (223), 214 states have call successors, (223) [2025-02-05 15:47:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1926 transitions. [2025-02-05 15:47:59,956 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1926 transitions. Word has length 191 [2025-02-05 15:47:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:59,956 INFO L471 AbstractCegarLoop]: Abstraction has 1313 states and 1926 transitions. [2025-02-05 15:47:59,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-02-05 15:47:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1926 transitions. [2025-02-05 15:47:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-05 15:47:59,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:59,960 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:47:59,971 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:48:00,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:00,161 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:00,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:00,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1986031801, now seen corresponding path program 1 times [2025-02-05 15:48:00,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:00,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818910545] [2025-02-05 15:48:00,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:00,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-05 15:48:00,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-05 15:48:00,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:00,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-05 15:48:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818910545] [2025-02-05 15:48:00,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818910545] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806315389] [2025-02-05 15:48:00,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:00,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:00,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:00,394 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:48:00,395 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:48:00,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-05 15:48:00,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-05 15:48:00,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:00,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:00,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:48:00,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 15:48:00,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:00,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806315389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:00,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:00,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-02-05 15:48:00,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352319212] [2025-02-05 15:48:00,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:00,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:48:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:00,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:48:00,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:48:00,802 INFO L87 Difference]: Start difference. First operand 1313 states and 1926 transitions. Second operand has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:48:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:00,952 INFO L93 Difference]: Finished difference Result 2547 states and 3762 transitions. [2025-02-05 15:48:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:48:00,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2025-02-05 15:48:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:00,960 INFO L225 Difference]: With dead ends: 2547 [2025-02-05 15:48:00,961 INFO L226 Difference]: Without dead ends: 1317 [2025-02-05 15:48:00,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:48:00,965 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 4 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5800 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:00,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5800 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:48:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2025-02-05 15:48:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2025-02-05 15:48:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1011 states have (on average 1.4727992087042532) internal successors, (1489), 1030 states have internal predecessors, (1489), 216 states have call successors, (216), 87 states have call predecessors, (216), 89 states have return successors, (227), 212 states have call predecessors, (227), 214 states have call successors, (227) [2025-02-05 15:48:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1932 transitions. [2025-02-05 15:48:01,033 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1932 transitions. Word has length 184 [2025-02-05 15:48:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:01,033 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1932 transitions. [2025-02-05 15:48:01,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:48:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1932 transitions. [2025-02-05 15:48:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-05 15:48:01,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:01,039 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:01,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:01,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:48:01,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:01,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1877715948, now seen corresponding path program 1 times [2025-02-05 15:48:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161069410] [2025-02-05 15:48:01,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:01,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-05 15:48:01,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-05 15:48:01,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:01,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 15:48:01,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:01,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161069410] [2025-02-05 15:48:01,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161069410] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:01,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017388268] [2025-02-05 15:48:01,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:01,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:01,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:01,468 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:48:01,470 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:48:01,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-05 15:48:01,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-05 15:48:01,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:01,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:01,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:48:01,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 15:48:01,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:01,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017388268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:01,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:01,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 15:48:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449470922] [2025-02-05 15:48:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:01,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:48:01,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:01,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:48:01,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:48:01,839 INFO L87 Difference]: Start difference. First operand 1317 states and 1932 transitions. Second operand has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:48:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:01,932 INFO L93 Difference]: Finished difference Result 2549 states and 3770 transitions. [2025-02-05 15:48:01,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:48:01,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 185 [2025-02-05 15:48:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:01,939 INFO L225 Difference]: With dead ends: 2549 [2025-02-05 15:48:01,940 INFO L226 Difference]: Without dead ends: 1321 [2025-02-05 15:48:01,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:48:01,944 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 2 mSDsluCounter, 3307 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4138 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:01,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4138 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:01,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-02-05 15:48:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2025-02-05 15:48:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1013 states have (on average 1.4718657453109576) internal successors, (1491), 1034 states have internal predecessors, (1491), 216 states have call successors, (216), 87 states have call predecessors, (216), 91 states have return successors, (237), 212 states have call predecessors, (237), 214 states have call successors, (237) [2025-02-05 15:48:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1944 transitions. [2025-02-05 15:48:02,027 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1944 transitions. Word has length 185 [2025-02-05 15:48:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:02,027 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1944 transitions. [2025-02-05 15:48:02,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:48:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1944 transitions. [2025-02-05 15:48:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-05 15:48:02,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:02,033 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:02,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:02,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:48:02,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:02,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:02,238 INFO L85 PathProgramCache]: Analyzing trace with hash -232624853, now seen corresponding path program 1 times [2025-02-05 15:48:02,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:02,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217294412] [2025-02-05 15:48:02,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:02,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:02,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 15:48:02,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 15:48:02,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:02,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-05 15:48:02,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:02,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217294412] [2025-02-05 15:48:02,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217294412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:02,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:02,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:48:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568247096] [2025-02-05 15:48:02,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:02,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:48:02,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:02,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:48:02,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:48:02,615 INFO L87 Difference]: Start difference. First operand 1321 states and 1944 transitions. Second operand has 8 states, 6 states have (on average 17.833333333333332) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:48:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:02,806 INFO L93 Difference]: Finished difference Result 2525 states and 3744 transitions. [2025-02-05 15:48:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:48:02,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.833333333333332) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 186 [2025-02-05 15:48:02,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:02,821 INFO L225 Difference]: With dead ends: 2525 [2025-02-05 15:48:02,823 INFO L226 Difference]: Without dead ends: 1321 [2025-02-05 15:48:02,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:48:02,833 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 4 mSDsluCounter, 4975 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5807 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:02,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5807 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:48:02,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-02-05 15:48:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2025-02-05 15:48:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1013 states have (on average 1.4718657453109576) internal successors, (1491), 1034 states have internal predecessors, (1491), 216 states have call successors, (216), 87 states have call predecessors, (216), 91 states have return successors, (235), 212 states have call predecessors, (235), 214 states have call successors, (235) [2025-02-05 15:48:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1942 transitions. [2025-02-05 15:48:03,008 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1942 transitions. Word has length 186 [2025-02-05 15:48:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:03,013 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1942 transitions. [2025-02-05 15:48:03,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.833333333333332) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:48:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1942 transitions. [2025-02-05 15:48:03,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 15:48:03,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:03,023 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:03,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:48:03,023 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:03,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:03,024 INFO L85 PathProgramCache]: Analyzing trace with hash 594716004, now seen corresponding path program 2 times [2025-02-05 15:48:03,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:03,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686025988] [2025-02-05 15:48:03,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:48:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:03,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 187 statements into 2 equivalence classes. [2025-02-05 15:48:03,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 187 statements. [2025-02-05 15:48:03,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:48:03,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-05 15:48:03,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686025988] [2025-02-05 15:48:03,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686025988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:03,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:03,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:48:03,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529021162] [2025-02-05 15:48:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:03,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:48:03,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:03,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:48:03,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:48:03,366 INFO L87 Difference]: Start difference. First operand 1321 states and 1942 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 15:48:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:03,510 INFO L93 Difference]: Finished difference Result 1331 states and 1957 transitions. [2025-02-05 15:48:03,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:48:03,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 1 states have call successors, (24) Word has length 187 [2025-02-05 15:48:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:03,527 INFO L225 Difference]: With dead ends: 1331 [2025-02-05 15:48:03,527 INFO L226 Difference]: Without dead ends: 1329 [2025-02-05 15:48:03,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:48:03,535 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 0 mSDsluCounter, 6675 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7511 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:03,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7511 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-02-05 15:48:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2025-02-05 15:48:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1019 states have (on average 1.4690873405299314) internal successors, (1497), 1040 states have internal predecessors, (1497), 216 states have call successors, (216), 87 states have call predecessors, (216), 93 states have return successors, (241), 214 states have call predecessors, (241), 214 states have call successors, (241) [2025-02-05 15:48:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1954 transitions. [2025-02-05 15:48:03,646 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1954 transitions. Word has length 187 [2025-02-05 15:48:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:03,650 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1954 transitions. [2025-02-05 15:48:03,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 15:48:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1954 transitions. [2025-02-05 15:48:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 15:48:03,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:03,659 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:03,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:48:03,660 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:03,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1507548458, now seen corresponding path program 1 times [2025-02-05 15:48:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:03,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506337042] [2025-02-05 15:48:03,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:03,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 15:48:03,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 15:48:03,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:03,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-05 15:48:03,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:03,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506337042] [2025-02-05 15:48:03,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506337042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:03,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:03,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:48:03,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002578119] [2025-02-05 15:48:03,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:03,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:48:03,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:03,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:48:03,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:48:03,901 INFO L87 Difference]: Start difference. First operand 1329 states and 1954 transitions. Second operand has 8 states, 6 states have (on average 18.5) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:48:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:04,029 INFO L93 Difference]: Finished difference Result 2545 states and 3774 transitions. [2025-02-05 15:48:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:48:04,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 18.5) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 190 [2025-02-05 15:48:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:04,040 INFO L225 Difference]: With dead ends: 2545 [2025-02-05 15:48:04,040 INFO L226 Difference]: Without dead ends: 1333 [2025-02-05 15:48:04,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:48:04,043 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 3 mSDsluCounter, 4980 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5813 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:04,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5813 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:48:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-02-05 15:48:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2025-02-05 15:48:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1021 states have (on average 1.4681684622918707) internal successors, (1499), 1044 states have internal predecessors, (1499), 216 states have call successors, (216), 87 states have call predecessors, (216), 95 states have return successors, (245), 214 states have call predecessors, (245), 214 states have call successors, (245) [2025-02-05 15:48:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1960 transitions. [2025-02-05 15:48:04,088 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1960 transitions. Word has length 190 [2025-02-05 15:48:04,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:04,089 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1960 transitions. [2025-02-05 15:48:04,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 18.5) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:48:04,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1960 transitions. [2025-02-05 15:48:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 15:48:04,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:04,093 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:04,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:48:04,093 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:04,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:04,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1885765486, now seen corresponding path program 1 times [2025-02-05 15:48:04,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:04,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162201483] [2025-02-05 15:48:04,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:04,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:04,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 15:48:04,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 15:48:04,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:04,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 15:48:04,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162201483] [2025-02-05 15:48:04,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162201483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:04,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:04,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:48:04,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380400485] [2025-02-05 15:48:04,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:04,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:48:04,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:04,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:48:04,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:48:04,294 INFO L87 Difference]: Start difference. First operand 1333 states and 1960 transitions. Second operand has 9 states, 7 states have (on average 16.428571428571427) internal successors, (115), 8 states have internal predecessors, (115), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:48:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:04,435 INFO L93 Difference]: Finished difference Result 2539 states and 3762 transitions. [2025-02-05 15:48:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:48:04,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 16.428571428571427) internal successors, (115), 8 states have internal predecessors, (115), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 191 [2025-02-05 15:48:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:04,443 INFO L225 Difference]: With dead ends: 2539 [2025-02-05 15:48:04,443 INFO L226 Difference]: Without dead ends: 1333 [2025-02-05 15:48:04,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:04,446 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 7 mSDsluCounter, 5745 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6570 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:04,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6570 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:48:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-02-05 15:48:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2025-02-05 15:48:04,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1021 states have (on average 1.4681684622918707) internal successors, (1499), 1044 states have internal predecessors, (1499), 216 states have call successors, (216), 87 states have call predecessors, (216), 95 states have return successors, (243), 214 states have call predecessors, (243), 214 states have call successors, (243) [2025-02-05 15:48:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1958 transitions. [2025-02-05 15:48:04,492 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1958 transitions. Word has length 191 [2025-02-05 15:48:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:04,492 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1958 transitions. [2025-02-05 15:48:04,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 16.428571428571427) internal successors, (115), 8 states have internal predecessors, (115), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:48:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1958 transitions. [2025-02-05 15:48:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 15:48:04,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:04,496 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:04,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:48:04,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:04,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1941997779, now seen corresponding path program 2 times [2025-02-05 15:48:04,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:04,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338915851] [2025-02-05 15:48:04,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:48:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:04,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-02-05 15:48:04,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 192 statements. [2025-02-05 15:48:04,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:48:04,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:48:04,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:04,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338915851] [2025-02-05 15:48:04,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338915851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:04,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:04,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:48:04,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531159577] [2025-02-05 15:48:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:04,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:48:04,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:04,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:48:04,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:48:04,541 INFO L87 Difference]: Start difference. First operand 1333 states and 1958 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 3 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:48:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:05,046 INFO L93 Difference]: Finished difference Result 3217 states and 4785 transitions. [2025-02-05 15:48:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:48:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 3 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 192 [2025-02-05 15:48:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:05,058 INFO L225 Difference]: With dead ends: 3217 [2025-02-05 15:48:05,058 INFO L226 Difference]: Without dead ends: 1320 [2025-02-05 15:48:05,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:48:05,063 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1454 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 2754 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:05,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 2754 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:48:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-02-05 15:48:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-02-05 15:48:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1015 states have (on average 1.4620689655172414) internal successors, (1484), 1034 states have internal predecessors, (1484), 210 states have call successors, (210), 88 states have call predecessors, (210), 94 states have return successors, (230), 206 states have call predecessors, (230), 208 states have call successors, (230) [2025-02-05 15:48:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1924 transitions. [2025-02-05 15:48:05,129 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1924 transitions. Word has length 192 [2025-02-05 15:48:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:05,129 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1924 transitions. [2025-02-05 15:48:05,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 3 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:48:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1924 transitions. [2025-02-05 15:48:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 15:48:05,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:05,139 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:05,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:48:05,139 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:05,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:05,142 INFO L85 PathProgramCache]: Analyzing trace with hash 120086272, now seen corresponding path program 1 times [2025-02-05 15:48:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:05,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297459795] [2025-02-05 15:48:05,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:05,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 15:48:05,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 15:48:05,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:05,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-05 15:48:05,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297459795] [2025-02-05 15:48:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297459795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:05,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:05,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:05,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029996011] [2025-02-05 15:48:05,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:05,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:05,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:05,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:05,203 INFO L87 Difference]: Start difference. First operand 1320 states and 1924 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:05,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:05,240 INFO L93 Difference]: Finished difference Result 1322 states and 1925 transitions. [2025-02-05 15:48:05,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:05,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 215 [2025-02-05 15:48:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:05,245 INFO L225 Difference]: With dead ends: 1322 [2025-02-05 15:48:05,245 INFO L226 Difference]: Without dead ends: 686 [2025-02-05 15:48:05,247 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:48:05,247 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 794 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:05,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 853 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-02-05 15:48:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-02-05 15:48:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 524 states have (on average 1.4484732824427482) internal successors, (759), 534 states have internal predecessors, (759), 112 states have call successors, (112), 46 states have call predecessors, (112), 49 states have return successors, (118), 110 states have call predecessors, (118), 111 states have call successors, (118) [2025-02-05 15:48:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 989 transitions. [2025-02-05 15:48:05,274 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 989 transitions. Word has length 215 [2025-02-05 15:48:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:05,275 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 989 transitions. [2025-02-05 15:48:05,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 989 transitions. [2025-02-05 15:48:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 15:48:05,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:05,278 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:05,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:48:05,278 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:05,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:05,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1443415827, now seen corresponding path program 1 times [2025-02-05 15:48:05,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:05,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604495250] [2025-02-05 15:48:05,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:05,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:05,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 15:48:05,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 15:48:05,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:05,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-05 15:48:05,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:05,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604495250] [2025-02-05 15:48:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604495250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:05,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:48:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142640296] [2025-02-05 15:48:05,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:05,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:48:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:05,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:48:05,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:48:05,475 INFO L87 Difference]: Start difference. First operand 686 states and 989 transitions. Second operand has 9 states, 7 states have (on average 19.0) internal successors, (133), 8 states have internal predecessors, (133), 4 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 15:48:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:05,613 INFO L93 Difference]: Finished difference Result 1291 states and 1888 transitions. [2025-02-05 15:48:05,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:48:05,614 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 19.0) internal successors, (133), 8 states have internal predecessors, (133), 4 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 223 [2025-02-05 15:48:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:05,619 INFO L225 Difference]: With dead ends: 1291 [2025-02-05 15:48:05,620 INFO L226 Difference]: Without dead ends: 688 [2025-02-05 15:48:05,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:05,622 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 4 mSDsluCounter, 5647 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6458 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:05,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6458 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:48:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-02-05 15:48:05,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-02-05 15:48:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 525 states have (on average 1.4476190476190476) internal successors, (760), 536 states have internal predecessors, (760), 112 states have call successors, (112), 46 states have call predecessors, (112), 50 states have return successors, (123), 110 states have call predecessors, (123), 111 states have call successors, (123) [2025-02-05 15:48:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 995 transitions. [2025-02-05 15:48:05,660 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 995 transitions. Word has length 223 [2025-02-05 15:48:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:05,660 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 995 transitions. [2025-02-05 15:48:05,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 19.0) internal successors, (133), 8 states have internal predecessors, (133), 4 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 15:48:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 995 transitions. [2025-02-05 15:48:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-02-05 15:48:05,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:05,664 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:05,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:48:05,665 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:05,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:05,665 INFO L85 PathProgramCache]: Analyzing trace with hash 598805968, now seen corresponding path program 1 times [2025-02-05 15:48:05,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:05,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506565763] [2025-02-05 15:48:05,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:05,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:05,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 15:48:05,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 15:48:05,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:05,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:05,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:05,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506565763] [2025-02-05 15:48:05,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506565763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:05,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086596093] [2025-02-05 15:48:05,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:05,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:05,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:05,832 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:48:05,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:48:06,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-02-05 15:48:06,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-02-05 15:48:06,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:06,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:06,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:06,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:06,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:48:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086596093] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:48:06,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:48:06,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:48:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150418312] [2025-02-05 15:48:06,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:48:06,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:48:06,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:06,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:48:06,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:48:06,322 INFO L87 Difference]: Start difference. First operand 688 states and 995 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-02-05 15:48:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:06,469 INFO L93 Difference]: Finished difference Result 1562 states and 2344 transitions. [2025-02-05 15:48:06,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:48:06,470 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 217 [2025-02-05 15:48:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:06,476 INFO L225 Difference]: With dead ends: 1562 [2025-02-05 15:48:06,476 INFO L226 Difference]: Without dead ends: 1246 [2025-02-05 15:48:06,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 431 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:48:06,478 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 629 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:06,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 3555 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:48:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-02-05 15:48:06,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1222. [2025-02-05 15:48:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 980 states have (on average 1.5091836734693878) internal successors, (1479), 991 states have internal predecessors, (1479), 191 states have call successors, (191), 46 states have call predecessors, (191), 50 states have return successors, (212), 189 states have call predecessors, (212), 190 states have call successors, (212) [2025-02-05 15:48:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1882 transitions. [2025-02-05 15:48:06,516 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1882 transitions. Word has length 217 [2025-02-05 15:48:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:06,517 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1882 transitions. [2025-02-05 15:48:06,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-02-05 15:48:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1882 transitions. [2025-02-05 15:48:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 15:48:06,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:06,521 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:06,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:48:06,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:06,726 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:06,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1146338811, now seen corresponding path program 1 times [2025-02-05 15:48:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:06,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063734845] [2025-02-05 15:48:06,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:06,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 15:48:06,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 15:48:06,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:06,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:06,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063734845] [2025-02-05 15:48:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063734845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:06,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:06,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:06,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061553926] [2025-02-05 15:48:06,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:06,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:06,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:06,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:06,796 INFO L87 Difference]: Start difference. First operand 1222 states and 1882 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:06,856 INFO L93 Difference]: Finished difference Result 2809 states and 4409 transitions. [2025-02-05 15:48:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:06,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 221 [2025-02-05 15:48:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:06,865 INFO L225 Difference]: With dead ends: 2809 [2025-02-05 15:48:06,866 INFO L226 Difference]: Without dead ends: 1726 [2025-02-05 15:48:06,869 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:48:06,871 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 163 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1655 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:48:06,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1655 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2025-02-05 15:48:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1718. [2025-02-05 15:48:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1397 states have (on average 1.5246957766642806) internal successors, (2130), 1408 states have internal predecessors, (2130), 270 states have call successors, (270), 46 states have call predecessors, (270), 50 states have return successors, (301), 268 states have call predecessors, (301), 269 states have call successors, (301) [2025-02-05 15:48:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2701 transitions. [2025-02-05 15:48:06,925 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2701 transitions. Word has length 221 [2025-02-05 15:48:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:06,925 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2701 transitions. [2025-02-05 15:48:06,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2701 transitions. [2025-02-05 15:48:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 15:48:06,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:06,932 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:06,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:48:06,933 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:06,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:06,933 INFO L85 PathProgramCache]: Analyzing trace with hash 973284222, now seen corresponding path program 1 times [2025-02-05 15:48:06,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:06,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239223134] [2025-02-05 15:48:06,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:06,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 15:48:06,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 15:48:06,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:06,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239223134] [2025-02-05 15:48:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239223134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:06,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:06,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:06,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526421089] [2025-02-05 15:48:06,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:06,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:06,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:06,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:06,995 INFO L87 Difference]: Start difference. First operand 1718 states and 2701 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:48:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:07,053 INFO L93 Difference]: Finished difference Result 4045 states and 6439 transitions. [2025-02-05 15:48:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:07,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 229 [2025-02-05 15:48:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:07,064 INFO L225 Difference]: With dead ends: 4045 [2025-02-05 15:48:07,065 INFO L226 Difference]: Without dead ends: 2527 [2025-02-05 15:48:07,069 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:48:07,069 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 161 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1654 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:48:07,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1654 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2025-02-05 15:48:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 2519. [2025-02-05 15:48:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2079 states have (on average 1.54016354016354) internal successors, (3202), 2090 states have internal predecessors, (3202), 389 states have call successors, (389), 46 states have call predecessors, (389), 50 states have return successors, (420), 387 states have call predecessors, (420), 388 states have call successors, (420) [2025-02-05 15:48:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 4011 transitions. [2025-02-05 15:48:07,140 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 4011 transitions. Word has length 229 [2025-02-05 15:48:07,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:07,141 INFO L471 AbstractCegarLoop]: Abstraction has 2519 states and 4011 transitions. [2025-02-05 15:48:07,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:48:07,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 4011 transitions. [2025-02-05 15:48:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 15:48:07,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:07,150 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:07,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:48:07,150 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:07,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1901505210, now seen corresponding path program 1 times [2025-02-05 15:48:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:07,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411751059] [2025-02-05 15:48:07,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:07,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:07,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 15:48:07,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 15:48:07,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:07,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:07,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411751059] [2025-02-05 15:48:07,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411751059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:07,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:07,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:07,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767931591] [2025-02-05 15:48:07,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:07,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:07,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:07,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:07,211 INFO L87 Difference]: Start difference. First operand 2519 states and 4011 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:07,307 INFO L93 Difference]: Finished difference Result 5926 states and 9544 transitions. [2025-02-05 15:48:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:07,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 223 [2025-02-05 15:48:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:07,327 INFO L225 Difference]: With dead ends: 5926 [2025-02-05 15:48:07,328 INFO L226 Difference]: Without dead ends: 3761 [2025-02-05 15:48:07,335 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:48:07,336 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 159 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1639 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:48:07,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1639 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2025-02-05 15:48:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3753. [2025-02-05 15:48:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3151 states have (on average 1.5528403681370992) internal successors, (4893), 3162 states have internal predecessors, (4893), 551 states have call successors, (551), 46 states have call predecessors, (551), 50 states have return successors, (598), 549 states have call predecessors, (598), 550 states have call successors, (598) [2025-02-05 15:48:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 6042 transitions. [2025-02-05 15:48:07,484 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 6042 transitions. Word has length 223 [2025-02-05 15:48:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:07,484 INFO L471 AbstractCegarLoop]: Abstraction has 3753 states and 6042 transitions. [2025-02-05 15:48:07,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 6042 transitions. [2025-02-05 15:48:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 15:48:07,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:07,500 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:07,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:48:07,501 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:07,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash 665448084, now seen corresponding path program 1 times [2025-02-05 15:48:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:07,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121647412] [2025-02-05 15:48:07,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:07,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 15:48:07,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 15:48:07,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:07,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:07,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:07,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121647412] [2025-02-05 15:48:07,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121647412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:07,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:07,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:07,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211294893] [2025-02-05 15:48:07,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:07,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:07,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:07,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:07,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:07,570 INFO L87 Difference]: Start difference. First operand 3753 states and 6042 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:07,727 INFO L93 Difference]: Finished difference Result 8897 states and 14465 transitions. [2025-02-05 15:48:07,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:07,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 224 [2025-02-05 15:48:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:07,752 INFO L225 Difference]: With dead ends: 8897 [2025-02-05 15:48:07,752 INFO L226 Difference]: Without dead ends: 5753 [2025-02-05 15:48:07,758 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:48:07,758 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 157 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1647 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:48:07,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1647 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5753 states. [2025-02-05 15:48:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5753 to 5745. [2025-02-05 15:48:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5745 states, 4898 states have (on average 1.5632911392405062) internal successors, (7657), 4909 states have internal predecessors, (7657), 796 states have call successors, (796), 46 states have call predecessors, (796), 50 states have return successors, (869), 794 states have call predecessors, (869), 795 states have call successors, (869) [2025-02-05 15:48:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5745 states to 5745 states and 9322 transitions. [2025-02-05 15:48:07,939 INFO L78 Accepts]: Start accepts. Automaton has 5745 states and 9322 transitions. Word has length 224 [2025-02-05 15:48:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:07,939 INFO L471 AbstractCegarLoop]: Abstraction has 5745 states and 9322 transitions. [2025-02-05 15:48:07,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 5745 states and 9322 transitions. [2025-02-05 15:48:07,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 15:48:07,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:07,960 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:07,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:48:07,960 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:07,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1986040844, now seen corresponding path program 1 times [2025-02-05 15:48:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673398469] [2025-02-05 15:48:07,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:07,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:07,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 15:48:07,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 15:48:07,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:07,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:08,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:08,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673398469] [2025-02-05 15:48:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673398469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:08,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:08,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:08,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267190885] [2025-02-05 15:48:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:08,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:08,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:08,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:08,023 INFO L87 Difference]: Start difference. First operand 5745 states and 9322 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:48:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:08,247 INFO L93 Difference]: Finished difference Result 13834 states and 22607 transitions. [2025-02-05 15:48:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 232 [2025-02-05 15:48:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:08,276 INFO L225 Difference]: With dead ends: 13834 [2025-02-05 15:48:08,276 INFO L226 Difference]: Without dead ends: 9089 [2025-02-05 15:48:08,290 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:48:08,291 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 155 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1655 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:48:08,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1655 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9089 states. [2025-02-05 15:48:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9089 to 9081. [2025-02-05 15:48:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9081 states, 7741 states have (on average 1.562072083710115) internal successors, (12092), 7752 states have internal predecessors, (12092), 1289 states have call successors, (1289), 46 states have call predecessors, (1289), 50 states have return successors, (1406), 1287 states have call predecessors, (1406), 1288 states have call successors, (1406) [2025-02-05 15:48:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9081 states to 9081 states and 14787 transitions. [2025-02-05 15:48:08,673 INFO L78 Accepts]: Start accepts. Automaton has 9081 states and 14787 transitions. Word has length 232 [2025-02-05 15:48:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:08,673 INFO L471 AbstractCegarLoop]: Abstraction has 9081 states and 14787 transitions. [2025-02-05 15:48:08,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:48:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9081 states and 14787 transitions. [2025-02-05 15:48:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 15:48:08,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:08,697 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:08,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 15:48:08,698 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:08,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash -646304128, now seen corresponding path program 1 times [2025-02-05 15:48:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:08,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913281413] [2025-02-05 15:48:08,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:08,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:08,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 15:48:08,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 15:48:08,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:08,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:08,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:08,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913281413] [2025-02-05 15:48:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913281413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:08,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:08,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921148523] [2025-02-05 15:48:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:08,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:08,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:08,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:08,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:08,758 INFO L87 Difference]: Start difference. First operand 9081 states and 14787 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:48:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:09,014 INFO L93 Difference]: Finished difference Result 22682 states and 37267 transitions. [2025-02-05 15:48:09,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:09,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 233 [2025-02-05 15:48:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:09,059 INFO L225 Difference]: With dead ends: 22682 [2025-02-05 15:48:09,059 INFO L226 Difference]: Without dead ends: 15091 [2025-02-05 15:48:09,078 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:48:09,078 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 153 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1644 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:48:09,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1644 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15091 states. [2025-02-05 15:48:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15091 to 15083. [2025-02-05 15:48:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15083 states, 12921 states have (on average 1.568918814333256) internal successors, (20272), 12932 states have internal predecessors, (20272), 2111 states have call successors, (2111), 46 states have call predecessors, (2111), 50 states have return successors, (2306), 2109 states have call predecessors, (2306), 2110 states have call successors, (2306) [2025-02-05 15:48:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15083 states to 15083 states and 24689 transitions. [2025-02-05 15:48:09,569 INFO L78 Accepts]: Start accepts. Automaton has 15083 states and 24689 transitions. Word has length 233 [2025-02-05 15:48:09,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:09,569 INFO L471 AbstractCegarLoop]: Abstraction has 15083 states and 24689 transitions. [2025-02-05 15:48:09,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:48:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 15083 states and 24689 transitions. [2025-02-05 15:48:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 15:48:09,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:09,600 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:09,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 15:48:09,601 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:09,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:09,601 INFO L85 PathProgramCache]: Analyzing trace with hash -843733272, now seen corresponding path program 1 times [2025-02-05 15:48:09,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:09,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274966501] [2025-02-05 15:48:09,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:09,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 15:48:09,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 15:48:09,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:09,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:09,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:09,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274966501] [2025-02-05 15:48:09,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274966501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:09,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:09,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329899350] [2025-02-05 15:48:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:09,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:09,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:09,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:09,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:09,665 INFO L87 Difference]: Start difference. First operand 15083 states and 24689 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:10,113 INFO L93 Difference]: Finished difference Result 36289 states and 59168 transitions. [2025-02-05 15:48:10,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:10,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 227 [2025-02-05 15:48:10,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:10,190 INFO L225 Difference]: With dead ends: 36289 [2025-02-05 15:48:10,190 INFO L226 Difference]: Without dead ends: 23823 [2025-02-05 15:48:10,219 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:48:10,220 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 151 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1633 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:48:10,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1633 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23823 states. [2025-02-05 15:48:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23823 to 23815. [2025-02-05 15:48:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23815 states, 20450 states have (on average 1.5429339853300734) internal successors, (31553), 20461 states have internal predecessors, (31553), 3314 states have call successors, (3314), 46 states have call predecessors, (3314), 50 states have return successors, (3653), 3312 states have call predecessors, (3653), 3313 states have call successors, (3653) [2025-02-05 15:48:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23815 states to 23815 states and 38520 transitions. [2025-02-05 15:48:11,333 INFO L78 Accepts]: Start accepts. Automaton has 23815 states and 38520 transitions. Word has length 227 [2025-02-05 15:48:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:11,334 INFO L471 AbstractCegarLoop]: Abstraction has 23815 states and 38520 transitions. [2025-02-05 15:48:11,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 23815 states and 38520 transitions. [2025-02-05 15:48:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-05 15:48:11,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:11,384 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:11,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 15:48:11,386 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:11,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:11,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1018676289, now seen corresponding path program 1 times [2025-02-05 15:48:11,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:11,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330700113] [2025-02-05 15:48:11,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:11,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:11,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 15:48:11,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 15:48:11,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:11,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:11,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:11,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330700113] [2025-02-05 15:48:11,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330700113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:11,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:11,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:11,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041143166] [2025-02-05 15:48:11,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:11,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:11,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:11,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:11,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:11,471 INFO L87 Difference]: Start difference. First operand 23815 states and 38520 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:48:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:12,362 INFO L93 Difference]: Finished difference Result 62747 states and 101921 transitions. [2025-02-05 15:48:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:12,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 235 [2025-02-05 15:48:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:12,517 INFO L225 Difference]: With dead ends: 62747 [2025-02-05 15:48:12,518 INFO L226 Difference]: Without dead ends: 42353 [2025-02-05 15:48:12,572 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:48:12,572 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 149 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1651 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:48:12,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1651 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42353 states. [2025-02-05 15:48:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42353 to 42345. [2025-02-05 15:48:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42345 states, 36530 states have (on average 1.5435806186695866) internal successors, (56387), 36541 states have internal predecessors, (56387), 5764 states have call successors, (5764), 46 states have call predecessors, (5764), 50 states have return successors, (6377), 5762 states have call predecessors, (6377), 5763 states have call successors, (6377) [2025-02-05 15:48:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42345 states to 42345 states and 68528 transitions. [2025-02-05 15:48:14,190 INFO L78 Accepts]: Start accepts. Automaton has 42345 states and 68528 transitions. Word has length 235 [2025-02-05 15:48:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:14,190 INFO L471 AbstractCegarLoop]: Abstraction has 42345 states and 68528 transitions. [2025-02-05 15:48:14,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:48:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 42345 states and 68528 transitions. [2025-02-05 15:48:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-02-05 15:48:14,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:14,245 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:14,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 15:48:14,245 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:14,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:14,247 INFO L85 PathProgramCache]: Analyzing trace with hash 942723945, now seen corresponding path program 1 times [2025-02-05 15:48:14,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:14,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088128724] [2025-02-05 15:48:14,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:14,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:14,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-02-05 15:48:14,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-02-05 15:48:14,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:14,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:14,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:14,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088128724] [2025-02-05 15:48:14,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088128724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:14,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:14,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767269734] [2025-02-05 15:48:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:14,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:14,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:14,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:14,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:14,308 INFO L87 Difference]: Start difference. First operand 42345 states and 68528 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:16,637 INFO L93 Difference]: Finished difference Result 114629 states and 186563 transitions. [2025-02-05 15:48:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:16,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 229 [2025-02-05 15:48:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:16,924 INFO L225 Difference]: With dead ends: 114629 [2025-02-05 15:48:16,924 INFO L226 Difference]: Without dead ends: 76872 [2025-02-05 15:48:17,005 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:48:17,006 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 147 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1652 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:48:17,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1652 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76872 states. [2025-02-05 15:48:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76872 to 76864. [2025-02-05 15:48:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76864 states, 66536 states have (on average 1.5478237345196586) internal successors, (102986), 66547 states have internal predecessors, (102986), 10277 states have call successors, (10277), 46 states have call predecessors, (10277), 50 states have return successors, (11422), 10275 states have call predecessors, (11422), 10276 states have call successors, (11422) [2025-02-05 15:48:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76864 states to 76864 states and 124685 transitions. [2025-02-05 15:48:20,055 INFO L78 Accepts]: Start accepts. Automaton has 76864 states and 124685 transitions. Word has length 229 [2025-02-05 15:48:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:20,056 INFO L471 AbstractCegarLoop]: Abstraction has 76864 states and 124685 transitions. [2025-02-05 15:48:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 76864 states and 124685 transitions. [2025-02-05 15:48:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 15:48:20,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:20,132 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 15:48:20,132 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:20,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1548318383, now seen corresponding path program 1 times [2025-02-05 15:48:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:20,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761091620] [2025-02-05 15:48:20,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:20,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 15:48:20,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 15:48:20,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:20,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:48:20,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761091620] [2025-02-05 15:48:20,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761091620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:20,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:20,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:20,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031501005] [2025-02-05 15:48:20,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:20,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:20,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:20,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:20,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:20,192 INFO L87 Difference]: Start difference. First operand 76864 states and 124685 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:22,954 INFO L93 Difference]: Finished difference Result 143580 states and 233745 transitions. [2025-02-05 15:48:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:22,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 230 [2025-02-05 15:48:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:23,368 INFO L225 Difference]: With dead ends: 143580 [2025-02-05 15:48:23,369 INFO L226 Difference]: Without dead ends: 143264 [2025-02-05 15:48:23,423 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:48:23,423 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 141 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1658 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:48:23,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1658 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143264 states. [2025-02-05 15:48:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143264 to 143256. [2025-02-05 15:48:27,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143256 states, 124560 states have (on average 1.5473185613359024) internal successors, (192734), 124571 states have internal predecessors, (192734), 18645 states have call successors, (18645), 46 states have call predecessors, (18645), 50 states have return successors, (20836), 18643 states have call predecessors, (20836), 18644 states have call successors, (20836) [2025-02-05 15:48:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143256 states to 143256 states and 232215 transitions. [2025-02-05 15:48:27,856 INFO L78 Accepts]: Start accepts. Automaton has 143256 states and 232215 transitions. Word has length 230 [2025-02-05 15:48:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:27,856 INFO L471 AbstractCegarLoop]: Abstraction has 143256 states and 232215 transitions. [2025-02-05 15:48:27,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:48:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 143256 states and 232215 transitions. [2025-02-05 15:48:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-05 15:48:27,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:27,999 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:27,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 15:48:27,999 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:28,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1791223209, now seen corresponding path program 1 times [2025-02-05 15:48:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:28,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762445599] [2025-02-05 15:48:28,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:28,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:28,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-05 15:48:28,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-05 15:48:28,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:28,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:28,357 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-05 15:48:28,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:28,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762445599] [2025-02-05 15:48:28,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762445599] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:28,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851150717] [2025-02-05 15:48:28,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:28,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:28,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:28,359 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:48:28,361 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:48:28,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-05 15:48:28,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-05 15:48:28,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:28,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:28,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:48:28,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-05 15:48:28,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:48:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:48:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851150717] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:48:29,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:48:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-02-05 15:48:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493321032] [2025-02-05 15:48:29,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:48:29,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 15:48:29,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:29,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 15:48:29,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:48:29,239 INFO L87 Difference]: Start difference. First operand 143256 states and 232215 transitions. Second operand has 28 states, 26 states have (on average 12.884615384615385) internal successors, (335), 24 states have internal predecessors, (335), 9 states have call successors, (77), 8 states have call predecessors, (77), 12 states have return successors, (66), 11 states have call predecessors, (66), 9 states have call successors, (66)