./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec6_product14.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 bcfdffd5743ab46e6f5628bffe82029f1c91fa1aa61e5033c157235a6e9c82be --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:24:47,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:24:47,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:24:47,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:24:47,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:24:47,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:24:47,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:24:47,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:24:47,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:24:47,316 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:24:47,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:24:47,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:24:47,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:24:47,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:24:47,316 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:24:47,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:24:47,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:24:47,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:24:47,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:24:47,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:24:47,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:24:47,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:24:47,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:24:47,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:24:47,318 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:24:47,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:24:47,318 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:24:47,318 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:24:47,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:24:47,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:24:47,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:24:47,319 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/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 -> bcfdffd5743ab46e6f5628bffe82029f1c91fa1aa61e5033c157235a6e9c82be [2025-03-03 14:24:47,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:24:47,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:24:47,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:24:47,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:24:47,574 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:24:47,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product14.cil.c [2025-03-03 14:24:48,793 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c639864/08b176f198aa4d829a396d1c97cf67d4/FLAGd6f6fec64 [2025-03-03 14:24:49,073 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:24:49,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product14.cil.c [2025-03-03 14:24:49,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c639864/08b176f198aa4d829a396d1c97cf67d4/FLAGd6f6fec64 [2025-03-03 14:24:49,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c639864/08b176f198aa4d829a396d1c97cf67d4 [2025-03-03 14:24:49,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:24:49,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:24:49,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:24:49,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:24:49,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:24:49,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:49,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8d137b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49, skipping insertion in model container [2025-03-03 14:24:49,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:49,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:24:49,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product14.cil.c[43937,43950] [2025-03-03 14:24:49,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:24:49,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:24:49,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-03 14:24:49,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [368] [2025-03-03 14:24:49,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [419] [2025-03-03 14:24:49,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1488] [2025-03-03 14:24:49,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1523] [2025-03-03 14:24:49,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1803] [2025-03-03 14:24:49,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2019] [2025-03-03 14:24:49,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2036] [2025-03-03 14:24:49,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2045] [2025-03-03 14:24:49,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2151] [2025-03-03 14:24:49,829 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2517] [2025-03-03 14:24:49,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product14.cil.c[43937,43950] [2025-03-03 14:24:49,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:24:49,946 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:24:49,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49 WrapperNode [2025-03-03 14:24:49,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:24:49,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:24:49,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:24:49,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:24:49,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:49,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,004 INFO L138 Inliner]: procedures = 126, calls = 194, calls flagged for inlining = 49, calls inlined = 41, statements flattened = 875 [2025-03-03 14:24:50,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:24:50,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:24:50,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:24:50,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:24:50,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,036 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-03-03 14:24:50,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:24:50,059 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:24:50,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:24:50,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:24:50,060 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (1/1) ... [2025-03-03 14:24:50,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:24:50,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:50,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:24:50,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:24:50,109 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:24:50,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:24:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:24:50,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:24:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:24:50,110 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:24:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:24:50,110 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:24:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:24:50,110 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:24:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:24:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:24:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:24:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:24:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:24:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:24:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:24:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:24:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:24:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:24:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:24:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:24:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:24:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:24:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:24:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:24:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:24:50,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:24:50,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:24:50,269 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:24:50,271 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:24:50,334 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1783: #res := ~retValue_acc~24; [2025-03-03 14:24:50,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1077-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~11#1; [2025-03-03 14:24:50,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1122: #res#1 := ~retValue_acc~12#1; [2025-03-03 14:24:50,441 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1465-1: getClientId_#res#1 := getClientId_~retValue_acc~17#1; [2025-03-03 14:24:50,442 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1346-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~15#1; [2025-03-03 14:24:50,448 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1030: #res := ~retValue_acc~10; [2025-03-03 14:24:50,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2148-1: createEmail_#res#1 := createEmail_~retValue_acc~29#1; [2025-03-03 14:24:50,468 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: #res := ~retValue_acc~4; [2025-03-03 14:24:50,477 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753: #res := ~retValue_acc~39; [2025-03-03 14:24:50,508 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2790: #res := ~retValue_acc~40; [2025-03-03 14:24:50,524 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2638: #res := ~retValue_acc~36; [2025-03-03 14:24:50,564 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L900: #res := ~retValue_acc~8; [2025-03-03 14:24:50,802 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1292-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~14#1; [2025-03-03 14:24:50,803 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1185-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~13#1; [2025-03-03 14:24:50,803 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1740-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~21#1; [2025-03-03 14:24:50,803 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1749-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~22#1; [2025-03-03 14:24:50,803 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1758-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~23#1; [2025-03-03 14:24:50,803 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520-1: valid_product_#res#1 := valid_product_~retValue_acc~19#1; [2025-03-03 14:24:50,900 INFO L? ?]: Removed 438 outVars from TransFormulas that were not future-live. [2025-03-03 14:24:50,900 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:24:50,923 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:24:50,923 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:24:50,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:24:50 BoogieIcfgContainer [2025-03-03 14:24:50,923 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:24:50,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:24:50,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:24:50,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:24:50,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:24:49" (1/3) ... [2025-03-03 14:24:50,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6031c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:24:50, skipping insertion in model container [2025-03-03 14:24:50,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:49" (2/3) ... [2025-03-03 14:24:50,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6031c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:24:50, skipping insertion in model container [2025-03-03 14:24:50,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:24:50" (3/3) ... [2025-03-03 14:24:50,930 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product14.cil.c [2025-03-03 14:24:50,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:24:50,944 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product14.cil.c that has 24 procedures, 354 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:24:51,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:24:51,008 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;@41368aba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:24:51,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:24:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 354 states, 273 states have (on average 1.5714285714285714) internal successors, (429), 278 states have internal predecessors, (429), 56 states have call successors, (56), 23 states have call predecessors, (56), 23 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 14:24:51,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:24:51,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:51,027 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 14:24:51,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:51,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash 762497556, now seen corresponding path program 1 times [2025-03-03 14:24:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:51,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585414851] [2025-03-03 14:24:51,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:51,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:24:51,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:24:51,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:51,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:24:51,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:51,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585414851] [2025-03-03 14:24:51,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585414851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:51,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419952689] [2025-03-03 14:24:51,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:51,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:51,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:51,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:24:51,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:24:51,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:24:51,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:24:51,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:51,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:51,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:24:51,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:24:51,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:51,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419952689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:51,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:51,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:24:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626947091] [2025-03-03 14:24:51,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:51,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:24:51,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:52,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:24:52,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:52,005 INFO L87 Difference]: Start difference. First operand has 354 states, 273 states have (on average 1.5714285714285714) internal successors, (429), 278 states have internal predecessors, (429), 56 states have call successors, (56), 23 states have call predecessors, (56), 23 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:52,045 INFO L93 Difference]: Finished difference Result 521 states and 782 transitions. [2025-03-03 14:24:52,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:24:52,047 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 123 [2025-03-03 14:24:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:52,055 INFO L225 Difference]: With dead ends: 521 [2025-03-03 14:24:52,056 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 14:24:52,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 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-03-03 14:24:52,062 INFO L435 NwaCegarLoop]: 538 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, 538 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-03-03 14:24:52,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 14:24:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-03-03 14:24:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 267 states have (on average 1.5692883895131087) internal successors, (419), 271 states have internal predecessors, (419), 56 states have call successors, (56), 23 states have call predecessors, (56), 23 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 14:24:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 530 transitions. [2025-03-03 14:24:52,138 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 530 transitions. Word has length 123 [2025-03-03 14:24:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:52,138 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 530 transitions. [2025-03-03 14:24:52,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 530 transitions. [2025-03-03 14:24:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:24:52,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:52,142 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:52,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:24:52,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:24:52,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:52,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:52,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1560009364, now seen corresponding path program 1 times [2025-03-03 14:24:52,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:52,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682327230] [2025-03-03 14:24:52,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:52,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:52,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:24:52,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:24:52,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:52,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:24:52,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:52,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682327230] [2025-03-03 14:24:52,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682327230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:52,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26874399] [2025-03-03 14:24:52,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:52,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:52,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:52,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:24:52,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:24:52,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:24:52,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:24:52,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:52,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:52,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:24:52,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 14:24:52,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:52,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26874399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:52,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:52,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231145789] [2025-03-03 14:24:52,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:52,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:52,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:52,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:52,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:52,954 INFO L87 Difference]: Start difference. First operand 347 states and 530 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:24:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:52,988 INFO L93 Difference]: Finished difference Result 510 states and 760 transitions. [2025-03-03 14:24:52,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:52,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 143 [2025-03-03 14:24:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:52,992 INFO L225 Difference]: With dead ends: 510 [2025-03-03 14:24:52,992 INFO L226 Difference]: Without dead ends: 349 [2025-03-03 14:24:52,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 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-03-03 14:24:52,997 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1056 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-03-03 14:24:52,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1056 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-03 14:24:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-03-03 14:24:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 269 states have (on average 1.5650557620817844) internal successors, (421), 273 states have internal predecessors, (421), 56 states have call successors, (56), 23 states have call predecessors, (56), 23 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-03 14:24:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 532 transitions. [2025-03-03 14:24:53,017 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 532 transitions. Word has length 143 [2025-03-03 14:24:53,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:53,018 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 532 transitions. [2025-03-03 14:24:53,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:24:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 532 transitions. [2025-03-03 14:24:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:24:53,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:53,020 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:53,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:53,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:24:53,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:53,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash 298047295, now seen corresponding path program 1 times [2025-03-03 14:24:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:53,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828673905] [2025-03-03 14:24:53,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:53,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:24:53,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:24:53,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:53,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:24:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:53,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828673905] [2025-03-03 14:24:53,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828673905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:53,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892531883] [2025-03-03 14:24:53,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:53,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:53,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:53,437 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:24:53,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:24:53,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:24:53,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:24:53,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:53,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:53,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:53,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:24:53,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:53,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892531883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:53,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:53,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:53,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064199384] [2025-03-03 14:24:53,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:53,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:53,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:53,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:53,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:53,694 INFO L87 Difference]: Start difference. First operand 349 states and 532 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:53,731 INFO L93 Difference]: Finished difference Result 740 states and 1147 transitions. [2025-03-03 14:24:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:53,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-03 14:24:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:53,737 INFO L225 Difference]: With dead ends: 740 [2025-03-03 14:24:53,737 INFO L226 Difference]: Without dead ends: 418 [2025-03-03 14:24:53,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 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-03-03 14:24:53,738 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 126 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1019 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-03-03 14:24:53,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1019 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-03 14:24:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 410. [2025-03-03 14:24:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 316 states have (on average 1.5854430379746836) internal successors, (501), 320 states have internal predecessors, (501), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 14:24:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 640 transitions. [2025-03-03 14:24:53,755 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 640 transitions. Word has length 129 [2025-03-03 14:24:53,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:53,755 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 640 transitions. [2025-03-03 14:24:53,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 640 transitions. [2025-03-03 14:24:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:24:53,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:53,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:53,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:24:53,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:53,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:53,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 11033447, now seen corresponding path program 1 times [2025-03-03 14:24:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:53,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841550991] [2025-03-03 14:24:53,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:53,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:53,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:24:53,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:24:53,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:53,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 14:24:54,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:54,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841550991] [2025-03-03 14:24:54,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841550991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:54,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250754202] [2025-03-03 14:24:54,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:54,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:54,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:54,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:24:54,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:24:54,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:24:54,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:24:54,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:54,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:54,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:24:54,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:54,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:54,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250754202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:54,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:54,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:24:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298819092] [2025-03-03 14:24:54,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:54,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:54,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:54,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:54,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:54,445 INFO L87 Difference]: Start difference. First operand 410 states and 640 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:24:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:54,499 INFO L93 Difference]: Finished difference Result 811 states and 1270 transitions. [2025-03-03 14:24:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:54,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-03-03 14:24:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:54,502 INFO L225 Difference]: With dead ends: 811 [2025-03-03 14:24:54,502 INFO L226 Difference]: Without dead ends: 412 [2025-03-03 14:24:54,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 147 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-03-03 14:24:54,506 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 2 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2077 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-03-03 14:24:54,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2077 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-03 14:24:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-03-03 14:24:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 317 states have (on average 1.583596214511041) internal successors, (502), 322 states have internal predecessors, (502), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 68 states have call predecessors, (71), 69 states have call successors, (71) [2025-03-03 14:24:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 643 transitions. [2025-03-03 14:24:54,530 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 643 transitions. Word has length 149 [2025-03-03 14:24:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:54,530 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 643 transitions. [2025-03-03 14:24:54,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:24:54,530 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 643 transitions. [2025-03-03 14:24:54,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:24:54,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:54,534 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:54,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:54,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:54,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:54,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:54,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1169541608, now seen corresponding path program 1 times [2025-03-03 14:24:54,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:54,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175204044] [2025-03-03 14:24:54,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:54,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:54,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:24:54,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:24:54,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:54,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175204044] [2025-03-03 14:24:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175204044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424857144] [2025-03-03 14:24:54,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:54,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:54,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:54,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:24:54,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:24:55,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:24:55,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:24:55,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:55,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:55,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:24:55,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:55,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:55,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424857144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:55,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:55,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:24:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893104476] [2025-03-03 14:24:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:55,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:55,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:55,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:55,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:24:55,189 INFO L87 Difference]: Start difference. First operand 412 states and 643 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:24:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:55,252 INFO L93 Difference]: Finished difference Result 813 states and 1275 transitions. [2025-03-03 14:24:55,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:55,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 150 [2025-03-03 14:24:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:55,255 INFO L225 Difference]: With dead ends: 813 [2025-03-03 14:24:55,255 INFO L226 Difference]: Without dead ends: 414 [2025-03-03 14:24:55,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 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-03-03 14:24:55,258 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2063 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-03-03 14:24:55,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2063 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-03 14:24:55,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-03-03 14:24:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 318 states have (on average 1.5817610062893082) internal successors, (503), 324 states have internal predecessors, (503), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 68 states have call predecessors, (76), 69 states have call successors, (76) [2025-03-03 14:24:55,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 649 transitions. [2025-03-03 14:24:55,285 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 649 transitions. Word has length 150 [2025-03-03 14:24:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:55,285 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 649 transitions. [2025-03-03 14:24:55,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:24:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 649 transitions. [2025-03-03 14:24:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:24:55,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:55,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:55,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:55,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:55,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:55,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1427285737, now seen corresponding path program 1 times [2025-03-03 14:24:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:55,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875329985] [2025-03-03 14:24:55,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:55,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:24:55,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:24:55,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:55,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:24:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875329985] [2025-03-03 14:24:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875329985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:55,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:55,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:24:55,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536518074] [2025-03-03 14:24:55,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:55,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:55,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:55,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:55,611 INFO L87 Difference]: Start difference. First operand 414 states and 649 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:24:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:55,644 INFO L93 Difference]: Finished difference Result 805 states and 1266 transitions. [2025-03-03 14:24:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:55,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 132 [2025-03-03 14:24:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:55,647 INFO L225 Difference]: With dead ends: 805 [2025-03-03 14:24:55,647 INFO L226 Difference]: Without dead ends: 414 [2025-03-03 14:24:55,648 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-03-03 14:24:55,649 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 2 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2081 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-03-03 14:24:55,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2081 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-03 14:24:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-03-03 14:24:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 318 states have (on average 1.5817610062893082) internal successors, (503), 324 states have internal predecessors, (503), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 68 states have call predecessors, (75), 69 states have call successors, (75) [2025-03-03 14:24:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 648 transitions. [2025-03-03 14:24:55,666 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 648 transitions. Word has length 132 [2025-03-03 14:24:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:55,666 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 648 transitions. [2025-03-03 14:24:55,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:24:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 648 transitions. [2025-03-03 14:24:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:24:55,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:55,668 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:55,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:24:55,668 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:55,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash -534889546, now seen corresponding path program 2 times [2025-03-03 14:24:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:55,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359043575] [2025-03-03 14:24:55,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:24:55,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:55,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-03 14:24:55,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:24:55,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:24:55,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:24:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359043575] [2025-03-03 14:24:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359043575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:55,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:55,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:24:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89994287] [2025-03-03 14:24:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:55,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:55,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:55,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:55,786 INFO L87 Difference]: Start difference. First operand 414 states and 648 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:24:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:55,831 INFO L93 Difference]: Finished difference Result 803 states and 1261 transitions. [2025-03-03 14:24:55,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:55,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 133 [2025-03-03 14:24:55,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:55,834 INFO L225 Difference]: With dead ends: 803 [2025-03-03 14:24:55,834 INFO L226 Difference]: Without dead ends: 414 [2025-03-03 14:24:55,835 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-03-03 14:24:55,835 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 2 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2067 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-03-03 14:24:55,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2067 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-03 14:24:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2025-03-03 14:24:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 318 states have (on average 1.5817610062893082) internal successors, (503), 324 states have internal predecessors, (503), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (74), 68 states have call predecessors, (74), 69 states have call successors, (74) [2025-03-03 14:24:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 647 transitions. [2025-03-03 14:24:55,875 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 647 transitions. Word has length 133 [2025-03-03 14:24:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:55,875 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 647 transitions. [2025-03-03 14:24:55,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:24:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 647 transitions. [2025-03-03 14:24:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:24:55,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:55,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:55,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:24:55,878 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:55,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:55,879 INFO L85 PathProgramCache]: Analyzing trace with hash -528630838, now seen corresponding path program 3 times [2025-03-03 14:24:55,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:55,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78973186] [2025-03-03 14:24:55,879 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:24:55,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:55,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 134 statements into 3 equivalence classes. [2025-03-03 14:24:55,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 122 of 134 statements. [2025-03-03 14:24:55,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:24:55,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:24:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78973186] [2025-03-03 14:24:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78973186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:55,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:55,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:24:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220855289] [2025-03-03 14:24:55,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:55,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:55,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:55,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:55,983 INFO L87 Difference]: Start difference. First operand 414 states and 647 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:24:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:56,026 INFO L93 Difference]: Finished difference Result 805 states and 1267 transitions. [2025-03-03 14:24:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 134 [2025-03-03 14:24:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:56,030 INFO L225 Difference]: With dead ends: 805 [2025-03-03 14:24:56,030 INFO L226 Difference]: Without dead ends: 416 [2025-03-03 14:24:56,031 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-03-03 14:24:56,031 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2078 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-03-03 14:24:56,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2078 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-03 14:24:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-03-03 14:24:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 319 states have (on average 1.5799373040752351) internal successors, (504), 326 states have internal predecessors, (504), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (79), 68 states have call predecessors, (79), 69 states have call successors, (79) [2025-03-03 14:24:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 653 transitions. [2025-03-03 14:24:56,045 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 653 transitions. Word has length 134 [2025-03-03 14:24:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:56,045 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 653 transitions. [2025-03-03 14:24:56,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:24:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 653 transitions. [2025-03-03 14:24:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:24:56,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:56,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:56,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:24:56,048 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:56,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:56,048 INFO L85 PathProgramCache]: Analyzing trace with hash 534647955, now seen corresponding path program 1 times [2025-03-03 14:24:56,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:56,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072545080] [2025-03-03 14:24:56,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:56,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:24:56,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:24:56,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:56,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:24:56,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:56,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072545080] [2025-03-03 14:24:56,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072545080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:56,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:56,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:24:56,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412832451] [2025-03-03 14:24:56,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:56,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:56,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:56,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:56,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:56,195 INFO L87 Difference]: Start difference. First operand 416 states and 653 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:24:56,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:56,236 INFO L93 Difference]: Finished difference Result 811 states and 1277 transitions. [2025-03-03 14:24:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:56,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 135 [2025-03-03 14:24:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:56,239 INFO L225 Difference]: With dead ends: 811 [2025-03-03 14:24:56,240 INFO L226 Difference]: Without dead ends: 418 [2025-03-03 14:24:56,241 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-03-03 14:24:56,241 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2084 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-03-03 14:24:56,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2084 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:56,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-03 14:24:56,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-03-03 14:24:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 320 states have (on average 1.578125) internal successors, (505), 328 states have internal predecessors, (505), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 68 states have call predecessors, (81), 69 states have call successors, (81) [2025-03-03 14:24:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 656 transitions. [2025-03-03 14:24:56,261 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 656 transitions. Word has length 135 [2025-03-03 14:24:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:56,261 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 656 transitions. [2025-03-03 14:24:56,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:24:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 656 transitions. [2025-03-03 14:24:56,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 14:24:56,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:56,264 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:56,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:24:56,264 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:56,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:56,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1546786696, now seen corresponding path program 1 times [2025-03-03 14:24:56,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:56,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63460618] [2025-03-03 14:24:56,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:56,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:56,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 14:24:56,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:24:56,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:56,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:24:56,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63460618] [2025-03-03 14:24:56,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63460618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079577917] [2025-03-03 14:24:56,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:56,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:56,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:24:56,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:24:56,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 14:24:56,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:24:56,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:56,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:56,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:56,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:24:56,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:24:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:24:56,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079577917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:24:56,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:24:56,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:24:56,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976351502] [2025-03-03 14:24:56,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:24:56,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:24:56,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:56,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:24:56,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:24:56,738 INFO L87 Difference]: Start difference. First operand 418 states and 656 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 14:24:56,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:56,869 INFO L93 Difference]: Finished difference Result 991 states and 1612 transitions. [2025-03-03 14:24:56,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:24:56,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 155 [2025-03-03 14:24:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:56,873 INFO L225 Difference]: With dead ends: 991 [2025-03-03 14:24:56,874 INFO L226 Difference]: Without dead ends: 830 [2025-03-03 14:24:56,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 307 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-03-03 14:24:56,875 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 599 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:56,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1513 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:24:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-03-03 14:24:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 806. [2025-03-03 14:24:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 629 states have (on average 1.6422893481717011) internal successors, (1033), 637 states have internal predecessors, (1033), 149 states have call successors, (149), 23 states have call predecessors, (149), 27 states have return successors, (170), 147 states have call predecessors, (170), 148 states have call successors, (170) [2025-03-03 14:24:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1352 transitions. [2025-03-03 14:24:56,900 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1352 transitions. Word has length 155 [2025-03-03 14:24:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:56,900 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1352 transitions. [2025-03-03 14:24:56,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 14:24:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1352 transitions. [2025-03-03 14:24:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 14:24:56,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:56,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:56,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:57,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:57,105 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:57,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1850588797, now seen corresponding path program 1 times [2025-03-03 14:24:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209794935] [2025-03-03 14:24:57,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:57,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 14:24:57,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 14:24:57,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:57,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:57,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:57,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209794935] [2025-03-03 14:24:57,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209794935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:57,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:57,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:57,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71739651] [2025-03-03 14:24:57,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:57,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:57,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:57,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:57,166 INFO L87 Difference]: Start difference. First operand 806 states and 1352 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:57,205 INFO L93 Difference]: Finished difference Result 1939 states and 3298 transitions. [2025-03-03 14:24:57,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:57,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-03-03 14:24:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:57,213 INFO L225 Difference]: With dead ends: 1939 [2025-03-03 14:24:57,213 INFO L226 Difference]: Without dead ends: 1199 [2025-03-03 14:24:57,215 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-03-03 14:24:57,216 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 124 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1079 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-03-03 14:24:57,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1079 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2025-03-03 14:24:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1191. [2025-03-03 14:24:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 935 states have (on average 1.655614973262032) internal successors, (1548), 943 states have internal predecessors, (1548), 228 states have call successors, (228), 23 states have call predecessors, (228), 27 states have return successors, (259), 226 states have call predecessors, (259), 227 states have call successors, (259) [2025-03-03 14:24:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 2035 transitions. [2025-03-03 14:24:57,261 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 2035 transitions. Word has length 142 [2025-03-03 14:24:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:57,261 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 2035 transitions. [2025-03-03 14:24:57,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 2035 transitions. [2025-03-03 14:24:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-03 14:24:57,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:57,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:57,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:24:57,268 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:57,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2066993068, now seen corresponding path program 1 times [2025-03-03 14:24:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:57,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928967991] [2025-03-03 14:24:57,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:57,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:57,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-03 14:24:57,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-03 14:24:57,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:57,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:24:57,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:57,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928967991] [2025-03-03 14:24:57,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928967991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:57,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:57,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:57,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641449174] [2025-03-03 14:24:57,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:57,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:57,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:57,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:57,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:57,337 INFO L87 Difference]: Start difference. First operand 1191 states and 2035 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:24:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:57,392 INFO L93 Difference]: Finished difference Result 2877 states and 4945 transitions. [2025-03-03 14:24:57,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:57,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2025-03-03 14:24:57,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:57,404 INFO L225 Difference]: With dead ends: 2877 [2025-03-03 14:24:57,404 INFO L226 Difference]: Without dead ends: 1803 [2025-03-03 14:24:57,408 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-03-03 14:24:57,428 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 122 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1052 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-03-03 14:24:57,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1052 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-03-03 14:24:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1795. [2025-03-03 14:24:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1420 states have (on average 1.6640845070422534) internal successors, (2363), 1428 states have internal predecessors, (2363), 347 states have call successors, (347), 23 states have call predecessors, (347), 27 states have return successors, (378), 345 states have call predecessors, (378), 346 states have call successors, (378) [2025-03-03 14:24:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 3088 transitions. [2025-03-03 14:24:57,498 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 3088 transitions. Word has length 162 [2025-03-03 14:24:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:57,500 INFO L471 AbstractCegarLoop]: Abstraction has 1795 states and 3088 transitions. [2025-03-03 14:24:57,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:24:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 3088 transitions. [2025-03-03 14:24:57,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:24:57,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:57,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:57,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:24:57,511 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:57,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash 971710244, now seen corresponding path program 1 times [2025-03-03 14:24:57,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:57,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436505318] [2025-03-03 14:24:57,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:57,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:57,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 14:24:57,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:24:57,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:57,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:57,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:57,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436505318] [2025-03-03 14:24:57,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436505318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:57,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:57,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:57,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284188153] [2025-03-03 14:24:57,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:57,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:57,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:57,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:57,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:57,578 INFO L87 Difference]: Start difference. First operand 1795 states and 3088 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:57,648 INFO L93 Difference]: Finished difference Result 4284 states and 7427 transitions. [2025-03-03 14:24:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:57,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2025-03-03 14:24:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:57,663 INFO L225 Difference]: With dead ends: 4284 [2025-03-03 14:24:57,663 INFO L226 Difference]: Without dead ends: 2728 [2025-03-03 14:24:57,669 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-03-03 14:24:57,670 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 120 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1049 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-03-03 14:24:57,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1049 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2025-03-03 14:24:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2720. [2025-03-03 14:24:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 2183 states have (on average 1.6710948236371965) internal successors, (3648), 2191 states have internal predecessors, (3648), 509 states have call successors, (509), 23 states have call predecessors, (509), 27 states have return successors, (556), 507 states have call predecessors, (556), 508 states have call successors, (556) [2025-03-03 14:24:57,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 4713 transitions. [2025-03-03 14:24:57,805 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 4713 transitions. Word has length 144 [2025-03-03 14:24:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:57,805 INFO L471 AbstractCegarLoop]: Abstraction has 2720 states and 4713 transitions. [2025-03-03 14:24:57,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 4713 transitions. [2025-03-03 14:24:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:24:57,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:57,819 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, 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-03-03 14:24:57,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:24:57,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:57,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash -789457634, now seen corresponding path program 1 times [2025-03-03 14:24:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:57,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706581371] [2025-03-03 14:24:57,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:57,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:57,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:24:57,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:24:57,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:57,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:57,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:57,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706581371] [2025-03-03 14:24:57,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706581371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:57,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:57,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:57,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230177085] [2025-03-03 14:24:57,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:57,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:57,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:57,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:57,870 INFO L87 Difference]: Start difference. First operand 2720 states and 4713 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:57,959 INFO L93 Difference]: Finished difference Result 6502 states and 11348 transitions. [2025-03-03 14:24:57,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:57,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-03-03 14:24:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:57,980 INFO L225 Difference]: With dead ends: 6502 [2025-03-03 14:24:57,980 INFO L226 Difference]: Without dead ends: 4221 [2025-03-03 14:24:57,989 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-03-03 14:24:57,989 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 118 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1049 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-03-03 14:24:57,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1049 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2025-03-03 14:24:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4213. [2025-03-03 14:24:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4213 states, 3431 states have (on average 1.6761877003788983) internal successors, (5751), 3439 states have internal predecessors, (5751), 754 states have call successors, (754), 23 states have call predecessors, (754), 27 states have return successors, (827), 752 states have call predecessors, (827), 753 states have call successors, (827) [2025-03-03 14:24:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 7332 transitions. [2025-03-03 14:24:58,215 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 7332 transitions. Word has length 145 [2025-03-03 14:24:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:58,216 INFO L471 AbstractCegarLoop]: Abstraction has 4213 states and 7332 transitions. [2025-03-03 14:24:58,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 7332 transitions. [2025-03-03 14:24:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:24:58,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:58,238 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, 1, 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-03-03 14:24:58,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:24:58,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:58,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash 479178661, now seen corresponding path program 1 times [2025-03-03 14:24:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:58,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267144303] [2025-03-03 14:24:58,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:58,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:24:58,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:24:58,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:58,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:58,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:58,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267144303] [2025-03-03 14:24:58,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267144303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:58,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:58,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:58,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251879362] [2025-03-03 14:24:58,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:58,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:58,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:58,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:58,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:58,309 INFO L87 Difference]: Start difference. First operand 4213 states and 7332 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:58,468 INFO L93 Difference]: Finished difference Result 10462 states and 18304 transitions. [2025-03-03 14:24:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:58,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-03-03 14:24:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:58,501 INFO L225 Difference]: With dead ends: 10462 [2025-03-03 14:24:58,502 INFO L226 Difference]: Without dead ends: 6915 [2025-03-03 14:24:58,513 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-03-03 14:24:58,515 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 116 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1072 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-03-03 14:24:58,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1072 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6915 states. [2025-03-03 14:24:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6915 to 6907. [2025-03-03 14:24:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6907 states, 5632 states have (on average 1.6720525568181819) internal successors, (9417), 5640 states have internal predecessors, (9417), 1247 states have call successors, (1247), 23 states have call predecessors, (1247), 27 states have return successors, (1364), 1245 states have call predecessors, (1364), 1246 states have call successors, (1364) [2025-03-03 14:24:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6907 states to 6907 states and 12028 transitions. [2025-03-03 14:24:58,801 INFO L78 Accepts]: Start accepts. Automaton has 6907 states and 12028 transitions. Word has length 146 [2025-03-03 14:24:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:58,801 INFO L471 AbstractCegarLoop]: Abstraction has 6907 states and 12028 transitions. [2025-03-03 14:24:58,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:24:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 6907 states and 12028 transitions. [2025-03-03 14:24:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 14:24:58,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:58,825 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:58,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:24:58,825 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:58,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:58,826 INFO L85 PathProgramCache]: Analyzing trace with hash -307795794, now seen corresponding path program 1 times [2025-03-03 14:24:58,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:58,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983028710] [2025-03-03 14:24:58,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:58,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:58,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 14:24:58,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 14:24:58,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:58,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:24:58,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983028710] [2025-03-03 14:24:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983028710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:58,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:58,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:58,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957377678] [2025-03-03 14:24:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:58,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:58,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:58,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:58,878 INFO L87 Difference]: Start difference. First operand 6907 states and 12028 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:24:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:59,116 INFO L93 Difference]: Finished difference Result 17497 states and 30660 transitions. [2025-03-03 14:24:59,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:59,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 166 [2025-03-03 14:24:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:59,177 INFO L225 Difference]: With dead ends: 17497 [2025-03-03 14:24:59,177 INFO L226 Difference]: Without dead ends: 11627 [2025-03-03 14:24:59,197 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-03-03 14:24:59,198 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 114 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1060 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-03-03 14:24:59,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1060 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11627 states. [2025-03-03 14:24:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11627 to 11619. [2025-03-03 14:24:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11619 states, 9522 states have (on average 1.6722327242176014) internal successors, (15923), 9530 states have internal predecessors, (15923), 2069 states have call successors, (2069), 23 states have call predecessors, (2069), 27 states have return successors, (2264), 2067 states have call predecessors, (2264), 2068 states have call successors, (2264) [2025-03-03 14:24:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11619 states to 11619 states and 20256 transitions. [2025-03-03 14:24:59,657 INFO L78 Accepts]: Start accepts. Automaton has 11619 states and 20256 transitions. Word has length 166 [2025-03-03 14:24:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:59,657 INFO L471 AbstractCegarLoop]: Abstraction has 11619 states and 20256 transitions. [2025-03-03 14:24:59,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:24:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 11619 states and 20256 transitions. [2025-03-03 14:24:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:24:59,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:59,700 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, 1, 1, 1, 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-03-03 14:24:59,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:24:59,700 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:59,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:59,701 INFO L85 PathProgramCache]: Analyzing trace with hash -978643834, now seen corresponding path program 1 times [2025-03-03 14:24:59,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:59,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119203355] [2025-03-03 14:24:59,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:59,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:24:59,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:24:59,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:59,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:24:59,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:59,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119203355] [2025-03-03 14:24:59,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119203355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:59,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570130689] [2025-03-03 14:24:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:59,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:59,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:59,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:59,762 INFO L87 Difference]: Start difference. First operand 11619 states and 20256 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:25:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:00,252 INFO L93 Difference]: Finished difference Result 27728 states and 48302 transitions. [2025-03-03 14:25:00,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:00,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 148 [2025-03-03 14:25:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:00,323 INFO L225 Difference]: With dead ends: 27728 [2025-03-03 14:25:00,323 INFO L226 Difference]: Without dead ends: 18083 [2025-03-03 14:25:00,355 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-03-03 14:25:00,356 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 112 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1024 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-03-03 14:25:00,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1024 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18083 states. [2025-03-03 14:25:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18083 to 18075. [2025-03-03 14:25:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18075 states, 14775 states have (on average 1.6481895093062606) internal successors, (24352), 14783 states have internal predecessors, (24352), 3272 states have call successors, (3272), 23 states have call predecessors, (3272), 27 states have return successors, (3611), 3270 states have call predecessors, (3611), 3271 states have call successors, (3611) [2025-03-03 14:25:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18075 states to 18075 states and 31235 transitions. [2025-03-03 14:25:01,002 INFO L78 Accepts]: Start accepts. Automaton has 18075 states and 31235 transitions. Word has length 148 [2025-03-03 14:25:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:01,002 INFO L471 AbstractCegarLoop]: Abstraction has 18075 states and 31235 transitions. [2025-03-03 14:25:01,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:25:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 18075 states and 31235 transitions. [2025-03-03 14:25:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:25:01,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:01,045 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, 1, 1, 1, 1, 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-03-03 14:25:01,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:25:01,046 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:01,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1213090980, now seen corresponding path program 1 times [2025-03-03 14:25:01,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:01,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064627216] [2025-03-03 14:25:01,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:01,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:01,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:25:01,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:25:01,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:01,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064627216] [2025-03-03 14:25:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064627216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:01,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:01,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306811729] [2025-03-03 14:25:01,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:01,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:01,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:01,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:01,101 INFO L87 Difference]: Start difference. First operand 18075 states and 31235 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:25:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:01,659 INFO L93 Difference]: Finished difference Result 47755 states and 82871 transitions. [2025-03-03 14:25:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 149 [2025-03-03 14:25:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:01,803 INFO L225 Difference]: With dead ends: 47755 [2025-03-03 14:25:01,803 INFO L226 Difference]: Without dead ends: 32253 [2025-03-03 14:25:01,856 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-03-03 14:25:01,856 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 110 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1052 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-03-03 14:25:01,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1052 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32253 states. [2025-03-03 14:25:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32253 to 32245. [2025-03-03 14:25:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32245 states, 26495 states have (on average 1.6453293074164936) internal successors, (43593), 26503 states have internal predecessors, (43593), 5722 states have call successors, (5722), 23 states have call predecessors, (5722), 27 states have return successors, (6335), 5720 states have call predecessors, (6335), 5721 states have call successors, (6335) [2025-03-03 14:25:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32245 states to 32245 states and 55650 transitions. [2025-03-03 14:25:03,534 INFO L78 Accepts]: Start accepts. Automaton has 32245 states and 55650 transitions. Word has length 149 [2025-03-03 14:25:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:03,534 INFO L471 AbstractCegarLoop]: Abstraction has 32245 states and 55650 transitions. [2025-03-03 14:25:03,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:25:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 32245 states and 55650 transitions. [2025-03-03 14:25:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:25:03,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:03,583 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, 1, 1, 1, 1, 1, 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-03-03 14:25:03,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:25:03,584 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:03,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 307840583, now seen corresponding path program 1 times [2025-03-03 14:25:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323114296] [2025-03-03 14:25:03,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:03,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:25:03,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:25:03,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:03,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:03,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323114296] [2025-03-03 14:25:03,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323114296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:03,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:03,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947519840] [2025-03-03 14:25:03,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:03,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:03,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:03,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:03,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:03,640 INFO L87 Difference]: Start difference. First operand 32245 states and 55650 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:25:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:04,590 INFO L93 Difference]: Finished difference Result 87872 states and 152193 transitions. [2025-03-03 14:25:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:04,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 150 [2025-03-03 14:25:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:04,845 INFO L225 Difference]: With dead ends: 87872 [2025-03-03 14:25:04,846 INFO L226 Difference]: Without dead ends: 59067 [2025-03-03 14:25:04,928 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-03-03 14:25:04,929 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 108 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1055 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-03-03 14:25:04,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1055 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59067 states. [2025-03-03 14:25:06,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59067 to 59059. [2025-03-03 14:25:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59059 states, 48796 states have (on average 1.6413845397163702) internal successors, (80093), 48804 states have internal predecessors, (80093), 10235 states have call successors, (10235), 23 states have call predecessors, (10235), 27 states have return successors, (11380), 10233 states have call predecessors, (11380), 10234 states have call successors, (11380) [2025-03-03 14:25:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59059 states to 59059 states and 101708 transitions. [2025-03-03 14:25:07,333 INFO L78 Accepts]: Start accepts. Automaton has 59059 states and 101708 transitions. Word has length 150 [2025-03-03 14:25:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:07,334 INFO L471 AbstractCegarLoop]: Abstraction has 59059 states and 101708 transitions. [2025-03-03 14:25:07,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:25:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 59059 states and 101708 transitions. [2025-03-03 14:25:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:25:07,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:07,402 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, 1, 1, 1, 1, 1, 1, 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-03-03 14:25:07,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:25:07,403 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:07,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:07,403 INFO L85 PathProgramCache]: Analyzing trace with hash -592741509, now seen corresponding path program 1 times [2025-03-03 14:25:07,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:07,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185352254] [2025-03-03 14:25:07,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:07,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:25:07,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:25:07,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:07,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:25:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:07,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185352254] [2025-03-03 14:25:07,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185352254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:07,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:07,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:25:07,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029577539] [2025-03-03 14:25:07,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:07,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:25:07,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:07,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:25:07,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:25:07,475 INFO L87 Difference]: Start difference. First operand 59059 states and 101708 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:25:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:09,361 INFO L93 Difference]: Finished difference Result 110453 states and 190692 transitions. [2025-03-03 14:25:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:25:09,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 151 [2025-03-03 14:25:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:09,877 INFO L225 Difference]: With dead ends: 110453 [2025-03-03 14:25:09,877 INFO L226 Difference]: Without dead ends: 110292 [2025-03-03 14:25:09,966 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-03-03 14:25:09,968 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 103 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1066 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-03-03 14:25:09,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1066 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:25:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110292 states. [2025-03-03 14:25:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110292 to 110284. [2025-03-03 14:25:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110284 states, 91653 states have (on average 1.6362475860037315) internal successors, (149967), 91661 states have internal predecessors, (149967), 18603 states have call successors, (18603), 23 states have call predecessors, (18603), 27 states have return successors, (20794), 18601 states have call predecessors, (20794), 18602 states have call successors, (20794) [2025-03-03 14:25:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110284 states to 110284 states and 189364 transitions. [2025-03-03 14:25:13,940 INFO L78 Accepts]: Start accepts. Automaton has 110284 states and 189364 transitions. Word has length 151 [2025-03-03 14:25:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:13,940 INFO L471 AbstractCegarLoop]: Abstraction has 110284 states and 189364 transitions. [2025-03-03 14:25:13,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:25:13,941 INFO L276 IsEmpty]: Start isEmpty. Operand 110284 states and 189364 transitions. [2025-03-03 14:25:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 14:25:14,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:14,024 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, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:25:14,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:25:14,024 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:14,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:14,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1974218680, now seen corresponding path program 1 times [2025-03-03 14:25:14,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:14,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052551395] [2025-03-03 14:25:14,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:14,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 14:25:14,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 14:25:14,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:14,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:25:14,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052551395] [2025-03-03 14:25:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052551395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:25:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128880700] [2025-03-03 14:25:14,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:14,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:25:14,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:25:14,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:25:14,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 14:25:14,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 14:25:14,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:14,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:14,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 14:25:14,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:25:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:25:14,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:25:14,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128880700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:14,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:25:14,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-03-03 14:25:14,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834837215] [2025-03-03 14:25:14,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:14,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:25:14,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:14,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:25:14,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:25:14,911 INFO L87 Difference]: Start difference. First operand 110284 states and 189364 transitions. Second operand has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 9 states have internal predecessors, (111), 5 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-03 14:25:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:25:20,066 INFO L93 Difference]: Finished difference Result 219729 states and 382750 transitions. [2025-03-03 14:25:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:25:20,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 9 states have internal predecessors, (111), 5 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 152 [2025-03-03 14:25:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:25:20,963 INFO L225 Difference]: With dead ends: 219729 [2025-03-03 14:25:20,963 INFO L226 Difference]: Without dead ends: 219574 [2025-03-03 14:25:21,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:25:21,058 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 1313 mSDsluCounter, 4007 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 4629 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:25:21,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 4629 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:25:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219574 states. [2025-03-03 14:25:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219574 to 219546. [2025-03-03 14:25:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219546 states, 182525 states have (on average 1.636899054923983) internal successors, (298775), 182430 states have internal predecessors, (298775), 36954 states have call successors, (36954), 60 states have call predecessors, (36954), 66 states have return successors, (44610), 37061 states have call predecessors, (44610), 36951 states have call successors, (44610) [2025-03-03 14:25:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219546 states to 219546 states and 380339 transitions. [2025-03-03 14:25:29,304 INFO L78 Accepts]: Start accepts. Automaton has 219546 states and 380339 transitions. Word has length 152 [2025-03-03 14:25:29,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:25:29,304 INFO L471 AbstractCegarLoop]: Abstraction has 219546 states and 380339 transitions. [2025-03-03 14:25:29,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 9 states have internal predecessors, (111), 5 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-03 14:25:29,304 INFO L276 IsEmpty]: Start isEmpty. Operand 219546 states and 380339 transitions. [2025-03-03 14:25:29,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 14:25:29,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:25:29,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:25:29,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:25:29,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:25:29,673 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:25:29,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:25:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1040752656, now seen corresponding path program 1 times [2025-03-03 14:25:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:25:29,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138595336] [2025-03-03 14:25:29,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:25:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:25:29,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 14:25:29,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 14:25:29,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:25:29,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:25:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:25:29,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:25:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138595336] [2025-03-03 14:25:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138595336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:25:29,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:25:29,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:25:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134481693] [2025-03-03 14:25:29,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:25:29,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:25:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:25:29,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:25:29,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:25:29,796 INFO L87 Difference]: Start difference. First operand 219546 states and 380339 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19)