./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_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_spec1_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 c2ee13e5ae0bbed1c37b7eadefb29cbd7041f4c5e0d498dc3d4ea1e000526be8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:42:13,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:42:13,073 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:42:13,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:42:13,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:42:13,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:42:13,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:42:13,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:42:13,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:42:13,098 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:42:13,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:42:13,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:42:13,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:42:13,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:42:13,099 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:42:13,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:42:13,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:42:13,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:42:13,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:42:13,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:42:13,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:42:13,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:42:13,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:42:13,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:42:13,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:42:13,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:42:13,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:42:13,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:42:13,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:42:13,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:42:13,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:42:13,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:42:13,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:42:13,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:42:13,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:42:13,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:42:13,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:42:13,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:42:13,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:42:13,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:42:13,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:42:13,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:42:13,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:42:13,103 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 -> c2ee13e5ae0bbed1c37b7eadefb29cbd7041f4c5e0d498dc3d4ea1e000526be8 [2025-02-05 15:42:13,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:42:13,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:42:13,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:42:13,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:42:13,388 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:42:13,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_productSimulator.cil.c [2025-02-05 15:42:14,690 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2df83af4/8e71e3893e51494e9cd1aedef36f3f4e/FLAG12c9653d4 [2025-02-05 15:42:15,087 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:42:15,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_productSimulator.cil.c [2025-02-05 15:42:15,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2df83af4/8e71e3893e51494e9cd1aedef36f3f4e/FLAG12c9653d4 [2025-02-05 15:42:15,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2df83af4/8e71e3893e51494e9cd1aedef36f3f4e [2025-02-05 15:42:15,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:42:15,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:42:15,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:42:15,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:42:15,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:42:15,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:42:15" (1/1) ... [2025-02-05 15:42:15,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d88c24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:15, skipping insertion in model container [2025-02-05 15:42:15,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:42:15" (1/1) ... [2025-02-05 15:42:15,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:42:15,680 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_spec1_productSimulator.cil.c[35789,35802] [2025-02-05 15:42:15,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:42:15,833 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:42:15,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [48] [2025-02-05 15:42:15,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [89] [2025-02-05 15:42:15,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [366] [2025-02-05 15:42:15,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [583] [2025-02-05 15:42:15,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1155] [2025-02-05 15:42:15,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1552] [2025-02-05 15:42:15,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1915] [2025-02-05 15:42:15,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1924] [2025-02-05 15:42:15,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [2290] [2025-02-05 15:42:15,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3350] [2025-02-05 15:42:15,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [3457] [2025-02-05 15:42:15,908 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_spec1_productSimulator.cil.c[35789,35802] [2025-02-05 15:42:15,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:42:16,005 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:42:16,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16 WrapperNode [2025-02-05 15:42:16,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:42:16,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:42:16,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:42:16,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:42:16,014 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:42:16" (1/1) ... [2025-02-05 15:42:16,042 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:42:16" (1/1) ... [2025-02-05 15:42:16,093 INFO L138 Inliner]: procedures = 151, calls = 263, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1314 [2025-02-05 15:42:16,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:42:16,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:42:16,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:42:16,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:42:16,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (1/1) ... [2025-02-05 15:42:16,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (1/1) ... [2025-02-05 15:42:16,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (1/1) ... [2025-02-05 15:42:16,170 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:42:16,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (1/1) ... [2025-02-05 15:42:16,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (1/1) ... [2025-02-05 15:42:16,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (1/1) ... [2025-02-05 15:42:16,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (1/1) ... [2025-02-05 15:42:16,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (1/1) ... [2025-02-05 15:42:16,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (1/1) ... [2025-02-05 15:42:16,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:42:16,235 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:42:16,236 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:42:16,240 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:42:16,241 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (1/1) ... [2025-02-05 15:42:16,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:42:16,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:16,269 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:42:16,271 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:42:16,291 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:42:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:42:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-02-05 15:42:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-02-05 15:42:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-02-05 15:42:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-02-05 15:42:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:42:16,292 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:42:16,292 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:42:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:42:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:42:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:42:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:42:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:42:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-02-05 15:42:16,293 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-02-05 15:42:16,293 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:42:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:42:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-02-05 15:42:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-02-05 15:42:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:42:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:42:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:42:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:42:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:42:16,294 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:42:16,294 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-02-05 15:42:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-02-05 15:42:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-02-05 15:42:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-02-05 15:42:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:42:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:42:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:42:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:42:16,295 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:42:16,295 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:42:16,296 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-02-05 15:42:16,296 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:42:16,297 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:42:16,297 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-02-05 15:42:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-02-05 15:42:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:42:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:42:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:42:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-02-05 15:42:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-02-05 15:42:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:42:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:42:16,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:42:16,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:42:16,527 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:42:16,530 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:42:16,598 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: #res := ~retValue_acc~0; [2025-02-05 15:42:16,612 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1459: #res := ~retValue_acc~18; [2025-02-05 15:42:16,626 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1039: #res := ~retValue_acc~9; [2025-02-05 15:42:16,640 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2892: #res := ~retValue_acc~34; [2025-02-05 15:42:16,740 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2436: #res := ~retValue_acc~28; [2025-02-05 15:42:16,783 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1196-1: getEmailId_#res#1 := getEmailId_~retValue_acc~11#1; [2025-02-05 15:42:16,826 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1422: #res := ~retValue_acc~17; [2025-02-05 15:42:16,856 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1270: #res := ~retValue_acc~13; [2025-02-05 15:42:16,927 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L538-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~1#1; [2025-02-05 15:42:16,928 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L556: #res#1 := ~retValue_acc~2#1; [2025-02-05 15:42:17,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2939-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~35#1; [2025-02-05 15:42:17,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: #res#1 := ~retValue_acc~36#1; [2025-02-05 15:42:17,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3208: #res := ~retValue_acc~39; [2025-02-05 15:42:17,080 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L580-1: createEmail_#res#1 := createEmail_~retValue_acc~4#1; [2025-02-05 15:42:17,087 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1385: #res := ~retValue_acc~16; [2025-02-05 15:42:17,141 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3327-1: getClientId_#res#1 := getClientId_~retValue_acc~41#1; [2025-02-05 15:42:17,186 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1533-1: isVerified_#res#1 := isVerified_~retValue_acc~20#1; [2025-02-05 15:42:17,186 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3280-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~40#1; [2025-02-05 15:42:17,194 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1496: #res := ~retValue_acc~19; [2025-02-05 15:42:17,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3359: #res := ~retValue_acc~42; [2025-02-05 15:42:17,250 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2762: #res := ~retValue_acc~32; [2025-02-05 15:42:17,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2845-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~33#1; [2025-02-05 15:42:17,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3454-1: valid_product_#res#1 := valid_product_~retValue_acc~43#1; [2025-02-05 15:42:17,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L996-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~6#1; [2025-02-05 15:42:17,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1014-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~8#1; [2025-02-05 15:42:17,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3047-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~37#1; [2025-02-05 15:42:17,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~7#1; [2025-02-05 15:42:17,597 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3154-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~38#1; [2025-02-05 15:42:17,602 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1233: #res := ~retValue_acc~12; [2025-02-05 15:42:17,768 INFO L? ?]: Removed 626 outVars from TransFormulas that were not future-live. [2025-02-05 15:42:17,768 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:42:17,795 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:42:17,796 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:42:17,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:42:17 BoogieIcfgContainer [2025-02-05 15:42:17,796 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:42:17,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:42:17,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:42:17,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:42:17,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:42:15" (1/3) ... [2025-02-05 15:42:17,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7574295e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:42:17, skipping insertion in model container [2025-02-05 15:42:17,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:16" (2/3) ... [2025-02-05 15:42:17,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7574295e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:42:17, skipping insertion in model container [2025-02-05 15:42:17,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:42:17" (3/3) ... [2025-02-05 15:42:17,811 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_productSimulator.cil.c [2025-02-05 15:42:17,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:42:17,831 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_productSimulator.cil.c that has 44 procedures, 602 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:42:17,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:42:17,912 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;@fcbb4b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:42:17,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:42:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 602 states, 447 states have (on average 1.5145413870246085) internal successors, (677), 467 states have internal predecessors, (677), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:42:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:42:17,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:17,940 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] [2025-02-05 15:42:17,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:17,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2105406923, now seen corresponding path program 1 times [2025-02-05 15:42:17,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406570206] [2025-02-05 15:42:17,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:17,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:18,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:42:18,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:42:18,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:18,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:18,349 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:42:18,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406570206] [2025-02-05 15:42:18,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406570206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:18,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:42:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446556266] [2025-02-05 15:42:18,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:18,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:42:18,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:18,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:42:18,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:42:18,380 INFO L87 Difference]: Start difference. First operand has 602 states, 447 states have (on average 1.5145413870246085) internal successors, (677), 467 states have internal predecessors, (677), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:42:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:18,457 INFO L93 Difference]: Finished difference Result 936 states and 1375 transitions. [2025-02-05 15:42:18,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:42:18,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2025-02-05 15:42:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:18,478 INFO L225 Difference]: With dead ends: 936 [2025-02-05 15:42:18,478 INFO L226 Difference]: Without dead ends: 595 [2025-02-05 15:42:18,484 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:42:18,489 INFO L435 NwaCegarLoop]: 894 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, 894 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:42:18,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-05 15:42:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-02-05 15:42:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 441 states have (on average 1.5124716553287982) internal successors, (667), 460 states have internal predecessors, (667), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 15:42:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 886 transitions. [2025-02-05 15:42:18,575 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 886 transitions. Word has length 127 [2025-02-05 15:42:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:18,577 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 886 transitions. [2025-02-05 15:42:18,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:42:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 886 transitions. [2025-02-05 15:42:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:42:18,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:18,581 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] [2025-02-05 15:42:18,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:42:18,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:18,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 841284204, now seen corresponding path program 1 times [2025-02-05 15:42:18,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:18,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112823958] [2025-02-05 15:42:18,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:18,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:18,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:42:18,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:42:18,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:18,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:18,954 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:42:18,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112823958] [2025-02-05 15:42:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112823958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:18,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:18,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:42:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250098405] [2025-02-05 15:42:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:18,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:42:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:18,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:42:18,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:42:18,958 INFO L87 Difference]: Start difference. First operand 595 states and 886 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:42:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:19,074 INFO L93 Difference]: Finished difference Result 1154 states and 1716 transitions. [2025-02-05 15:42:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:42:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 128 [2025-02-05 15:42:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:19,083 INFO L225 Difference]: With dead ends: 1154 [2025-02-05 15:42:19,083 INFO L226 Difference]: Without dead ends: 595 [2025-02-05 15:42:19,086 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:42:19,090 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 0 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3524 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:42:19,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3524 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:19,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-05 15:42:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-02-05 15:42:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 441 states have (on average 1.4965986394557824) internal successors, (660), 460 states have internal predecessors, (660), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 15:42:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 879 transitions. [2025-02-05 15:42:19,146 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 879 transitions. Word has length 128 [2025-02-05 15:42:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:19,147 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 879 transitions. [2025-02-05 15:42:19,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:42:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 879 transitions. [2025-02-05 15:42:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:42:19,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:19,152 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] [2025-02-05 15:42:19,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:42:19,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:19,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:19,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1054807442, now seen corresponding path program 1 times [2025-02-05 15:42:19,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:19,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160486228] [2025-02-05 15:42:19,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:19,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:42:19,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:42:19,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:19,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:19,326 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:42:19,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:19,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160486228] [2025-02-05 15:42:19,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160486228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:19,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:19,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:19,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717413217] [2025-02-05 15:42:19,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:19,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:19,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:19,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:19,331 INFO L87 Difference]: Start difference. First operand 595 states and 879 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:42:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:19,408 INFO L93 Difference]: Finished difference Result 1164 states and 1740 transitions. [2025-02-05 15:42:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:19,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 133 [2025-02-05 15:42:19,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:19,416 INFO L225 Difference]: With dead ends: 1164 [2025-02-05 15:42:19,417 INFO L226 Difference]: Without dead ends: 594 [2025-02-05 15:42:19,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:42:19,424 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 845 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:19,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 872 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-02-05 15:42:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-02-05 15:42:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 442 states have (on average 1.4841628959276019) internal successors, (656), 459 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:42:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 869 transitions. [2025-02-05 15:42:19,468 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 869 transitions. Word has length 133 [2025-02-05 15:42:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:19,469 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 869 transitions. [2025-02-05 15:42:19,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:42:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 869 transitions. [2025-02-05 15:42:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:42:19,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:19,473 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:42:19,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:42:19,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:19,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:19,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1698706334, now seen corresponding path program 1 times [2025-02-05 15:42:19,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:19,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007493645] [2025-02-05 15:42:19,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:19,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:19,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:42:19,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:42:19,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:19,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:19,613 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:42:19,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:19,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007493645] [2025-02-05 15:42:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007493645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:19,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:19,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:19,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626372530] [2025-02-05 15:42:19,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:19,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:19,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:19,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:19,615 INFO L87 Difference]: Start difference. First operand 594 states and 869 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 15:42:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:19,671 INFO L93 Difference]: Finished difference Result 1157 states and 1708 transitions. [2025-02-05 15:42:19,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:19,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 149 [2025-02-05 15:42:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:19,676 INFO L225 Difference]: With dead ends: 1157 [2025-02-05 15:42:19,676 INFO L226 Difference]: Without dead ends: 593 [2025-02-05 15:42:19,678 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:42:19,679 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 831 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 890 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:42:19,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 890 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-05 15:42:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-02-05 15:42:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 442 states have (on average 1.4796380090497738) internal successors, (654), 458 states have internal predecessors, (654), 106 states have call successors, (106), 44 states have call predecessors, (106), 44 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:42:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 865 transitions. [2025-02-05 15:42:19,727 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 865 transitions. Word has length 149 [2025-02-05 15:42:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:19,728 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 865 transitions. [2025-02-05 15:42:19,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 15:42:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 865 transitions. [2025-02-05 15:42:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 15:42:19,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:19,731 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, 1] [2025-02-05 15:42:19,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:42:19,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:19,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1709988304, now seen corresponding path program 1 times [2025-02-05 15:42:19,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:19,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670657905] [2025-02-05 15:42:19,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:19,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:19,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 15:42:19,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 15:42:19,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:19,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:19,863 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:42:19,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:19,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670657905] [2025-02-05 15:42:19,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670657905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:19,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:19,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:19,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129457024] [2025-02-05 15:42:19,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:19,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:19,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:19,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:19,867 INFO L87 Difference]: Start difference. First operand 593 states and 865 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:42:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:19,941 INFO L93 Difference]: Finished difference Result 1137 states and 1666 transitions. [2025-02-05 15:42:19,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:19,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2025-02-05 15:42:19,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:19,948 INFO L225 Difference]: With dead ends: 1137 [2025-02-05 15:42:19,949 INFO L226 Difference]: Without dead ends: 590 [2025-02-05 15:42:19,950 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:42:19,951 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 803 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:19,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 867 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-02-05 15:42:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-02-05 15:42:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 442 states have (on average 1.4547511312217194) internal successors, (643), 453 states have internal predecessors, (643), 103 states have call successors, (103), 44 states have call predecessors, (103), 44 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 15:42:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 848 transitions. [2025-02-05 15:42:19,993 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 848 transitions. Word has length 157 [2025-02-05 15:42:19,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:19,994 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 848 transitions. [2025-02-05 15:42:19,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:42:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 848 transitions. [2025-02-05 15:42:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 15:42:19,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:19,998 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] [2025-02-05 15:42:19,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:42:19,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:19,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:19,998 INFO L85 PathProgramCache]: Analyzing trace with hash 934916097, now seen corresponding path program 1 times [2025-02-05 15:42:19,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:19,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278852209] [2025-02-05 15:42:19,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:19,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:20,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:42:20,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:42:20,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:20,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:20,289 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:42:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:20,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278852209] [2025-02-05 15:42:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278852209] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:20,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525606817] [2025-02-05 15:42:20,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:20,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:20,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:20,292 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:42:20,294 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:42:20,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:42:20,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:42:20,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:20,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:20,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:42:20,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:20,716 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:42:20,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:20,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525606817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:20,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:20,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:42:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111009461] [2025-02-05 15:42:20,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:20,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:20,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:20,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:42:20,718 INFO L87 Difference]: Start difference. First operand 590 states and 848 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:20,767 INFO L93 Difference]: Finished difference Result 915 states and 1297 transitions. [2025-02-05 15:42:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:20,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 168 [2025-02-05 15:42:20,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:20,772 INFO L225 Difference]: With dead ends: 915 [2025-02-05 15:42:20,772 INFO L226 Difference]: Without dead ends: 592 [2025-02-05 15:42:20,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 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:42:20,774 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 0 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1688 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:42:20,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1688 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-05 15:42:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-02-05 15:42:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 444 states have (on average 1.4527027027027026) internal successors, (645), 455 states have internal predecessors, (645), 103 states have call successors, (103), 44 states have call predecessors, (103), 44 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 15:42:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 850 transitions. [2025-02-05 15:42:20,808 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 850 transitions. Word has length 168 [2025-02-05 15:42:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:20,809 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 850 transitions. [2025-02-05 15:42:20,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 850 transitions. [2025-02-05 15:42:20,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 15:42:20,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:20,812 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] [2025-02-05 15:42:20,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:42:21,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:21,014 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:21,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash 668935025, now seen corresponding path program 1 times [2025-02-05 15:42:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:21,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520889212] [2025-02-05 15:42:21,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:21,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:21,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:42:21,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:42:21,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:21,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:21,369 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:42:21,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:21,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520889212] [2025-02-05 15:42:21,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520889212] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:21,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168984051] [2025-02-05 15:42:21,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:21,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:21,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:21,375 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:42:21,380 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:42:21,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:42:21,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:42:21,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:21,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:21,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:42:21,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:42:21,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:21,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168984051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:21,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:21,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:42:21,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578304577] [2025-02-05 15:42:21,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:21,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:21,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:21,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:21,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:42:21,838 INFO L87 Difference]: Start difference. First operand 592 states and 850 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:42:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:21,883 INFO L93 Difference]: Finished difference Result 1203 states and 1760 transitions. [2025-02-05 15:42:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:21,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 182 [2025-02-05 15:42:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:21,889 INFO L225 Difference]: With dead ends: 1203 [2025-02-05 15:42:21,889 INFO L226 Difference]: Without dead ends: 689 [2025-02-05 15:42:21,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 182 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:42:21,893 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 165 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1657 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:42:21,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1657 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-05 15:42:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 681. [2025-02-05 15:42:21,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 519 states have (on average 1.4682080924855492) internal successors, (762), 530 states have internal predecessors, (762), 117 states have call successors, (117), 44 states have call predecessors, (117), 44 states have return successors, (116), 115 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-05 15:42:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 995 transitions. [2025-02-05 15:42:21,937 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 995 transitions. Word has length 182 [2025-02-05 15:42:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:21,937 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 995 transitions. [2025-02-05 15:42:21,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:42:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 995 transitions. [2025-02-05 15:42:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 15:42:21,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:21,940 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] [2025-02-05 15:42:21,952 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:42:22,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:22,141 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:22,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash 532255700, now seen corresponding path program 1 times [2025-02-05 15:42:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725330631] [2025-02-05 15:42:22,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:22,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 15:42:22,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 15:42:22,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:22,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:22,444 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:42:22,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:22,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725330631] [2025-02-05 15:42:22,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725330631] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:22,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747374113] [2025-02-05 15:42:22,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:22,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:22,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:22,455 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:42:22,464 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:42:22,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 15:42:22,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 15:42:22,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:22,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:22,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1426 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:42:22,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:22,934 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:42:22,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747374113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:22,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:22,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-02-05 15:42:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504097241] [2025-02-05 15:42:22,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:22,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:42:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:22,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:42:22,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:42:22,939 INFO L87 Difference]: Start difference. First operand 681 states and 995 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, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:42:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:23,074 INFO L93 Difference]: Finished difference Result 1309 states and 1927 transitions. [2025-02-05 15:42:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:42:23,081 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, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 183 [2025-02-05 15:42:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:23,087 INFO L225 Difference]: With dead ends: 1309 [2025-02-05 15:42:23,087 INFO L226 Difference]: Without dead ends: 683 [2025-02-05 15:42:23,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 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:42:23,090 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 4 mSDsluCounter, 4993 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5828 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:42:23,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5828 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:42:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-02-05 15:42:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2025-02-05 15:42:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 520 states have (on average 1.4673076923076922) internal successors, (763), 532 states have internal predecessors, (763), 117 states have call successors, (117), 44 states have call predecessors, (117), 45 states have return successors, (118), 115 states have call predecessors, (118), 116 states have call successors, (118) [2025-02-05 15:42:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 998 transitions. [2025-02-05 15:42:23,134 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 998 transitions. Word has length 183 [2025-02-05 15:42:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:23,135 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 998 transitions. [2025-02-05 15:42:23,135 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, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:42:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 998 transitions. [2025-02-05 15:42:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-05 15:42:23,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:23,140 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] [2025-02-05 15:42:23,157 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:42:23,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:23,341 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:23,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash 937060149, now seen corresponding path program 1 times [2025-02-05 15:42:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212375201] [2025-02-05 15:42:23,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:23,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:23,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-05 15:42:23,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-05 15:42:23,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:23,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:23,550 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:42:23,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212375201] [2025-02-05 15:42:23,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212375201] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:23,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080585035] [2025-02-05 15:42:23,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:23,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:23,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:23,553 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:42:23,555 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:42:23,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-05 15:42:23,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-05 15:42:23,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:23,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:23,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1427 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:42:23,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:23,934 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:42:23,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:42:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080585035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:23,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:42:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 15:42:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799760623] [2025-02-05 15:42:23,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:23,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:42:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:23,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:42:23,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:42:23,936 INFO L87 Difference]: Start difference. First operand 683 states and 998 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, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:42:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:24,034 INFO L93 Difference]: Finished difference Result 1310 states and 1931 transitions. [2025-02-05 15:42:24,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:42:24,034 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, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2025-02-05 15:42:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:24,039 INFO L225 Difference]: With dead ends: 1310 [2025-02-05 15:42:24,039 INFO L226 Difference]: Without dead ends: 685 [2025-02-05 15:42:24,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 181 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:42:24,042 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 2 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4158 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:42:24,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4158 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-02-05 15:42:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-02-05 15:42:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 534 states have internal predecessors, (764), 117 states have call successors, (117), 44 states have call predecessors, (117), 46 states have return successors, (123), 115 states have call predecessors, (123), 116 states have call successors, (123) [2025-02-05 15:42:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1004 transitions. [2025-02-05 15:42:24,111 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1004 transitions. Word has length 184 [2025-02-05 15:42:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:24,113 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1004 transitions. [2025-02-05 15:42:24,113 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, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:42:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1004 transitions. [2025-02-05 15:42:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-05 15:42:24,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:24,117 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] [2025-02-05 15:42:24,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:42:24,322 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,SelfDestructingSolverStorable8 [2025-02-05 15:42:24,322 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:24,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1045961830, now seen corresponding path program 1 times [2025-02-05 15:42:24,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:24,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971956923] [2025-02-05 15:42:24,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:24,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:24,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-05 15:42:24,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-05 15:42:24,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:24,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:24,534 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:42:24,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:24,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971956923] [2025-02-05 15:42:24,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971956923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:24,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:24,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:42:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607505179] [2025-02-05 15:42:24,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:24,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:42:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:24,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:42:24,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:42:24,536 INFO L87 Difference]: Start difference. First operand 685 states and 1004 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, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:42:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:24,629 INFO L93 Difference]: Finished difference Result 1298 states and 1918 transitions. [2025-02-05 15:42:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:42:24,630 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, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 185 [2025-02-05 15:42:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:24,634 INFO L225 Difference]: With dead ends: 1298 [2025-02-05 15:42:24,634 INFO L226 Difference]: Without dead ends: 685 [2025-02-05 15:42:24,636 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:42:24,636 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 4 mSDsluCounter, 4999 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5835 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:24,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5835 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-02-05 15:42:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-02-05 15:42:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 534 states have internal predecessors, (764), 117 states have call successors, (117), 44 states have call predecessors, (117), 46 states have return successors, (122), 115 states have call predecessors, (122), 116 states have call successors, (122) [2025-02-05 15:42:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1003 transitions. [2025-02-05 15:42:24,666 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1003 transitions. Word has length 185 [2025-02-05 15:42:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:24,667 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1003 transitions. [2025-02-05 15:42:24,667 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, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:42:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1003 transitions. [2025-02-05 15:42:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-05 15:42:24,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:24,670 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] [2025-02-05 15:42:24,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:42:24,670 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:24,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1090391725, now seen corresponding path program 2 times [2025-02-05 15:42:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:24,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551903262] [2025-02-05 15:42:24,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:42:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:24,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 186 statements into 2 equivalence classes. [2025-02-05 15:42:24,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 15:42:24,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:42:24,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 15:42:24,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:24,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551903262] [2025-02-05 15:42:24,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551903262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:24,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:24,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:42:24,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588344579] [2025-02-05 15:42:24,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:24,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:42:24,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:24,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:42:24,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:42:24,890 INFO L87 Difference]: Start difference. First operand 685 states and 1003 transitions. Second operand has 6 states, 5 states have (on average 21.4) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:42:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:24,960 INFO L93 Difference]: Finished difference Result 1295 states and 1912 transitions. [2025-02-05 15:42:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:42:24,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 186 [2025-02-05 15:42:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:24,965 INFO L225 Difference]: With dead ends: 1295 [2025-02-05 15:42:24,966 INFO L226 Difference]: Without dead ends: 685 [2025-02-05 15:42:24,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:42:24,968 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 2 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:24,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4163 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-02-05 15:42:24,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-02-05 15:42:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 534 states have internal predecessors, (764), 117 states have call successors, (117), 44 states have call predecessors, (117), 46 states have return successors, (121), 115 states have call predecessors, (121), 116 states have call successors, (121) [2025-02-05 15:42:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1002 transitions. [2025-02-05 15:42:24,996 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1002 transitions. Word has length 186 [2025-02-05 15:42:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:24,997 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1002 transitions. [2025-02-05 15:42:24,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.4) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:42:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1002 transitions. [2025-02-05 15:42:24,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 15:42:24,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:25,000 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:25,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:42:25,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:25,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:25,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1242830104, now seen corresponding path program 3 times [2025-02-05 15:42:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:25,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052238743] [2025-02-05 15:42:25,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:42:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:25,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 8 equivalence classes. [2025-02-05 15:42:25,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 140 of 187 statements. [2025-02-05 15:42:25,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:42:25,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 15:42:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052238743] [2025-02-05 15:42:25,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052238743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:25,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:25,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:42:25,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894700476] [2025-02-05 15:42:25,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:25,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:42:25,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:25,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:42:25,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:42:25,172 INFO L87 Difference]: Start difference. First operand 685 states and 1002 transitions. Second operand has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:42:25,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:25,250 INFO L93 Difference]: Finished difference Result 1297 states and 1918 transitions. [2025-02-05 15:42:25,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:42:25,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 187 [2025-02-05 15:42:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:25,255 INFO L225 Difference]: With dead ends: 1297 [2025-02-05 15:42:25,255 INFO L226 Difference]: Without dead ends: 687 [2025-02-05 15:42:25,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:42:25,258 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 1 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4177 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:42:25,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4177 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-02-05 15:42:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2025-02-05 15:42:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 522 states have (on average 1.4655172413793103) internal successors, (765), 536 states have internal predecessors, (765), 117 states have call successors, (117), 44 states have call predecessors, (117), 47 states have return successors, (126), 115 states have call predecessors, (126), 116 states have call successors, (126) [2025-02-05 15:42:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1008 transitions. [2025-02-05 15:42:25,297 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1008 transitions. Word has length 187 [2025-02-05 15:42:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:25,298 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1008 transitions. [2025-02-05 15:42:25,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.6) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:42:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1008 transitions. [2025-02-05 15:42:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 15:42:25,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:25,300 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] [2025-02-05 15:42:25,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:42:25,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:25,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash 101543003, now seen corresponding path program 1 times [2025-02-05 15:42:25,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:25,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992778561] [2025-02-05 15:42:25,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:25,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:25,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-05 15:42:25,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 15:42:25,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:25,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 15:42:25,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:25,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992778561] [2025-02-05 15:42:25,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992778561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:25,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:25,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:42:25,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378205662] [2025-02-05 15:42:25,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:25,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:42:25,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:25,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:42:25,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:42:25,522 INFO L87 Difference]: Start difference. First operand 687 states and 1008 transitions. Second operand has 8 states, 6 states have (on average 17.5) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:42:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:25,618 INFO L93 Difference]: Finished difference Result 1304 states and 1929 transitions. [2025-02-05 15:42:25,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:42:25,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.5) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 181 [2025-02-05 15:42:25,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:25,625 INFO L225 Difference]: With dead ends: 1304 [2025-02-05 15:42:25,625 INFO L226 Difference]: Without dead ends: 689 [2025-02-05 15:42:25,627 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:42:25,629 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 3 mSDsluCounter, 5004 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5841 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:25,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5841 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-02-05 15:42:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-02-05 15:42:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 523 states have (on average 1.4646271510516253) internal successors, (766), 538 states have internal predecessors, (766), 117 states have call successors, (117), 44 states have call predecessors, (117), 48 states have return successors, (128), 115 states have call predecessors, (128), 116 states have call successors, (128) [2025-02-05 15:42:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1011 transitions. [2025-02-05 15:42:25,662 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1011 transitions. Word has length 181 [2025-02-05 15:42:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:25,662 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1011 transitions. [2025-02-05 15:42:25,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.5) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:42:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1011 transitions. [2025-02-05 15:42:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 15:42:25,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:25,666 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] [2025-02-05 15:42:25,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:42:25,666 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:25,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:25,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1420341057, now seen corresponding path program 1 times [2025-02-05 15:42:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:25,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656903581] [2025-02-05 15:42:25,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:25,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:42:25,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:42:25,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:25,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:25,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:25,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656903581] [2025-02-05 15:42:25,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656903581] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:42:25,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766679984] [2025-02-05 15:42:25,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:25,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:42:25,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:42:25,799 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:42:25,801 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:42:25,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:42:26,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:42:26,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:26,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:26,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 1402 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:42:26,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:42:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:26,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:42:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766679984] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:42:26,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:42:26,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:42:26,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899795111] [2025-02-05 15:42:26,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:42:26,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:42:26,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:26,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:42:26,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:42:26,286 INFO L87 Difference]: Start difference. First operand 689 states and 1011 transitions. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:42:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:26,473 INFO L93 Difference]: Finished difference Result 1570 states and 2377 transitions. [2025-02-05 15:42:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:42:26,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 182 [2025-02-05 15:42:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:26,482 INFO L225 Difference]: With dead ends: 1570 [2025-02-05 15:42:26,483 INFO L226 Difference]: Without dead ends: 1247 [2025-02-05 15:42:26,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 361 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:42:26,485 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 634 mSDsluCounter, 2786 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:26,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 3675 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:42:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2025-02-05 15:42:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1223. [2025-02-05 15:42:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 978 states have (on average 1.51840490797546) internal successors, (1485), 993 states have internal predecessors, (1485), 196 states have call successors, (196), 44 states have call predecessors, (196), 48 states have return successors, (217), 194 states have call predecessors, (217), 195 states have call successors, (217) [2025-02-05 15:42:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1898 transitions. [2025-02-05 15:42:26,550 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1898 transitions. Word has length 182 [2025-02-05 15:42:26,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:26,550 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1898 transitions. [2025-02-05 15:42:26,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:42:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1898 transitions. [2025-02-05 15:42:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-05 15:42:26,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:26,556 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1] [2025-02-05 15:42:26,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:42:26,756 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,SelfDestructingSolverStorable13 [2025-02-05 15:42:26,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:26,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:26,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1464795532, now seen corresponding path program 1 times [2025-02-05 15:42:26,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:26,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337847344] [2025-02-05 15:42:26,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:26,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:26,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 15:42:26,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 15:42:26,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:26,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:26,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:26,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337847344] [2025-02-05 15:42:26,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337847344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:26,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:26,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:26,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83661552] [2025-02-05 15:42:26,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:26,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:26,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:26,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:26,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:26,865 INFO L87 Difference]: Start difference. First operand 1223 states and 1898 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:26,914 INFO L93 Difference]: Finished difference Result 2817 states and 4442 transitions. [2025-02-05 15:42:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:26,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 186 [2025-02-05 15:42:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:26,925 INFO L225 Difference]: With dead ends: 2817 [2025-02-05 15:42:26,926 INFO L226 Difference]: Without dead ends: 1727 [2025-02-05 15:42:26,931 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:42:26,932 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 163 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1686 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:42:26,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1686 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2025-02-05 15:42:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1719. [2025-02-05 15:42:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1395 states have (on average 1.5311827956989248) internal successors, (2136), 1410 states have internal predecessors, (2136), 275 states have call successors, (275), 44 states have call predecessors, (275), 48 states have return successors, (306), 273 states have call predecessors, (306), 274 states have call successors, (306) [2025-02-05 15:42:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2717 transitions. [2025-02-05 15:42:27,006 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2717 transitions. Word has length 186 [2025-02-05 15:42:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:27,007 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 2717 transitions. [2025-02-05 15:42:27,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2717 transitions. [2025-02-05 15:42:27,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 15:42:27,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:27,014 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1] [2025-02-05 15:42:27,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:42:27,015 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:27,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:27,015 INFO L85 PathProgramCache]: Analyzing trace with hash 636866682, now seen corresponding path program 1 times [2025-02-05 15:42:27,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:27,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5482329] [2025-02-05 15:42:27,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:27,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:27,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 15:42:27,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 15:42:27,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:27,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:27,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:27,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5482329] [2025-02-05 15:42:27,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5482329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:27,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:27,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099112054] [2025-02-05 15:42:27,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:27,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:27,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:27,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:27,091 INFO L87 Difference]: Start difference. First operand 1719 states and 2717 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:27,183 INFO L93 Difference]: Finished difference Result 4053 states and 6472 transitions. [2025-02-05 15:42:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:27,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 187 [2025-02-05 15:42:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:27,206 INFO L225 Difference]: With dead ends: 4053 [2025-02-05 15:42:27,206 INFO L226 Difference]: Without dead ends: 2528 [2025-02-05 15:42:27,212 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:42:27,214 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 161 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1682 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:42:27,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1682 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:27,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2025-02-05 15:42:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2520. [2025-02-05 15:42:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 2077 states have (on average 1.544535387578238) internal successors, (3208), 2092 states have internal predecessors, (3208), 394 states have call successors, (394), 44 states have call predecessors, (394), 48 states have return successors, (425), 392 states have call predecessors, (425), 393 states have call successors, (425) [2025-02-05 15:42:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 4027 transitions. [2025-02-05 15:42:27,353 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 4027 transitions. Word has length 187 [2025-02-05 15:42:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:27,353 INFO L471 AbstractCegarLoop]: Abstraction has 2520 states and 4027 transitions. [2025-02-05 15:42:27,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 4027 transitions. [2025-02-05 15:42:27,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 15:42:27,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:27,369 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:27,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:42:27,369 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:27,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:27,370 INFO L85 PathProgramCache]: Analyzing trace with hash 811597941, now seen corresponding path program 1 times [2025-02-05 15:42:27,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:27,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202214514] [2025-02-05 15:42:27,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:27,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:27,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 15:42:27,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 15:42:27,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:27,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:27,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:27,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202214514] [2025-02-05 15:42:27,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202214514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:27,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:27,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:27,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049114994] [2025-02-05 15:42:27,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:27,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:27,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:27,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:27,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:27,457 INFO L87 Difference]: Start difference. First operand 2520 states and 4027 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:27,584 INFO L93 Difference]: Finished difference Result 5934 states and 9577 transitions. [2025-02-05 15:42:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:27,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 188 [2025-02-05 15:42:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:27,618 INFO L225 Difference]: With dead ends: 5934 [2025-02-05 15:42:27,619 INFO L226 Difference]: Without dead ends: 3762 [2025-02-05 15:42:27,630 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:42:27,631 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 159 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1679 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:42:27,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1679 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3762 states. [2025-02-05 15:42:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3762 to 3754. [2025-02-05 15:42:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3754 states, 3149 states have (on average 1.5557319784058432) internal successors, (4899), 3164 states have internal predecessors, (4899), 556 states have call successors, (556), 44 states have call predecessors, (556), 48 states have return successors, (603), 554 states have call predecessors, (603), 555 states have call successors, (603) [2025-02-05 15:42:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3754 states to 3754 states and 6058 transitions. [2025-02-05 15:42:27,900 INFO L78 Accepts]: Start accepts. Automaton has 3754 states and 6058 transitions. Word has length 188 [2025-02-05 15:42:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:27,901 INFO L471 AbstractCegarLoop]: Abstraction has 3754 states and 6058 transitions. [2025-02-05 15:42:27,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3754 states and 6058 transitions. [2025-02-05 15:42:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 15:42:27,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:27,913 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:27,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:42:27,913 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:27,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1267398932, now seen corresponding path program 1 times [2025-02-05 15:42:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:27,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176429699] [2025-02-05 15:42:27,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:27,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 15:42:27,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 15:42:27,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:27,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:27,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176429699] [2025-02-05 15:42:27,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176429699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:27,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:27,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:27,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515439975] [2025-02-05 15:42:27,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:27,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:27,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:27,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:27,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:27,977 INFO L87 Difference]: Start difference. First operand 3754 states and 6058 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:42:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:28,096 INFO L93 Difference]: Finished difference Result 8905 states and 14498 transitions. [2025-02-05 15:42:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:28,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 196 [2025-02-05 15:42:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:28,127 INFO L225 Difference]: With dead ends: 8905 [2025-02-05 15:42:28,128 INFO L226 Difference]: Without dead ends: 5754 [2025-02-05 15:42:28,141 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:42:28,142 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 157 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1679 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:42:28,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1679 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2025-02-05 15:42:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 5746. [2025-02-05 15:42:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5746 states, 4896 states have (on average 1.56515522875817) internal successors, (7663), 4911 states have internal predecessors, (7663), 801 states have call successors, (801), 44 states have call predecessors, (801), 48 states have return successors, (874), 799 states have call predecessors, (874), 800 states have call successors, (874) [2025-02-05 15:42:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5746 states to 5746 states and 9338 transitions. [2025-02-05 15:42:28,472 INFO L78 Accepts]: Start accepts. Automaton has 5746 states and 9338 transitions. Word has length 196 [2025-02-05 15:42:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:28,473 INFO L471 AbstractCegarLoop]: Abstraction has 5746 states and 9338 transitions. [2025-02-05 15:42:28,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:42:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5746 states and 9338 transitions. [2025-02-05 15:42:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 15:42:28,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:28,494 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:28,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:42:28,494 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:28,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2084320298, now seen corresponding path program 1 times [2025-02-05 15:42:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:28,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702292700] [2025-02-05 15:42:28,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:28,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:28,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 15:42:28,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 15:42:28,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:28,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:28,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:28,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702292700] [2025-02-05 15:42:28,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702292700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:28,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:28,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317454755] [2025-02-05 15:42:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:28,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:28,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:28,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:28,577 INFO L87 Difference]: Start difference. First operand 5746 states and 9338 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:28,876 INFO L93 Difference]: Finished difference Result 13842 states and 22640 transitions. [2025-02-05 15:42:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:28,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-02-05 15:42:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:28,944 INFO L225 Difference]: With dead ends: 13842 [2025-02-05 15:42:28,945 INFO L226 Difference]: Without dead ends: 9090 [2025-02-05 15:42:28,958 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:42:28,959 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 155 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1690 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:42:28,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1690 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9090 states. [2025-02-05 15:42:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9090 to 9082. [2025-02-05 15:42:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9082 states, 7739 states have (on average 1.5632510660292027) internal successors, (12098), 7754 states have internal predecessors, (12098), 1294 states have call successors, (1294), 44 states have call predecessors, (1294), 48 states have return successors, (1411), 1292 states have call predecessors, (1411), 1293 states have call successors, (1411) [2025-02-05 15:42:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9082 states to 9082 states and 14803 transitions. [2025-02-05 15:42:29,396 INFO L78 Accepts]: Start accepts. Automaton has 9082 states and 14803 transitions. Word has length 190 [2025-02-05 15:42:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:29,396 INFO L471 AbstractCegarLoop]: Abstraction has 9082 states and 14803 transitions. [2025-02-05 15:42:29,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 9082 states and 14803 transitions. [2025-02-05 15:42:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 15:42:29,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:29,418 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:29,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:42:29,419 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:29,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash -143468179, now seen corresponding path program 1 times [2025-02-05 15:42:29,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:29,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191469012] [2025-02-05 15:42:29,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:29,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:29,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 15:42:29,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 15:42:29,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:29,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:29,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:29,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191469012] [2025-02-05 15:42:29,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191469012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:29,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:29,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:29,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596437215] [2025-02-05 15:42:29,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:29,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:29,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:29,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:29,506 INFO L87 Difference]: Start difference. First operand 9082 states and 14803 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:42:29,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:29,893 INFO L93 Difference]: Finished difference Result 22690 states and 37300 transitions. [2025-02-05 15:42:29,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:29,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 198 [2025-02-05 15:42:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:29,953 INFO L225 Difference]: With dead ends: 22690 [2025-02-05 15:42:29,954 INFO L226 Difference]: Without dead ends: 15092 [2025-02-05 15:42:29,982 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:42:29,984 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 153 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1684 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:42:29,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1684 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15092 states. [2025-02-05 15:42:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15092 to 15084. [2025-02-05 15:42:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15084 states, 12919 states have (on average 1.5696261320535645) internal successors, (20278), 12934 states have internal predecessors, (20278), 2116 states have call successors, (2116), 44 states have call predecessors, (2116), 48 states have return successors, (2311), 2114 states have call predecessors, (2311), 2115 states have call successors, (2311) [2025-02-05 15:42:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15084 states to 15084 states and 24705 transitions. [2025-02-05 15:42:30,628 INFO L78 Accepts]: Start accepts. Automaton has 15084 states and 24705 transitions. Word has length 198 [2025-02-05 15:42:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:30,629 INFO L471 AbstractCegarLoop]: Abstraction has 15084 states and 24705 transitions. [2025-02-05 15:42:30,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:42:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 15084 states and 24705 transitions. [2025-02-05 15:42:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 15:42:30,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:30,651 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:30,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:42:30,651 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:30,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash 250716055, now seen corresponding path program 1 times [2025-02-05 15:42:30,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:30,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100170634] [2025-02-05 15:42:30,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:30,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:30,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 15:42:30,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 15:42:30,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:30,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:30,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:30,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100170634] [2025-02-05 15:42:30,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100170634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:30,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:30,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:30,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962725355] [2025-02-05 15:42:30,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:30,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:30,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:30,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:30,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:30,714 INFO L87 Difference]: Start difference. First operand 15084 states and 24705 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:31,187 INFO L93 Difference]: Finished difference Result 36297 states and 59201 transitions. [2025-02-05 15:42:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:31,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2025-02-05 15:42:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:31,289 INFO L225 Difference]: With dead ends: 36297 [2025-02-05 15:42:31,290 INFO L226 Difference]: Without dead ends: 23824 [2025-02-05 15:42:31,327 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:42:31,328 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 151 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1669 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:42:31,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23824 states. [2025-02-05 15:42:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23824 to 23816. [2025-02-05 15:42:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23816 states, 20448 states have (on average 1.543378325508607) internal successors, (31559), 20463 states have internal predecessors, (31559), 3319 states have call successors, (3319), 44 states have call predecessors, (3319), 48 states have return successors, (3658), 3317 states have call predecessors, (3658), 3318 states have call successors, (3658) [2025-02-05 15:42:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23816 states to 23816 states and 38536 transitions. [2025-02-05 15:42:32,334 INFO L78 Accepts]: Start accepts. Automaton has 23816 states and 38536 transitions. Word has length 192 [2025-02-05 15:42:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:32,335 INFO L471 AbstractCegarLoop]: Abstraction has 23816 states and 38536 transitions. [2025-02-05 15:42:32,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 23816 states and 38536 transitions. [2025-02-05 15:42:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 15:42:32,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:32,371 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:32,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:42:32,371 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:32,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash -919732009, now seen corresponding path program 1 times [2025-02-05 15:42:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:32,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005901804] [2025-02-05 15:42:32,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:32,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:32,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 15:42:32,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 15:42:32,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:32,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:32,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005901804] [2025-02-05 15:42:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005901804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474456385] [2025-02-05 15:42:32,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:32,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:32,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:32,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:32,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:32,451 INFO L87 Difference]: Start difference. First operand 23816 states and 38536 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:33,386 INFO L93 Difference]: Finished difference Result 62755 states and 101954 transitions. [2025-02-05 15:42:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:33,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2025-02-05 15:42:33,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:33,796 INFO L225 Difference]: With dead ends: 62755 [2025-02-05 15:42:33,796 INFO L226 Difference]: Without dead ends: 42354 [2025-02-05 15:42:33,835 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:42:33,838 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 149 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1683 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:42:33,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1683 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:33,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42354 states. [2025-02-05 15:42:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42354 to 42346. [2025-02-05 15:42:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42346 states, 36528 states have (on average 1.543829391151993) internal successors, (56393), 36543 states have internal predecessors, (56393), 5769 states have call successors, (5769), 44 states have call predecessors, (5769), 48 states have return successors, (6382), 5767 states have call predecessors, (6382), 5768 states have call successors, (6382) [2025-02-05 15:42:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42346 states to 42346 states and 68544 transitions. [2025-02-05 15:42:35,055 INFO L78 Accepts]: Start accepts. Automaton has 42346 states and 68544 transitions. Word has length 193 [2025-02-05 15:42:35,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:35,055 INFO L471 AbstractCegarLoop]: Abstraction has 42346 states and 68544 transitions. [2025-02-05 15:42:35,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 42346 states and 68544 transitions. [2025-02-05 15:42:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 15:42:35,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:35,083 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:35,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:42:35,083 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:35,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1306045144, now seen corresponding path program 1 times [2025-02-05 15:42:35,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:35,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855174515] [2025-02-05 15:42:35,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:35,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:35,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 15:42:35,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 15:42:35,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:35,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:35,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855174515] [2025-02-05 15:42:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855174515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:35,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:35,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:35,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544703355] [2025-02-05 15:42:35,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:35,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:35,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:35,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:35,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:35,149 INFO L87 Difference]: Start difference. First operand 42346 states and 68544 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:37,355 INFO L93 Difference]: Finished difference Result 114637 states and 186596 transitions. [2025-02-05 15:42:37,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:37,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 194 [2025-02-05 15:42:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:37,899 INFO L225 Difference]: With dead ends: 114637 [2025-02-05 15:42:37,899 INFO L226 Difference]: Without dead ends: 76873 [2025-02-05 15:42:38,080 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:42:38,081 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 147 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1693 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:42:38,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1693 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76873 states. [2025-02-05 15:42:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76873 to 76865. [2025-02-05 15:42:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76865 states, 66534 states have (on average 1.5479604412781436) internal successors, (102992), 66549 states have internal predecessors, (102992), 10282 states have call successors, (10282), 44 states have call predecessors, (10282), 48 states have return successors, (11427), 10280 states have call predecessors, (11427), 10281 states have call successors, (11427) [2025-02-05 15:42:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76865 states to 76865 states and 124701 transitions. [2025-02-05 15:42:41,472 INFO L78 Accepts]: Start accepts. Automaton has 76865 states and 124701 transitions. Word has length 194 [2025-02-05 15:42:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:41,473 INFO L471 AbstractCegarLoop]: Abstraction has 76865 states and 124701 transitions. [2025-02-05 15:42:41,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 76865 states and 124701 transitions. [2025-02-05 15:42:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 15:42:41,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:41,513 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:41,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:42:41,513 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash -566022122, now seen corresponding path program 1 times [2025-02-05 15:42:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:41,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153493203] [2025-02-05 15:42:41,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:41,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:41,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 15:42:41,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 15:42:41,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:41,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153493203] [2025-02-05 15:42:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153493203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:41,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655770799] [2025-02-05 15:42:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:41,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:41,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:41,598 INFO L87 Difference]: Start difference. First operand 76865 states and 124701 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:44,561 INFO L93 Difference]: Finished difference Result 143588 states and 233778 transitions. [2025-02-05 15:42:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:44,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 195 [2025-02-05 15:42:44,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:45,246 INFO L225 Difference]: With dead ends: 143588 [2025-02-05 15:42:45,247 INFO L226 Difference]: Without dead ends: 143265 [2025-02-05 15:42:45,307 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:42:45,309 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 141 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1698 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:42:45,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1698 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:45,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143265 states. [2025-02-05 15:42:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143265 to 143257. [2025-02-05 15:42:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143257 states, 124558 states have (on average 1.5473915766149102) internal successors, (192740), 124573 states have internal predecessors, (192740), 18650 states have call successors, (18650), 44 states have call predecessors, (18650), 48 states have return successors, (20841), 18648 states have call predecessors, (20841), 18649 states have call successors, (20841) [2025-02-05 15:42:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143257 states to 143257 states and 232231 transitions. [2025-02-05 15:42:51,102 INFO L78 Accepts]: Start accepts. Automaton has 143257 states and 232231 transitions. Word has length 195 [2025-02-05 15:42:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:51,102 INFO L471 AbstractCegarLoop]: Abstraction has 143257 states and 232231 transitions. [2025-02-05 15:42:51,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:42:51,103 INFO L276 IsEmpty]: Start isEmpty. Operand 143257 states and 232231 transitions. [2025-02-05 15:42:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 15:42:51,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:51,139 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 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:42:51,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 15:42:51,139 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:51,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1711647892, now seen corresponding path program 1 times [2025-02-05 15:42:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:51,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431020507] [2025-02-05 15:42:51,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:51,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 15:42:51,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 15:42:51,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:51,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:42:51,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:51,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431020507] [2025-02-05 15:42:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431020507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 15:42:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719774470] [2025-02-05 15:42:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:51,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:42:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:51,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:42:51,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:42:51,508 INFO L87 Difference]: Start difference. First operand 143257 states and 232231 transitions. Second operand has 14 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 7 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (24), 7 states have call predecessors, (24), 7 states have call successors, (24)