./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product34.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_spec8_product34.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 9b6f1572bb543b70f7bd76f4bd7f000d1e6bbc46b09feb0ab48e04376b774bb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:48:41,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:48:41,319 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:48:41,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:48:41,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:48:41,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:48:41,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:48:41,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:48:41,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:48:41,345 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:48:41,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:48:41,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:48:41,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:48:41,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:48:41,346 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:48:41,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:48:41,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:48:41,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:48:41,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:48:41,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:48:41,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:48:41,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:48:41,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:48:41,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:48:41,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:48:41,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:48:41,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:48:41,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:48:41,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:48:41,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:48:41,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:48:41,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:48:41,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:41,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:48:41,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:48:41,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:48:41,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:48:41,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:48:41,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:48:41,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:48:41,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:48:41,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:48:41,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:48:41,349 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 -> 9b6f1572bb543b70f7bd76f4bd7f000d1e6bbc46b09feb0ab48e04376b774bb9 [2025-02-05 15:48:41,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:48:41,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:48:41,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:48:41,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:48:41,593 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:48:41,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product34.cil.c [2025-02-05 15:48:42,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b977dc2/05f80179215548f58a754d9f37c36c4d/FLAG17b2e2858 [2025-02-05 15:48:43,141 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:48:43,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product34.cil.c [2025-02-05 15:48:43,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b977dc2/05f80179215548f58a754d9f37c36c4d/FLAG17b2e2858 [2025-02-05 15:48:43,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89b977dc2/05f80179215548f58a754d9f37c36c4d [2025-02-05 15:48:43,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:48:43,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:48:43,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:43,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:48:43,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:48:43,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:43,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bee783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43, skipping insertion in model container [2025-02-05 15:48:43,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:43,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:48:43,640 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_spec8_product34.cil.c[28285,28298] [2025-02-05 15:48:43,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:43,832 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:48:43,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-02-05 15:48:43,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [66] [2025-02-05 15:48:43,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [115] [2025-02-05 15:48:43,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1195] [2025-02-05 15:48:43,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [1204] [2025-02-05 15:48:43,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1248] [2025-02-05 15:48:43,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1614] [2025-02-05 15:48:43,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1919] [2025-02-05 15:48:43,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2334] [2025-02-05 15:48:43,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2733] [2025-02-05 15:48:43,842 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2952] [2025-02-05 15:48:43,876 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_spec8_product34.cil.c[28285,28298] [2025-02-05 15:48:43,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:43,949 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:48:43,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43 WrapperNode [2025-02-05 15:48:43,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:43,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:43,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:48:43,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:48:43,957 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:48:43" (1/1) ... [2025-02-05 15:48:43,976 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:48:43" (1/1) ... [2025-02-05 15:48:44,013 INFO L138 Inliner]: procedures = 135, calls = 222, calls flagged for inlining = 63, calls inlined = 60, statements flattened = 1114 [2025-02-05 15:48:44,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:44,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:48:44,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:48:44,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:48:44,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:44,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:44,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:44,058 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:48:44,059 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:44,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:44,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:44,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:44,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:44,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:44,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:48:44,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:48:44,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:48:44,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:48:44,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (1/1) ... [2025-02-05 15:48:44,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:44,131 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:48:44,135 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:48:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:48:44,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:48:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:48:44,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:48:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:48:44,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:48:44,156 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:48:44,157 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:48:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:48:44,157 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:48:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:48:44,157 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:48:44,157 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:48:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:48:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:48:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:48:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:48:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:48:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:48:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:48:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:48:44,158 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:48:44,158 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:48:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:48:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:48:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:48:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:48:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:48:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:48:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:48:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:48:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:48:44,159 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:48:44,159 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:48:44,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:48:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:48:44,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:48:44,160 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:48:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:48:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:48:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:48:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-02-05 15:48:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-02-05 15:48:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:48:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:48:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:48:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:48:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:48:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:48:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:48:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:48:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:48:44,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:48:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:48:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:48:44,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:48:44,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:48:44,162 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:48:44,162 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:48:44,162 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:48:44,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:48:44,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:48:44,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:48:44,331 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:48:44,334 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:48:44,430 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2640: #res := ~retValue_acc~37; [2025-02-05 15:48:44,439 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2233: #res := ~retValue_acc~28; [2025-02-05 15:48:44,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L829: #res#1 := ~retValue_acc~14#1; [2025-02-05 15:48:44,483 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L784-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~13#1; [2025-02-05 15:48:44,687 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2714-1: isVerified_#res#1 := isVerified_~retValue_acc~39#1; [2025-02-05 15:48:44,687 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2377-1: getEmailId_#res#1 := getEmailId_~retValue_acc~30#1; [2025-02-05 15:48:44,687 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1172-1: getClientId_#res#1 := getClientId_~retValue_acc~19#1; [2025-02-05 15:48:44,687 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1125-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~18#1; [2025-02-05 15:48:44,704 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1053: #res := ~retValue_acc~17; [2025-02-05 15:48:44,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: #res := ~retValue_acc~12; [2025-02-05 15:48:44,720 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2025-02-05 15:48:44,726 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L281: #res := ~retValue_acc~6; [2025-02-05 15:48:44,735 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: #res := ~retValue_acc~35; [2025-02-05 15:48:44,759 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2603: #res := ~retValue_acc~36; [2025-02-05 15:48:44,764 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2677: #res := ~retValue_acc~38; [2025-02-05 15:48:44,780 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: #res := ~retValue_acc~32; [2025-02-05 15:48:44,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L607: #res := ~retValue_acc~10; [2025-02-05 15:48:45,015 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2199-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~26#1; [2025-02-05 15:48:45,016 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L999-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~16#1; [2025-02-05 15:48:45,016 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2190-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~25#1; [2025-02-05 15:48:45,016 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2208-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~27#1; [2025-02-05 15:48:45,016 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2025-02-05 15:48:45,016 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L892-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~15#1; [2025-02-05 15:48:45,020 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2414: #res := ~retValue_acc~31; [2025-02-05 15:48:45,028 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3040-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~40#1; [2025-02-05 15:48:45,028 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: #res#1 := ~retValue_acc~41#1; [2025-02-05 15:48:45,196 INFO L? ?]: Removed 586 outVars from TransFormulas that were not future-live. [2025-02-05 15:48:45,196 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:48:45,212 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:48:45,216 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:48:45,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:48:45 BoogieIcfgContainer [2025-02-05 15:48:45,217 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:48:45,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:48:45,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:48:45,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:48:45,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:48:43" (1/3) ... [2025-02-05 15:48:45,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774c13cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:48:45, skipping insertion in model container [2025-02-05 15:48:45,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:43" (2/3) ... [2025-02-05 15:48:45,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774c13cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:48:45, skipping insertion in model container [2025-02-05 15:48:45,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:48:45" (3/3) ... [2025-02-05 15:48:45,231 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product34.cil.c [2025-02-05 15:48:45,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:48:45,251 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product34.cil.c that has 29 procedures, 447 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:48:45,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:48:45,327 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;@2e2bed9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:48:45,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:48:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 447 states, 346 states have (on average 1.5346820809248556) internal successors, (531), 351 states have internal predecessors, (531), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-05 15:48:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:48:45,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:45,344 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:45,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:45,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:45,350 INFO L85 PathProgramCache]: Analyzing trace with hash 538493942, now seen corresponding path program 1 times [2025-02-05 15:48:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:45,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774889697] [2025-02-05 15:48:45,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:45,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:45,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:48:45,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:48:45,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:45,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:48:45,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:45,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774889697] [2025-02-05 15:48:45,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774889697] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:45,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236171834] [2025-02-05 15:48:45,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:45,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:45,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:45,944 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:48:45,946 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:48:46,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:48:46,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:48:46,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:46,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:48:46,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:46,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:46,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236171834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:46,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:46,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:48:46,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707820409] [2025-02-05 15:48:46,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:46,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:48:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:46,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:48:46,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:46,333 INFO L87 Difference]: Start difference. First operand has 447 states, 346 states have (on average 1.5346820809248556) internal successors, (531), 351 states have internal predecessors, (531), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:46,384 INFO L93 Difference]: Finished difference Result 702 states and 1038 transitions. [2025-02-05 15:48:46,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:48:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-02-05 15:48:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:46,404 INFO L225 Difference]: With dead ends: 702 [2025-02-05 15:48:46,404 INFO L226 Difference]: Without dead ends: 440 [2025-02-05 15:48:46,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 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:48:46,414 INFO L435 NwaCegarLoop]: 670 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, 670 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:48:46,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-05 15:48:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-02-05 15:48:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 340 states have (on average 1.5323529411764707) internal successors, (521), 344 states have internal predecessors, (521), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 15:48:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 662 transitions. [2025-02-05 15:48:46,483 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 662 transitions. Word has length 110 [2025-02-05 15:48:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:46,484 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 662 transitions. [2025-02-05 15:48:46,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 662 transitions. [2025-02-05 15:48:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:48:46,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:46,491 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:46,500 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:48:46,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:48:46,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:46,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:46,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1895472175, now seen corresponding path program 1 times [2025-02-05 15:48:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:46,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018937175] [2025-02-05 15:48:46,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:46,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:48:46,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:48:46,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:46,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:48:46,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:46,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018937175] [2025-02-05 15:48:46,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018937175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:46,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428919523] [2025-02-05 15:48:46,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:46,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:46,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:46,915 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:48:46,916 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:48:47,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:48:47,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:48:47,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:47,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:47,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:48:47,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:47,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:47,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428919523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:47,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:47,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:48:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202991623] [2025-02-05 15:48:47,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:47,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:47,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:47,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:47,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:47,188 INFO L87 Difference]: Start difference. First operand 440 states and 662 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:47,238 INFO L93 Difference]: Finished difference Result 691 states and 1016 transitions. [2025-02-05 15:48:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:47,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2025-02-05 15:48:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:47,246 INFO L225 Difference]: With dead ends: 691 [2025-02-05 15:48:47,247 INFO L226 Difference]: Without dead ends: 442 [2025-02-05 15:48:47,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 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:48:47,248 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 0 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1320 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:48:47,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-02-05 15:48:47,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-02-05 15:48:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 342 states have (on average 1.5292397660818713) internal successors, (523), 346 states have internal predecessors, (523), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 15:48:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 664 transitions. [2025-02-05 15:48:47,283 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 664 transitions. Word has length 111 [2025-02-05 15:48:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:47,284 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 664 transitions. [2025-02-05 15:48:47,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:47,284 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 664 transitions. [2025-02-05 15:48:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:48:47,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:47,287 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:47,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:47,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:47,488 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:47,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash 175040811, now seen corresponding path program 1 times [2025-02-05 15:48:47,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572759763] [2025-02-05 15:48:47,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:47,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:48:47,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:48:47,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:47,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:47,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:47,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572759763] [2025-02-05 15:48:47,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572759763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149912716] [2025-02-05 15:48:47,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:47,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:47,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:47,714 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:48:47,716 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:48:47,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:48:47,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:48:47,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:47,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:47,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:47,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:48,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:48,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149912716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:48,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:48,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:48:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696575566] [2025-02-05 15:48:48,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:48,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:48,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:48,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:48,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:48,016 INFO L87 Difference]: Start difference. First operand 442 states and 664 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:48,064 INFO L93 Difference]: Finished difference Result 931 states and 1419 transitions. [2025-02-05 15:48:48,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:48,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-02-05 15:48:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:48,071 INFO L225 Difference]: With dead ends: 931 [2025-02-05 15:48:48,071 INFO L226 Difference]: Without dead ends: 516 [2025-02-05 15:48:48,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 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:48:48,075 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 134 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:48,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1282 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-05 15:48:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 508. [2025-02-05 15:48:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 394 states have (on average 1.5507614213197969) internal successors, (611), 398 states have internal predecessors, (611), 85 states have call successors, (85), 28 states have call predecessors, (85), 28 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 15:48:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 780 transitions. [2025-02-05 15:48:48,107 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 780 transitions. Word has length 116 [2025-02-05 15:48:48,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:48,107 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 780 transitions. [2025-02-05 15:48:48,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 780 transitions. [2025-02-05 15:48:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:48:48,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:48,110 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:48,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:48,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:48,311 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:48,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1832787498, now seen corresponding path program 1 times [2025-02-05 15:48:48,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:48,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359098279] [2025-02-05 15:48:48,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:48,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:48:48,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:48:48,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:48,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:48,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359098279] [2025-02-05 15:48:48,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359098279] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514807646] [2025-02-05 15:48:48,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:48,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:48,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:48,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:48,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:48:48,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:48:48,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:48:48,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:48,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:48,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:48:48,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:48:48,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:48,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514807646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:48,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:48,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:48:48,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147546043] [2025-02-05 15:48:48,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:48,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:48,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:48,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:48,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:48:48,780 INFO L87 Difference]: Start difference. First operand 508 states and 780 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:48,853 INFO L93 Difference]: Finished difference Result 1007 states and 1550 transitions. [2025-02-05 15:48:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:48,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-02-05 15:48:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:48,857 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 15:48:48,860 INFO L226 Difference]: Without dead ends: 510 [2025-02-05 15:48:48,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:48:48,863 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 2 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:48,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2605 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-02-05 15:48:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-02-05 15:48:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 395 states have (on average 1.549367088607595) internal successors, (612), 400 states have internal predecessors, (612), 85 states have call successors, (85), 28 states have call predecessors, (85), 29 states have return successors, (86), 83 states have call predecessors, (86), 84 states have call successors, (86) [2025-02-05 15:48:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 783 transitions. [2025-02-05 15:48:48,894 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 783 transitions. Word has length 117 [2025-02-05 15:48:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:48,895 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 783 transitions. [2025-02-05 15:48:48,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 783 transitions. [2025-02-05 15:48:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:48:48,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:48,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:48,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:49,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:49,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:49,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:49,102 INFO L85 PathProgramCache]: Analyzing trace with hash -209401235, now seen corresponding path program 1 times [2025-02-05 15:48:49,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:49,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769839139] [2025-02-05 15:48:49,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:49,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:49,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:48:49,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:48:49,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:49,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:48:49,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:49,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769839139] [2025-02-05 15:48:49,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769839139] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:49,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736274126] [2025-02-05 15:48:49,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:49,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:49,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:49,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:49,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:48:49,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:48:49,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:48:49,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:49,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:49,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:48:49,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:48:49,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:49,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736274126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:49,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:49,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:48:49,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843894418] [2025-02-05 15:48:49,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:49,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:49,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:49,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:49,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:49,546 INFO L87 Difference]: Start difference. First operand 510 states and 783 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:49,616 INFO L93 Difference]: Finished difference Result 1009 states and 1555 transitions. [2025-02-05 15:48:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:49,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-02-05 15:48:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:49,620 INFO L225 Difference]: With dead ends: 1009 [2025-02-05 15:48:49,620 INFO L226 Difference]: Without dead ends: 512 [2025-02-05 15:48:49,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:49,622 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 2 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:49,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2591 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-02-05 15:48:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-02-05 15:48:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 396 states have (on average 1.547979797979798) internal successors, (613), 402 states have internal predecessors, (613), 85 states have call successors, (85), 28 states have call predecessors, (85), 30 states have return successors, (91), 83 states have call predecessors, (91), 84 states have call successors, (91) [2025-02-05 15:48:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 789 transitions. [2025-02-05 15:48:49,648 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 789 transitions. Word has length 118 [2025-02-05 15:48:49,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:49,649 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 789 transitions. [2025-02-05 15:48:49,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 789 transitions. [2025-02-05 15:48:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:48:49,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:49,652 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:49,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:49,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:49,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:49,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1014194421, now seen corresponding path program 1 times [2025-02-05 15:48:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:49,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382044201] [2025-02-05 15:48:49,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:49,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:49,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:48:49,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:48:49,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:49,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:49,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382044201] [2025-02-05 15:48:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382044201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:49,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:49,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434600816] [2025-02-05 15:48:49,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:49,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:49,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:49,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:49,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:49,971 INFO L87 Difference]: Start difference. First operand 512 states and 789 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:50,008 INFO L93 Difference]: Finished difference Result 1001 states and 1546 transitions. [2025-02-05 15:48:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:50,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-02-05 15:48:50,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:50,012 INFO L225 Difference]: With dead ends: 1001 [2025-02-05 15:48:50,013 INFO L226 Difference]: Without dead ends: 512 [2025-02-05 15:48:50,014 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:48:50,015 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 2 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:50,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2609 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-02-05 15:48:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-02-05 15:48:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 396 states have (on average 1.547979797979798) internal successors, (613), 402 states have internal predecessors, (613), 85 states have call successors, (85), 28 states have call predecessors, (85), 30 states have return successors, (90), 83 states have call predecessors, (90), 84 states have call successors, (90) [2025-02-05 15:48:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 788 transitions. [2025-02-05 15:48:50,032 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 788 transitions. Word has length 119 [2025-02-05 15:48:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:50,032 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 788 transitions. [2025-02-05 15:48:50,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 788 transitions. [2025-02-05 15:48:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:48:50,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:50,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:50,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:48:50,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:50,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 534543514, now seen corresponding path program 2 times [2025-02-05 15:48:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439773908] [2025-02-05 15:48:50,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:48:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:50,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-02-05 15:48:50,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:48:50,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:48:50,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:50,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:50,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439773908] [2025-02-05 15:48:50,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439773908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:50,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:50,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:50,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320260120] [2025-02-05 15:48:50,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:50,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:50,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:50,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:50,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:50,171 INFO L87 Difference]: Start difference. First operand 512 states and 788 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:50,216 INFO L93 Difference]: Finished difference Result 999 states and 1541 transitions. [2025-02-05 15:48:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:50,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-02-05 15:48:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:50,220 INFO L225 Difference]: With dead ends: 999 [2025-02-05 15:48:50,221 INFO L226 Difference]: Without dead ends: 512 [2025-02-05 15:48:50,222 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:48:50,223 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 2 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:50,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2595 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-02-05 15:48:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-02-05 15:48:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 396 states have (on average 1.547979797979798) internal successors, (613), 402 states have internal predecessors, (613), 85 states have call successors, (85), 28 states have call predecessors, (85), 30 states have return successors, (89), 83 states have call predecessors, (89), 84 states have call successors, (89) [2025-02-05 15:48:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 787 transitions. [2025-02-05 15:48:50,242 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 787 transitions. Word has length 120 [2025-02-05 15:48:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:50,243 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 787 transitions. [2025-02-05 15:48:50,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 787 transitions. [2025-02-05 15:48:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:48:50,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:50,245 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:50,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:48:50,245 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:50,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:50,246 INFO L85 PathProgramCache]: Analyzing trace with hash 194353092, now seen corresponding path program 3 times [2025-02-05 15:48:50,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:50,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404228956] [2025-02-05 15:48:50,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:48:50,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:50,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 3 equivalence classes. [2025-02-05 15:48:50,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 109 of 121 statements. [2025-02-05 15:48:50,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:48:50,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404228956] [2025-02-05 15:48:50,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404228956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:50,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:50,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:50,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759595799] [2025-02-05 15:48:50,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:50,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:50,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:50,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:50,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:50,366 INFO L87 Difference]: Start difference. First operand 512 states and 787 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:50,434 INFO L93 Difference]: Finished difference Result 1001 states and 1547 transitions. [2025-02-05 15:48:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:50,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-02-05 15:48:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:50,439 INFO L225 Difference]: With dead ends: 1001 [2025-02-05 15:48:50,439 INFO L226 Difference]: Without dead ends: 514 [2025-02-05 15:48:50,441 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:48:50,441 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 1 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:50,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2606 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-02-05 15:48:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-02-05 15:48:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 397 states have (on average 1.5465994962216625) internal successors, (614), 404 states have internal predecessors, (614), 85 states have call successors, (85), 28 states have call predecessors, (85), 31 states have return successors, (94), 83 states have call predecessors, (94), 84 states have call successors, (94) [2025-02-05 15:48:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 793 transitions. [2025-02-05 15:48:50,463 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 793 transitions. Word has length 121 [2025-02-05 15:48:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:50,463 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 793 transitions. [2025-02-05 15:48:50,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 793 transitions. [2025-02-05 15:48:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:48:50,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:50,466 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:50,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:48:50,466 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:50,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash -498993059, now seen corresponding path program 1 times [2025-02-05 15:48:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553602929] [2025-02-05 15:48:50,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:50,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:48:50,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:48:50,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:50,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:50,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:50,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553602929] [2025-02-05 15:48:50,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553602929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:50,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:50,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:50,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761151155] [2025-02-05 15:48:50,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:50,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:50,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:50,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:50,598 INFO L87 Difference]: Start difference. First operand 514 states and 793 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:50,649 INFO L93 Difference]: Finished difference Result 1007 states and 1557 transitions. [2025-02-05 15:48:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-02-05 15:48:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:50,653 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 15:48:50,653 INFO L226 Difference]: Without dead ends: 516 [2025-02-05 15:48:50,655 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:48:50,655 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 1 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:50,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2612 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-05 15:48:50,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-02-05 15:48:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 398 states have (on average 1.5452261306532664) internal successors, (615), 406 states have internal predecessors, (615), 85 states have call successors, (85), 28 states have call predecessors, (85), 32 states have return successors, (96), 83 states have call predecessors, (96), 84 states have call successors, (96) [2025-02-05 15:48:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 796 transitions. [2025-02-05 15:48:50,673 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 796 transitions. Word has length 122 [2025-02-05 15:48:50,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:50,674 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 796 transitions. [2025-02-05 15:48:50,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:50,674 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 796 transitions. [2025-02-05 15:48:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:48:50,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:50,676 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:50,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:48:50,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:50,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1868897765, now seen corresponding path program 1 times [2025-02-05 15:48:50,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:50,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635172705] [2025-02-05 15:48:50,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:50,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:50,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:48:50,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:48:50,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:50,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:50,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:50,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635172705] [2025-02-05 15:48:50,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635172705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:50,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298422565] [2025-02-05 15:48:50,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:50,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:50,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:50,801 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:50,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:48:50,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:48:51,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:48:51,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:51,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:51,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:51,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:51,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:48:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298422565] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:48:51,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:48:51,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:48:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079055913] [2025-02-05 15:48:51,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:48:51,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:48:51,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:51,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:48:51,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:48:51,161 INFO L87 Difference]: Start difference. First operand 516 states and 796 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:48:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:51,314 INFO L93 Difference]: Finished difference Result 1202 states and 1916 transitions. [2025-02-05 15:48:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:48:51,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 123 [2025-02-05 15:48:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:51,321 INFO L225 Difference]: With dead ends: 1202 [2025-02-05 15:48:51,321 INFO L226 Difference]: Without dead ends: 953 [2025-02-05 15:48:51,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:48:51,323 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 619 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:51,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 2967 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:48:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-02-05 15:48:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 929. [2025-02-05 15:48:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 732 states have (on average 1.616120218579235) internal successors, (1183), 740 states have internal predecessors, (1183), 164 states have call successors, (164), 28 states have call predecessors, (164), 32 states have return successors, (185), 162 states have call predecessors, (185), 163 states have call successors, (185) [2025-02-05 15:48:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1532 transitions. [2025-02-05 15:48:51,356 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1532 transitions. Word has length 123 [2025-02-05 15:48:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:51,356 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1532 transitions. [2025-02-05 15:48:51,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:48:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1532 transitions. [2025-02-05 15:48:51,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:48:51,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:51,361 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:51,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:51,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:48:51,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:51,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:51,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1034472869, now seen corresponding path program 1 times [2025-02-05 15:48:51,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:51,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862524272] [2025-02-05 15:48:51,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:51,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:51,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:48:51,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:48:51,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:51,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:51,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:51,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862524272] [2025-02-05 15:48:51,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862524272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:51,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:51,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:51,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235339953] [2025-02-05 15:48:51,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:51,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:51,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:51,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:51,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:51,634 INFO L87 Difference]: Start difference. First operand 929 states and 1532 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:51,670 INFO L93 Difference]: Finished difference Result 2210 states and 3698 transitions. [2025-02-05 15:48:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:51,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-02-05 15:48:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:51,678 INFO L225 Difference]: With dead ends: 2210 [2025-02-05 15:48:51,678 INFO L226 Difference]: Without dead ends: 1347 [2025-02-05 15:48:51,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:51,682 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 132 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:51,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1331 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-02-05 15:48:51,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1339. [2025-02-05 15:48:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1063 states have (on average 1.6349952963311383) internal successors, (1738), 1071 states have internal predecessors, (1738), 243 states have call successors, (243), 28 states have call predecessors, (243), 32 states have return successors, (274), 241 states have call predecessors, (274), 242 states have call successors, (274) [2025-02-05 15:48:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2255 transitions. [2025-02-05 15:48:51,730 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2255 transitions. Word has length 129 [2025-02-05 15:48:51,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:51,730 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 2255 transitions. [2025-02-05 15:48:51,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2255 transitions. [2025-02-05 15:48:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:48:51,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:51,737 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:51,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:48:51,737 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:51,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash 626919419, now seen corresponding path program 1 times [2025-02-05 15:48:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:51,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421319785] [2025-02-05 15:48:51,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:51,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:48:51,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:48:51,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:51,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:51,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:51,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421319785] [2025-02-05 15:48:51,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421319785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:51,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:51,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90927734] [2025-02-05 15:48:51,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:51,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:51,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:51,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:51,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:51,791 INFO L87 Difference]: Start difference. First operand 1339 states and 2255 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:51,844 INFO L93 Difference]: Finished difference Result 3213 states and 5449 transitions. [2025-02-05 15:48:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:51,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-02-05 15:48:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:51,856 INFO L225 Difference]: With dead ends: 3213 [2025-02-05 15:48:51,857 INFO L226 Difference]: Without dead ends: 1991 [2025-02-05 15:48:51,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:51,863 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 130 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:51,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1316 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2025-02-05 15:48:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1983. [2025-02-05 15:48:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1983 states, 1588 states have (on average 1.647984886649874) internal successors, (2617), 1596 states have internal predecessors, (2617), 362 states have call successors, (362), 28 states have call predecessors, (362), 32 states have return successors, (393), 360 states have call predecessors, (393), 361 states have call successors, (393) [2025-02-05 15:48:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 3372 transitions. [2025-02-05 15:48:51,977 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 3372 transitions. Word has length 130 [2025-02-05 15:48:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:51,978 INFO L471 AbstractCegarLoop]: Abstraction has 1983 states and 3372 transitions. [2025-02-05 15:48:51,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 3372 transitions. [2025-02-05 15:48:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:48:51,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:51,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:51,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:48:51,990 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:51,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash -166475750, now seen corresponding path program 1 times [2025-02-05 15:48:51,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:51,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529739417] [2025-02-05 15:48:51,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:52,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:48:52,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:48:52,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:52,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:52,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:52,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529739417] [2025-02-05 15:48:52,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529739417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:52,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:52,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:52,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142775510] [2025-02-05 15:48:52,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:52,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:52,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:52,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:52,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:52,048 INFO L87 Difference]: Start difference. First operand 1983 states and 3372 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:52,125 INFO L93 Difference]: Finished difference Result 4725 states and 8099 transitions. [2025-02-05 15:48:52,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:52,125 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-02-05 15:48:52,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:52,143 INFO L225 Difference]: With dead ends: 4725 [2025-02-05 15:48:52,143 INFO L226 Difference]: Without dead ends: 2981 [2025-02-05 15:48:52,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:52,152 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 128 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:52,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1313 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2025-02-05 15:48:52,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2973. [2025-02-05 15:48:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2973 states, 2416 states have (on average 1.658112582781457) internal successors, (4006), 2424 states have internal predecessors, (4006), 524 states have call successors, (524), 28 states have call predecessors, (524), 32 states have return successors, (571), 522 states have call predecessors, (571), 523 states have call successors, (571) [2025-02-05 15:48:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 5101 transitions. [2025-02-05 15:48:52,320 INFO L78 Accepts]: Start accepts. Automaton has 2973 states and 5101 transitions. Word has length 131 [2025-02-05 15:48:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:52,320 INFO L471 AbstractCegarLoop]: Abstraction has 2973 states and 5101 transitions. [2025-02-05 15:48:52,321 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 5101 transitions. [2025-02-05 15:48:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:48:52,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:52,338 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:52,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:48:52,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -405979172, now seen corresponding path program 1 times [2025-02-05 15:48:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074856449] [2025-02-05 15:48:52,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:52,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:48:52,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:48:52,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:52,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:52,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:52,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074856449] [2025-02-05 15:48:52,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074856449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:52,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:52,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:52,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405604841] [2025-02-05 15:48:52,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:52,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:52,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:52,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:52,424 INFO L87 Difference]: Start difference. First operand 2973 states and 5101 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:52,577 INFO L93 Difference]: Finished difference Result 7118 states and 12300 transitions. [2025-02-05 15:48:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:52,577 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-02-05 15:48:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:52,605 INFO L225 Difference]: With dead ends: 7118 [2025-02-05 15:48:52,605 INFO L226 Difference]: Without dead ends: 4584 [2025-02-05 15:48:52,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:52,619 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 126 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:52,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1313 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2025-02-05 15:48:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4576. [2025-02-05 15:48:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4576 states, 3774 states have (on average 1.6653418124006358) internal successors, (6285), 3782 states have internal predecessors, (6285), 769 states have call successors, (769), 28 states have call predecessors, (769), 32 states have return successors, (842), 767 states have call predecessors, (842), 768 states have call successors, (842) [2025-02-05 15:48:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4576 states to 4576 states and 7896 transitions. [2025-02-05 15:48:52,839 INFO L78 Accepts]: Start accepts. Automaton has 4576 states and 7896 transitions. Word has length 132 [2025-02-05 15:48:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:52,839 INFO L471 AbstractCegarLoop]: Abstraction has 4576 states and 7896 transitions. [2025-02-05 15:48:52,840 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4576 states and 7896 transitions. [2025-02-05 15:48:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:48:52,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:52,860 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:52,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:48:52,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:52,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1724620537, now seen corresponding path program 1 times [2025-02-05 15:48:52,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:52,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380572876] [2025-02-05 15:48:52,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:52,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:48:52,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:48:52,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:52,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:52,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:52,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380572876] [2025-02-05 15:48:52,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380572876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:52,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:52,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:52,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402253561] [2025-02-05 15:48:52,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:52,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:52,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:52,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:52,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:52,928 INFO L87 Difference]: Start difference. First operand 4576 states and 7896 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:53,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:53,143 INFO L93 Difference]: Finished difference Result 11108 states and 19304 transitions. [2025-02-05 15:48:53,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:53,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-02-05 15:48:53,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:53,196 INFO L225 Difference]: With dead ends: 11108 [2025-02-05 15:48:53,196 INFO L226 Difference]: Without dead ends: 7278 [2025-02-05 15:48:53,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:48:53,213 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 124 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:53,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1326 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:53,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7278 states. [2025-02-05 15:48:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7278 to 7270. [2025-02-05 15:48:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7270 states, 5975 states have (on average 1.665439330543933) internal successors, (9951), 5983 states have internal predecessors, (9951), 1262 states have call successors, (1262), 28 states have call predecessors, (1262), 32 states have return successors, (1379), 1260 states have call predecessors, (1379), 1261 states have call successors, (1379) [2025-02-05 15:48:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 12592 transitions. [2025-02-05 15:48:53,560 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 12592 transitions. Word has length 133 [2025-02-05 15:48:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:53,561 INFO L471 AbstractCegarLoop]: Abstraction has 7270 states and 12592 transitions. [2025-02-05 15:48:53,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 12592 transitions. [2025-02-05 15:48:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:48:53,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:53,586 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:53,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:48:53,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:53,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:53,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2112878013, now seen corresponding path program 1 times [2025-02-05 15:48:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:53,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601520221] [2025-02-05 15:48:53,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:53,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:48:53,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:48:53,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:53,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:53,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:53,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601520221] [2025-02-05 15:48:53,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601520221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:53,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:53,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:53,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582267151] [2025-02-05 15:48:53,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:53,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:53,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:53,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:53,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:53,642 INFO L87 Difference]: Start difference. First operand 7270 states and 12592 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:53,954 INFO L93 Difference]: Finished difference Result 18338 states and 31972 transitions. [2025-02-05 15:48:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:53,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-02-05 15:48:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:54,013 INFO L225 Difference]: With dead ends: 18338 [2025-02-05 15:48:54,013 INFO L226 Difference]: Without dead ends: 12185 [2025-02-05 15:48:54,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:54,048 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 122 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:54,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1324 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12185 states. [2025-02-05 15:48:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12185 to 12177. [2025-02-05 15:48:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 10060 states have (on average 1.6668986083499007) internal successors, (16769), 10068 states have internal predecessors, (16769), 2084 states have call successors, (2084), 28 states have call predecessors, (2084), 32 states have return successors, (2279), 2082 states have call predecessors, (2279), 2083 states have call successors, (2279) [2025-02-05 15:48:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 21132 transitions. [2025-02-05 15:48:54,599 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 21132 transitions. Word has length 134 [2025-02-05 15:48:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:54,599 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 21132 transitions. [2025-02-05 15:48:54,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 21132 transitions. [2025-02-05 15:48:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:48:54,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:54,633 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:54,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:48:54,633 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:54,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:54,633 INFO L85 PathProgramCache]: Analyzing trace with hash -11798536, now seen corresponding path program 1 times [2025-02-05 15:48:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:54,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352141603] [2025-02-05 15:48:54,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:54,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:48:54,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:48:54,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:54,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:54,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352141603] [2025-02-05 15:48:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352141603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:54,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:54,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443900625] [2025-02-05 15:48:54,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:54,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:54,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:54,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:54,682 INFO L87 Difference]: Start difference. First operand 12177 states and 21132 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:55,072 INFO L93 Difference]: Finished difference Result 29094 states and 50454 transitions. [2025-02-05 15:48:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:55,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-02-05 15:48:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:55,153 INFO L225 Difference]: With dead ends: 29094 [2025-02-05 15:48:55,154 INFO L226 Difference]: Without dead ends: 19001 [2025-02-05 15:48:55,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:55,194 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 120 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:55,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1296 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19001 states. [2025-02-05 15:48:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19001 to 18993. [2025-02-05 15:48:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18993 states, 15673 states have (on average 1.6444841447074587) internal successors, (25774), 15681 states have internal predecessors, (25774), 3287 states have call successors, (3287), 28 states have call predecessors, (3287), 32 states have return successors, (3626), 3285 states have call predecessors, (3626), 3286 states have call successors, (3626) [2025-02-05 15:48:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18993 states to 18993 states and 32687 transitions. [2025-02-05 15:48:56,039 INFO L78 Accepts]: Start accepts. Automaton has 18993 states and 32687 transitions. Word has length 135 [2025-02-05 15:48:56,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:56,039 INFO L471 AbstractCegarLoop]: Abstraction has 18993 states and 32687 transitions. [2025-02-05 15:48:56,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:56,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18993 states and 32687 transitions. [2025-02-05 15:48:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:48:56,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:56,080 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:56,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:48:56,081 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:56,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash -56307938, now seen corresponding path program 1 times [2025-02-05 15:48:56,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:56,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274127439] [2025-02-05 15:48:56,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:56,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:48:56,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:48:56,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:56,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:56,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:56,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274127439] [2025-02-05 15:48:56,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274127439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:56,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:56,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:56,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739759419] [2025-02-05 15:48:56,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:56,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:56,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:56,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:56,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:56,148 INFO L87 Difference]: Start difference. First operand 18993 states and 32687 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:57,145 INFO L93 Difference]: Finished difference Result 50131 states and 86639 transitions. [2025-02-05 15:48:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:57,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-02-05 15:48:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:57,285 INFO L225 Difference]: With dead ends: 50131 [2025-02-05 15:48:57,285 INFO L226 Difference]: Without dead ends: 33856 [2025-02-05 15:48:57,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:48:57,328 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 118 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:57,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1316 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33856 states. [2025-02-05 15:48:58,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33856 to 33848. [2025-02-05 15:48:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33848 states, 28078 states have (on average 1.6422465987605954) internal successors, (46111), 28086 states have internal predecessors, (46111), 5737 states have call successors, (5737), 28 states have call predecessors, (5737), 32 states have return successors, (6350), 5735 states have call predecessors, (6350), 5736 states have call successors, (6350) [2025-02-05 15:48:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33848 states to 33848 states and 58198 transitions. [2025-02-05 15:48:58,515 INFO L78 Accepts]: Start accepts. Automaton has 33848 states and 58198 transitions. Word has length 136 [2025-02-05 15:48:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:58,515 INFO L471 AbstractCegarLoop]: Abstraction has 33848 states and 58198 transitions. [2025-02-05 15:48:58,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:58,516 INFO L276 IsEmpty]: Start isEmpty. Operand 33848 states and 58198 transitions. [2025-02-05 15:48:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:48:58,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:58,561 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:58,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:48:58,561 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:58,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1931069417, now seen corresponding path program 1 times [2025-02-05 15:48:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911954759] [2025-02-05 15:48:58,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:58,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:48:58,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:48:58,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:58,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:58,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911954759] [2025-02-05 15:48:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911954759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:58,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:58,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:58,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812717986] [2025-02-05 15:48:58,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:58,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:58,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:58,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:58,621 INFO L87 Difference]: Start difference. First operand 33848 states and 58198 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:59,811 INFO L93 Difference]: Finished difference Result 92223 states and 159121 transitions. [2025-02-05 15:48:59,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:59,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-02-05 15:48:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:00,101 INFO L225 Difference]: With dead ends: 92223 [2025-02-05 15:49:00,101 INFO L226 Difference]: Without dead ends: 62000 [2025-02-05 15:49:00,191 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:49:00,192 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 116 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1327 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:49:00,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1327 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:00,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62000 states. [2025-02-05 15:49:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62000 to 61992. [2025-02-05 15:49:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61992 states, 51709 states have (on average 1.638766945792802) internal successors, (84739), 51717 states have internal predecessors, (84739), 10250 states have call successors, (10250), 28 states have call predecessors, (10250), 32 states have return successors, (11395), 10248 states have call predecessors, (11395), 10249 states have call successors, (11395) [2025-02-05 15:49:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61992 states to 61992 states and 106384 transitions. [2025-02-05 15:49:02,636 INFO L78 Accepts]: Start accepts. Automaton has 61992 states and 106384 transitions. Word has length 137 [2025-02-05 15:49:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:02,637 INFO L471 AbstractCegarLoop]: Abstraction has 61992 states and 106384 transitions. [2025-02-05 15:49:02,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:49:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 61992 states and 106384 transitions. [2025-02-05 15:49:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:49:02,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:02,682 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:49:02,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:49:02,682 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:02,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:02,682 INFO L85 PathProgramCache]: Analyzing trace with hash 972618015, now seen corresponding path program 1 times [2025-02-05 15:49:02,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:02,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030486851] [2025-02-05 15:49:02,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:02,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:02,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:49:02,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:49:02,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:02,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:49:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:02,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030486851] [2025-02-05 15:49:02,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030486851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:02,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510269090] [2025-02-05 15:49:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:02,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:02,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:02,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:02,741 INFO L87 Difference]: Start difference. First operand 61992 states and 106384 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:49:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:04,682 INFO L93 Difference]: Finished difference Result 116089 states and 199676 transitions. [2025-02-05 15:49:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:04,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-02-05 15:49:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:05,189 INFO L225 Difference]: With dead ends: 116089 [2025-02-05 15:49:05,189 INFO L226 Difference]: Without dead ends: 115840 [2025-02-05 15:49:05,252 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:49:05,255 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 111 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1330 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:49:05,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1330 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115840 states. [2025-02-05 15:49:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115840 to 115832. [2025-02-05 15:49:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115832 states, 97181 states have (on average 1.634033401590846) internal successors, (158797), 97189 states have internal predecessors, (158797), 18618 states have call successors, (18618), 28 states have call predecessors, (18618), 32 states have return successors, (20809), 18616 states have call predecessors, (20809), 18617 states have call successors, (20809) [2025-02-05 15:49:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115832 states to 115832 states and 198224 transitions. [2025-02-05 15:49:08,946 INFO L78 Accepts]: Start accepts. Automaton has 115832 states and 198224 transitions. Word has length 138 [2025-02-05 15:49:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:08,946 INFO L471 AbstractCegarLoop]: Abstraction has 115832 states and 198224 transitions. [2025-02-05 15:49:08,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:49:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 115832 states and 198224 transitions. [2025-02-05 15:49:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:49:09,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:09,001 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:49:09,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:49:09,002 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:09,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1591334902, now seen corresponding path program 1 times [2025-02-05 15:49:09,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:09,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52935834] [2025-02-05 15:49:09,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:09,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:09,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:49:09,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:49:09,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:09,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:49:09,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:09,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52935834] [2025-02-05 15:49:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52935834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:09,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:09,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 15:49:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334877826] [2025-02-05 15:49:09,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:09,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:49:09,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:09,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:49:09,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:49:09,283 INFO L87 Difference]: Start difference. First operand 115832 states and 198224 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:49:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:15,480 INFO L93 Difference]: Finished difference Result 231065 states and 400824 transitions. [2025-02-05 15:49:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 15:49:15,480 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 139 [2025-02-05 15:49:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:16,587 INFO L225 Difference]: With dead ends: 231065 [2025-02-05 15:49:16,587 INFO L226 Difference]: Without dead ends: 230822 [2025-02-05 15:49:16,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-02-05 15:49:16,711 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 2000 mSDsluCounter, 8031 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2000 SdHoareTripleChecker+Valid, 8791 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:16,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2000 Valid, 8791 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [648 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 15:49:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230822 states. [2025-02-05 15:49:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230822 to 230748. [2025-02-05 15:49:24,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230748 states, 193638 states have (on average 1.6344519154298227) internal successors, (316492), 193547 states have internal predecessors, (316492), 37026 states have call successors, (37026), 75 states have call predecessors, (37026), 83 states have return successors, (44696), 37133 states have call predecessors, (44696), 37023 states have call successors, (44696) [2025-02-05 15:49:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230748 states to 230748 states and 398214 transitions. [2025-02-05 15:49:25,664 INFO L78 Accepts]: Start accepts. Automaton has 230748 states and 398214 transitions. Word has length 139 [2025-02-05 15:49:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:25,665 INFO L471 AbstractCegarLoop]: Abstraction has 230748 states and 398214 transitions. [2025-02-05 15:49:25,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:49:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 230748 states and 398214 transitions. [2025-02-05 15:49:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:49:26,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:26,080 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:49:26,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:49:26,080 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:26,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1374836757, now seen corresponding path program 1 times [2025-02-05 15:49:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:26,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943177932] [2025-02-05 15:49:26,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:26,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:49:26,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:49:26,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:26,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:49:26,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:26,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943177932] [2025-02-05 15:49:26,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943177932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:26,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:26,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:49:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772996237] [2025-02-05 15:49:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:26,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:49:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:26,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:49:26,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:49:26,168 INFO L87 Difference]: Start difference. First operand 230748 states and 398214 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)