./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_spec27_product34.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 39fe77adb61a1e466f06fcf9920e7f42d562f22740249d3a797ea504e0f3c31a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:32:35,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:32:36,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:32:36,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:32:36,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:32:36,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:32:36,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:32:36,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:32:36,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:32:36,077 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:32:36,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:32:36,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:32:36,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:32:36,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:32:36,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:32:36,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:36,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:32:36,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:32:36,079 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:32:36,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:32:36,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:32:36,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:32:36,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:32:36,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:32:36,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:32:36,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:32:36,079 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 -> 39fe77adb61a1e466f06fcf9920e7f42d562f22740249d3a797ea504e0f3c31a [2025-03-08 05:32:36,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:32:36,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:32:36,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:32:36,329 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:32:36,329 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:32:36,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product34.cil.c [2025-03-08 05:32:37,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4821e55/97ec7e6e1a41409c8594216654de313d/FLAG7758440b8 [2025-03-08 05:32:37,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:32:37,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product34.cil.c [2025-03-08 05:32:37,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4821e55/97ec7e6e1a41409c8594216654de313d/FLAG7758440b8 [2025-03-08 05:32:37,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4821e55/97ec7e6e1a41409c8594216654de313d [2025-03-08 05:32:37,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:32:37,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:32:37,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:37,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:32:37,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:32:37,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:37" (1/1) ... [2025-03-08 05:32:37,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c165cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:37, skipping insertion in model container [2025-03-08 05:32:37,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:37" (1/1) ... [2025-03-08 05:32:37,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:32:38,403 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_spec27_product34.cil.c[51595,51608] [2025-03-08 05:32:38,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:38,470 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:32:38,476 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-03-08 05:32:38,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1128] [2025-03-08 05:32:38,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1288] [2025-03-08 05:32:38,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1517] [2025-03-08 05:32:38,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1534] [2025-03-08 05:32:38,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1936] [2025-03-08 05:32:38,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1974] [2025-03-08 05:32:38,478 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2380] [2025-03-08 05:32:38,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2412] [2025-03-08 05:32:38,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2421] [2025-03-08 05:32:38,479 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2787] [2025-03-08 05:32:38,537 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_spec27_product34.cil.c[51595,51608] [2025-03-08 05:32:38,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:38,583 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:32:38,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38 WrapperNode [2025-03-08 05:32:38,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:38,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:38,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:32:38,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:32:38,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,657 INFO L138 Inliner]: procedures = 134, calls = 220, calls flagged for inlining = 61, calls inlined = 58, statements flattened = 1092 [2025-03-08 05:32:38,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:38,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:32:38,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:32:38,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:32:38,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,694 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-08 05:32:38,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:32:38,721 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:32:38,721 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:32:38,721 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:32:38,722 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (1/1) ... [2025-03-08 05:32:38,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:38,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:38,755 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-08 05:32:38,758 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-08 05:32:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:32:38,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:32:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:32:38,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:32:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:32:38,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:32:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:32:38,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:32:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:32:38,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:32:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:32:38,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:32:38,777 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:32:38,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:32:38,778 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:32:38,779 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:32:38,779 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-08 05:32:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-03-08 05:32:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:32:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:32:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:32:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:32:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:32:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:32:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:32:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:32:38,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:32:38,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:32:38,965 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:32:38,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:32:39,072 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1843: #res := ~retValue_acc~30; [2025-03-08 05:32:39,087 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917: #res := ~retValue_acc~32; [2025-03-08 05:32:39,099 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2279: #res := ~retValue_acc~39; [2025-03-08 05:32:39,151 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: #res#1 := ~retValue_acc~11#1; [2025-03-08 05:32:39,152 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~10#1; [2025-03-08 05:32:39,327 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1580-1: getEmailId_#res#1 := getEmailId_~retValue_acc~23#1; [2025-03-08 05:32:39,328 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1105-1: getClientId_#res#1 := getClientId_~retValue_acc~16#1; [2025-03-08 05:32:39,328 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1058-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~15#1; [2025-03-08 05:32:39,354 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: #res := ~retValue_acc~14; [2025-03-08 05:32:39,361 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: #res := ~retValue_acc~9; [2025-03-08 05:32:39,373 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1285-1: createEmail_#res#1 := createEmail_~retValue_acc~20#1; [2025-03-08 05:32:39,383 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: #res := ~retValue_acc~3; [2025-03-08 05:32:39,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1769: #res := ~retValue_acc~28; [2025-03-08 05:32:39,423 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806: #res := ~retValue_acc~29; [2025-03-08 05:32:39,429 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880: #res := ~retValue_acc~31; [2025-03-08 05:32:39,449 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654: #res := ~retValue_acc~25; [2025-03-08 05:32:39,494 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: #res := ~retValue_acc~7; [2025-03-08 05:32:39,696 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1971-1: valid_product_#res#1 := valid_product_~retValue_acc~34#1; [2025-03-08 05:32:39,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2236-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~36#1; [2025-03-08 05:32:39,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~13#1; [2025-03-08 05:32:39,697 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2254-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~38#1; [2025-03-08 05:32:39,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2245-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~37#1; [2025-03-08 05:32:39,698 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~12#1; [2025-03-08 05:32:39,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1617: #res := ~retValue_acc~24; [2025-03-08 05:32:39,713 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1261: #res#1 := ~retValue_acc~18#1; [2025-03-08 05:32:39,714 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~17#1; [2025-03-08 05:32:39,880 INFO L? ?]: Removed 582 outVars from TransFormulas that were not future-live. [2025-03-08 05:32:39,880 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:32:39,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:32:39,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:32:39,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:39 BoogieIcfgContainer [2025-03-08 05:32:39,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:32:39,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:32:39,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:32:39,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:32:39,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:32:37" (1/3) ... [2025-03-08 05:32:39,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67043ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:39, skipping insertion in model container [2025-03-08 05:32:39,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:38" (2/3) ... [2025-03-08 05:32:39,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67043ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:39, skipping insertion in model container [2025-03-08 05:32:39,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:39" (3/3) ... [2025-03-08 05:32:39,908 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product34.cil.c [2025-03-08 05:32:39,921 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:32:39,925 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product34.cil.c that has 30 procedures, 451 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:32:39,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:32:39,995 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;@17b6d528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:32:39,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:32:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 451 states, 347 states have (on average 1.5331412103746398) internal successors, (532), 352 states have internal predecessors, (532), 73 states have call successors, (73), 29 states have call predecessors, (73), 29 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-08 05:32:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 05:32:40,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:40,015 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:40,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:40,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:40,019 INFO L85 PathProgramCache]: Analyzing trace with hash 468952020, now seen corresponding path program 1 times [2025-03-08 05:32:40,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:40,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632197267] [2025-03-08 05:32:40,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:40,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:40,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:32:40,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:32:40,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:40,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 05:32:40,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:40,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632197267] [2025-03-08 05:32:40,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632197267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:40,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939940406] [2025-03-08 05:32:40,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:40,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:40,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:40,707 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-08 05:32:40,721 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-08 05:32:40,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 05:32:41,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 05:32:41,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:41,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:41,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:32:41,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 05:32:41,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:41,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939940406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:41,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:41,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:32:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828728885] [2025-03-08 05:32:41,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:41,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:41,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:41,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:41,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:41,130 INFO L87 Difference]: Start difference. First operand has 451 states, 347 states have (on average 1.5331412103746398) internal successors, (532), 352 states have internal predecessors, (532), 73 states have call successors, (73), 29 states have call predecessors, (73), 29 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:41,225 INFO L93 Difference]: Finished difference Result 712 states and 1052 transitions. [2025-03-08 05:32:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:41,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 170 [2025-03-08 05:32:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:41,240 INFO L225 Difference]: With dead ends: 712 [2025-03-08 05:32:41,240 INFO L226 Difference]: Without dead ends: 445 [2025-03-08 05:32:41,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 170 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-08 05:32:41,248 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 0 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1345 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-08 05:32:41,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-08 05:32:41,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-03-08 05:32:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 342 states have (on average 1.5292397660818713) internal successors, (523), 346 states have internal predecessors, (523), 73 states have call successors, (73), 29 states have call predecessors, (73), 29 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 05:32:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 668 transitions. [2025-03-08 05:32:41,304 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 668 transitions. Word has length 170 [2025-03-08 05:32:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:41,306 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 668 transitions. [2025-03-08 05:32:41,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 668 transitions. [2025-03-08 05:32:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 05:32:41,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:41,312 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:41,320 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-08 05:32:41,512 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-08 05:32:41,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:41,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:41,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1321829476, now seen corresponding path program 1 times [2025-03-08 05:32:41,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:41,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489422317] [2025-03-08 05:32:41,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:41,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 05:32:41,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 05:32:41,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:41,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:41,818 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 05:32:41,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:41,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489422317] [2025-03-08 05:32:41,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489422317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:41,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903432441] [2025-03-08 05:32:41,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:41,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:41,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:41,823 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-08 05:32:41,824 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-08 05:32:41,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 05:32:42,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 05:32:42,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:42,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:42,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 1354 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:42,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 05:32:42,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:42,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903432441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:42,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:42,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:32:42,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979009111] [2025-03-08 05:32:42,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:42,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:42,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:42,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:42,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:32:42,186 INFO L87 Difference]: Start difference. First operand 445 states and 668 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:42,241 INFO L93 Difference]: Finished difference Result 937 states and 1427 transitions. [2025-03-08 05:32:42,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:42,242 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 174 [2025-03-08 05:32:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:42,249 INFO L225 Difference]: With dead ends: 937 [2025-03-08 05:32:42,250 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 05:32:42,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 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-08 05:32:42,252 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 134 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1295 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-08 05:32:42,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1295 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 05:32:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 510. [2025-03-08 05:32:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 393 states have (on average 1.5521628498727735) internal successors, (610), 397 states have internal predecessors, (610), 87 states have call successors, (87), 29 states have call predecessors, (87), 29 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:32:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 783 transitions. [2025-03-08 05:32:42,291 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 783 transitions. Word has length 174 [2025-03-08 05:32:42,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:42,292 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 783 transitions. [2025-03-08 05:32:42,292 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:42,292 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 783 transitions. [2025-03-08 05:32:42,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 05:32:42,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:42,296 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:42,305 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-08 05:32:42,500 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-08 05:32:42,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:42,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash 2056883107, now seen corresponding path program 1 times [2025-03-08 05:32:42,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:42,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947128622] [2025-03-08 05:32:42,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:42,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:42,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:32:42,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:32:42,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:42,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:32:42,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:42,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947128622] [2025-03-08 05:32:42,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947128622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:42,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15013388] [2025-03-08 05:32:42,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:42,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:42,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:42,725 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-08 05:32:42,727 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-08 05:32:42,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:32:43,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:32:43,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:43,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:43,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:32:43,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:43,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:43,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15013388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:43,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:43,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:32:43,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912316284] [2025-03-08 05:32:43,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:43,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:43,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:43,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:43,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:43,052 INFO L87 Difference]: Start difference. First operand 510 states and 783 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:32:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:43,110 INFO L93 Difference]: Finished difference Result 1011 states and 1556 transitions. [2025-03-08 05:32:43,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:43,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2025-03-08 05:32:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:43,115 INFO L225 Difference]: With dead ends: 1011 [2025-03-08 05:32:43,115 INFO L226 Difference]: Without dead ends: 512 [2025-03-08 05:32:43,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 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-08 05:32:43,117 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 2 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2625 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-08 05:32:43,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2625 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-08 05:32:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-03-08 05:32:43,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 394 states have (on average 1.5507614213197969) internal successors, (611), 399 states have internal predecessors, (611), 87 states have call successors, (87), 29 states have call predecessors, (87), 30 states have return successors, (88), 85 states have call predecessors, (88), 86 states have call successors, (88) [2025-03-08 05:32:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 786 transitions. [2025-03-08 05:32:43,134 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 786 transitions. Word has length 156 [2025-03-08 05:32:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:43,134 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 786 transitions. [2025-03-08 05:32:43,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:32:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 786 transitions. [2025-03-08 05:32:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 05:32:43,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:43,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:43,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:43,337 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-08 05:32:43,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:43,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash 882785540, now seen corresponding path program 1 times [2025-03-08 05:32:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:43,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334067660] [2025-03-08 05:32:43,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:43,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:32:43,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:32:43,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:43,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:43,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:43,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334067660] [2025-03-08 05:32:43,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334067660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:43,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173123933] [2025-03-08 05:32:43,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:43,517 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-08 05:32:43,518 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-08 05:32:43,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:32:43,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:32:43,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:43,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:43,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:32:43,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:32:43,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:43,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173123933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:43,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:43,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:32:43,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241051550] [2025-03-08 05:32:43,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:43,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:43,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:43,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:43,872 INFO L87 Difference]: Start difference. First operand 512 states and 786 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:32:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:43,946 INFO L93 Difference]: Finished difference Result 1013 states and 1561 transitions. [2025-03-08 05:32:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:43,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2025-03-08 05:32:43,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:43,950 INFO L225 Difference]: With dead ends: 1013 [2025-03-08 05:32:43,950 INFO L226 Difference]: Without dead ends: 514 [2025-03-08 05:32:43,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 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-08 05:32:43,955 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 2 mSDsluCounter, 1954 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2611 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-08 05:32:43,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2611 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-08 05:32:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-03-08 05:32:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 395 states have (on average 1.549367088607595) internal successors, (612), 401 states have internal predecessors, (612), 87 states have call successors, (87), 29 states have call predecessors, (87), 31 states have return successors, (93), 85 states have call predecessors, (93), 86 states have call successors, (93) [2025-03-08 05:32:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 792 transitions. [2025-03-08 05:32:43,984 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 792 transitions. Word has length 157 [2025-03-08 05:32:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:43,984 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 792 transitions. [2025-03-08 05:32:43,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:32:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 792 transitions. [2025-03-08 05:32:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:32:43,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:43,986 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:43,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:32:44,187 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-08 05:32:44,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:44,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash -74643865, now seen corresponding path program 1 times [2025-03-08 05:32:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:44,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831450181] [2025-03-08 05:32:44,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:44,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:44,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:32:44,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:32:44,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:44,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:32:44,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:44,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831450181] [2025-03-08 05:32:44,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831450181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:44,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:44,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:44,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360058597] [2025-03-08 05:32:44,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:44,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:44,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:44,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:44,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:44,332 INFO L87 Difference]: Start difference. First operand 514 states and 792 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:32:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:44,376 INFO L93 Difference]: Finished difference Result 1005 states and 1552 transitions. [2025-03-08 05:32:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:44,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 158 [2025-03-08 05:32:44,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:44,379 INFO L225 Difference]: With dead ends: 1005 [2025-03-08 05:32:44,379 INFO L226 Difference]: Without dead ends: 514 [2025-03-08 05:32:44,381 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-08 05:32:44,381 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 2 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2629 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-08 05:32:44,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2629 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:44,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-08 05:32:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-03-08 05:32:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 395 states have (on average 1.549367088607595) internal successors, (612), 401 states have internal predecessors, (612), 87 states have call successors, (87), 29 states have call predecessors, (87), 31 states have return successors, (92), 85 states have call predecessors, (92), 86 states have call successors, (92) [2025-03-08 05:32:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 791 transitions. [2025-03-08 05:32:44,412 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 791 transitions. Word has length 158 [2025-03-08 05:32:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:44,412 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 791 transitions. [2025-03-08 05:32:44,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:32:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 791 transitions. [2025-03-08 05:32:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 05:32:44,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:44,416 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:44,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:32:44,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:44,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:44,417 INFO L85 PathProgramCache]: Analyzing trace with hash 36500393, now seen corresponding path program 1 times [2025-03-08 05:32:44,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:44,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483688648] [2025-03-08 05:32:44,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:44,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:44,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 05:32:44,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 05:32:44,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:44,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 05:32:44,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483688648] [2025-03-08 05:32:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483688648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:44,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:44,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403746707] [2025-03-08 05:32:44,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:44,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:44,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:44,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:44,592 INFO L87 Difference]: Start difference. First operand 514 states and 791 transitions. Second operand has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:32:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:44,641 INFO L93 Difference]: Finished difference Result 1007 states and 1555 transitions. [2025-03-08 05:32:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:44,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 178 [2025-03-08 05:32:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:44,646 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 05:32:44,646 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 05:32:44,647 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-08 05:32:44,648 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 1 mSDsluCounter, 1971 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2632 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-08 05:32:44,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2632 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 05:32:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-08 05:32:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 396 states have (on average 1.547979797979798) internal successors, (613), 403 states have internal predecessors, (613), 87 states have call successors, (87), 29 states have call predecessors, (87), 32 states have return successors, (94), 85 states have call predecessors, (94), 86 states have call successors, (94) [2025-03-08 05:32:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 794 transitions. [2025-03-08 05:32:44,671 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 794 transitions. Word has length 178 [2025-03-08 05:32:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:44,672 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 794 transitions. [2025-03-08 05:32:44,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.75) internal successors, (103), 5 states have internal predecessors, (103), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-08 05:32:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 794 transitions. [2025-03-08 05:32:44,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 05:32:44,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:44,674 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:44,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:32:44,674 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:44,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:44,675 INFO L85 PathProgramCache]: Analyzing trace with hash -378425180, now seen corresponding path program 1 times [2025-03-08 05:32:44,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:44,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786976071] [2025-03-08 05:32:44,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:44,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:44,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:32:44,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:32:44,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:44,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:44,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786976071] [2025-03-08 05:32:44,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786976071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:44,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:44,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:44,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685204248] [2025-03-08 05:32:44,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:44,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:44,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:44,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:44,834 INFO L87 Difference]: Start difference. First operand 516 states and 794 transitions. Second operand has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:32:44,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:44,965 INFO L93 Difference]: Finished difference Result 1009 states and 1554 transitions. [2025-03-08 05:32:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:32:44,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2025-03-08 05:32:44,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:44,968 INFO L225 Difference]: With dead ends: 1009 [2025-03-08 05:32:44,971 INFO L226 Difference]: Without dead ends: 518 [2025-03-08 05:32:44,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:44,973 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 7 mSDsluCounter, 3877 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:44,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4528 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-08 05:32:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-08 05:32:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 398 states have (on average 1.5452261306532664) internal successors, (615), 404 states have internal predecessors, (615), 87 states have call successors, (87), 30 states have call predecessors, (87), 32 states have return successors, (93), 85 states have call predecessors, (93), 86 states have call successors, (93) [2025-03-08 05:32:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 795 transitions. [2025-03-08 05:32:44,996 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 795 transitions. Word has length 160 [2025-03-08 05:32:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:44,996 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 795 transitions. [2025-03-08 05:32:44,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.285714285714286) internal successors, (100), 8 states have internal predecessors, (100), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:32:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 795 transitions. [2025-03-08 05:32:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 05:32:44,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:44,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:44,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:32:44,999 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:45,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2043498729, now seen corresponding path program 2 times [2025-03-08 05:32:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:45,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786272567] [2025-03-08 05:32:45,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:45,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 161 statements into 2 equivalence classes. [2025-03-08 05:32:45,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 05:32:45,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:32:45,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 05:32:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786272567] [2025-03-08 05:32:45,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786272567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:45,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:45,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:32:45,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822951231] [2025-03-08 05:32:45,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:45,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:32:45,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:45,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:32:45,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:45,190 INFO L87 Difference]: Start difference. First operand 518 states and 795 transitions. Second operand has 7 states, 6 states have (on average 16.333333333333332) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:32:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:45,273 INFO L93 Difference]: Finished difference Result 1009 states and 1558 transitions. [2025-03-08 05:32:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:32:45,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.333333333333332) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2025-03-08 05:32:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:45,278 INFO L225 Difference]: With dead ends: 1009 [2025-03-08 05:32:45,278 INFO L226 Difference]: Without dead ends: 520 [2025-03-08 05:32:45,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:45,280 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 2 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3926 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:45,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3926 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-08 05:32:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-03-08 05:32:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 399 states have (on average 1.543859649122807) internal successors, (616), 406 states have internal predecessors, (616), 87 states have call successors, (87), 30 states have call predecessors, (87), 33 states have return successors, (98), 85 states have call predecessors, (98), 86 states have call successors, (98) [2025-03-08 05:32:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 801 transitions. [2025-03-08 05:32:45,298 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 801 transitions. Word has length 161 [2025-03-08 05:32:45,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:45,299 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 801 transitions. [2025-03-08 05:32:45,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.333333333333332) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-08 05:32:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 801 transitions. [2025-03-08 05:32:45,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 05:32:45,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:45,301 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:45,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:32:45,301 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:45,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:45,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1972820639, now seen corresponding path program 1 times [2025-03-08 05:32:45,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:45,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853217060] [2025-03-08 05:32:45,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:45,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:45,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 05:32:45,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 05:32:45,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:45,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:45,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853217060] [2025-03-08 05:32:45,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853217060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139042854] [2025-03-08 05:32:45,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:45,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:45,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:45,419 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-08 05:32:45,419 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-08 05:32:45,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 05:32:45,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 05:32:45,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:45,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:45,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:45,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:45,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:32:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:45,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139042854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:32:45,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:32:45,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:32:45,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871141518] [2025-03-08 05:32:45,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:32:45,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:32:45,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:45,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:32:45,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:45,824 INFO L87 Difference]: Start difference. First operand 520 states and 801 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 05:32:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:45,972 INFO L93 Difference]: Finished difference Result 1205 states and 1921 transitions. [2025-03-08 05:32:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:32:45,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 162 [2025-03-08 05:32:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:45,979 INFO L225 Difference]: With dead ends: 1205 [2025-03-08 05:32:45,979 INFO L226 Difference]: Without dead ends: 951 [2025-03-08 05:32:45,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 321 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-08 05:32:45,981 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 605 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:45,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2487 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-08 05:32:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 927. [2025-03-08 05:32:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 727 states have (on average 1.6203576341127923) internal successors, (1178), 734 states have internal predecessors, (1178), 166 states have call successors, (166), 30 states have call predecessors, (166), 33 states have return successors, (187), 164 states have call predecessors, (187), 165 states have call successors, (187) [2025-03-08 05:32:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1531 transitions. [2025-03-08 05:32:46,036 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1531 transitions. Word has length 162 [2025-03-08 05:32:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:46,036 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1531 transitions. [2025-03-08 05:32:46,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 05:32:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1531 transitions. [2025-03-08 05:32:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 05:32:46,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:46,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:46,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:32:46,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:46,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:46,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash 610617602, now seen corresponding path program 1 times [2025-03-08 05:32:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669481943] [2025-03-08 05:32:46,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:46,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 05:32:46,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 05:32:46,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:46,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:46,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669481943] [2025-03-08 05:32:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669481943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:46,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:46,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:46,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315240204] [2025-03-08 05:32:46,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:46,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:46,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:46,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:46,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:46,316 INFO L87 Difference]: Start difference. First operand 927 states and 1531 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:46,348 INFO L93 Difference]: Finished difference Result 2199 states and 3689 transitions. [2025-03-08 05:32:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:46,350 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2025-03-08 05:32:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:46,359 INFO L225 Difference]: With dead ends: 2199 [2025-03-08 05:32:46,359 INFO L226 Difference]: Without dead ends: 1338 [2025-03-08 05:32:46,363 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-08 05:32:46,363 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 132 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1345 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-08 05:32:46,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-08 05:32:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2025-03-08 05:32:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1051 states have (on average 1.6422454804947668) internal successors, (1726), 1058 states have internal predecessors, (1726), 245 states have call successors, (245), 30 states have call predecessors, (245), 33 states have return successors, (276), 243 states have call predecessors, (276), 244 states have call successors, (276) [2025-03-08 05:32:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2247 transitions. [2025-03-08 05:32:46,415 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 2247 transitions. Word has length 169 [2025-03-08 05:32:46,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:46,417 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 2247 transitions. [2025-03-08 05:32:46,417 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, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 2247 transitions. [2025-03-08 05:32:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-08 05:32:46,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:46,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:46,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:32:46,425 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:46,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1503087806, now seen corresponding path program 1 times [2025-03-08 05:32:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415581342] [2025-03-08 05:32:46,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:46,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-08 05:32:46,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-08 05:32:46,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:46,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:46,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415581342] [2025-03-08 05:32:46,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415581342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:46,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:46,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861063782] [2025-03-08 05:32:46,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:46,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:46,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:46,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:46,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:46,487 INFO L87 Difference]: Start difference. First operand 1330 states and 2247 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:46,537 INFO L93 Difference]: Finished difference Result 3185 states and 5423 transitions. [2025-03-08 05:32:46,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:46,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 189 [2025-03-08 05:32:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:46,549 INFO L225 Difference]: With dead ends: 3185 [2025-03-08 05:32:46,549 INFO L226 Difference]: Without dead ends: 1970 [2025-03-08 05:32:46,554 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-08 05:32:46,554 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 130 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1330 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-08 05:32:46,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1330 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-03-08 05:32:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1962. [2025-03-08 05:32:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1564 states have (on average 1.657928388746803) internal successors, (2593), 1571 states have internal predecessors, (2593), 364 states have call successors, (364), 30 states have call predecessors, (364), 33 states have return successors, (395), 362 states have call predecessors, (395), 363 states have call successors, (395) [2025-03-08 05:32:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 3352 transitions. [2025-03-08 05:32:46,626 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 3352 transitions. Word has length 189 [2025-03-08 05:32:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:46,626 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 3352 transitions. [2025-03-08 05:32:46,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 3352 transitions. [2025-03-08 05:32:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 05:32:46,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:46,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:46,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:32:46,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:46,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1696333699, now seen corresponding path program 1 times [2025-03-08 05:32:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:46,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074562013] [2025-03-08 05:32:46,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:46,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 05:32:46,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 05:32:46,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:46,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:46,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074562013] [2025-03-08 05:32:46,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074562013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:46,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:46,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:46,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143316363] [2025-03-08 05:32:46,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:46,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:46,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:46,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:46,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:46,710 INFO L87 Difference]: Start difference. First operand 1962 states and 3352 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:46,774 INFO L93 Difference]: Finished difference Result 4669 states and 8045 transitions. [2025-03-08 05:32:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:46,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 171 [2025-03-08 05:32:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:46,790 INFO L225 Difference]: With dead ends: 4669 [2025-03-08 05:32:46,790 INFO L226 Difference]: Without dead ends: 2940 [2025-03-08 05:32:46,797 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-08 05:32:46,798 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 128 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1323 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-08 05:32:46,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1323 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-03-08 05:32:46,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2932. [2025-03-08 05:32:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 2372 states have (on average 1.6703204047217537) internal successors, (3962), 2379 states have internal predecessors, (3962), 526 states have call successors, (526), 30 states have call predecessors, (526), 33 states have return successors, (573), 524 states have call predecessors, (573), 525 states have call successors, (573) [2025-03-08 05:32:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 5061 transitions. [2025-03-08 05:32:46,903 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 5061 transitions. Word has length 171 [2025-03-08 05:32:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:46,904 INFO L471 AbstractCegarLoop]: Abstraction has 2932 states and 5061 transitions. [2025-03-08 05:32:46,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 5061 transitions. [2025-03-08 05:32:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 05:32:46,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:46,919 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:46,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:32:46,919 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:46,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1899500803, now seen corresponding path program 1 times [2025-03-08 05:32:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:46,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351291999] [2025-03-08 05:32:46,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:46,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 05:32:46,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 05:32:46,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:46,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:46,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351291999] [2025-03-08 05:32:46,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351291999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513050970] [2025-03-08 05:32:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:46,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:46,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:46,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:46,977 INFO L87 Difference]: Start difference. First operand 2932 states and 5061 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:47,106 INFO L93 Difference]: Finished difference Result 7016 states and 12200 transitions. [2025-03-08 05:32:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:47,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-03-08 05:32:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:47,128 INFO L225 Difference]: With dead ends: 7016 [2025-03-08 05:32:47,128 INFO L226 Difference]: Without dead ends: 4510 [2025-03-08 05:32:47,135 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-08 05:32:47,135 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 126 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1323 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-08 05:32:47,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1323 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2025-03-08 05:32:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4502. [2025-03-08 05:32:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4502 states, 3697 states have (on average 1.6791993508249932) internal successors, (6208), 3704 states have internal predecessors, (6208), 771 states have call successors, (771), 30 states have call predecessors, (771), 33 states have return successors, (844), 769 states have call predecessors, (844), 770 states have call successors, (844) [2025-03-08 05:32:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4502 states to 4502 states and 7823 transitions. [2025-03-08 05:32:47,321 INFO L78 Accepts]: Start accepts. Automaton has 4502 states and 7823 transitions. Word has length 191 [2025-03-08 05:32:47,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:47,321 INFO L471 AbstractCegarLoop]: Abstraction has 4502 states and 7823 transitions. [2025-03-08 05:32:47,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4502 states and 7823 transitions. [2025-03-08 05:32:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 05:32:47,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:47,344 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:47,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:32:47,344 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:47,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:47,346 INFO L85 PathProgramCache]: Analyzing trace with hash 733425835, now seen corresponding path program 1 times [2025-03-08 05:32:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:47,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182793860] [2025-03-08 05:32:47,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:47,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:47,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 05:32:47,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 05:32:47,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:47,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:47,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:47,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182793860] [2025-03-08 05:32:47,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182793860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:47,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:47,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:47,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636379258] [2025-03-08 05:32:47,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:47,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:47,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:47,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:47,427 INFO L87 Difference]: Start difference. First operand 4502 states and 7823 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:47,649 INFO L93 Difference]: Finished difference Result 10929 states and 19127 transitions. [2025-03-08 05:32:47,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:47,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2025-03-08 05:32:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:47,705 INFO L225 Difference]: With dead ends: 10929 [2025-03-08 05:32:47,707 INFO L226 Difference]: Without dead ends: 7149 [2025-03-08 05:32:47,725 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-08 05:32:47,725 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 124 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1334 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-08 05:32:47,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1334 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7149 states. [2025-03-08 05:32:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7149 to 7141. [2025-03-08 05:32:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7141 states, 5843 states have (on average 1.6804723600889955) internal successors, (9819), 5850 states have internal predecessors, (9819), 1264 states have call successors, (1264), 30 states have call predecessors, (1264), 33 states have return successors, (1381), 1262 states have call predecessors, (1381), 1263 states have call successors, (1381) [2025-03-08 05:32:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 12464 transitions. [2025-03-08 05:32:48,047 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 12464 transitions. Word has length 192 [2025-03-08 05:32:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:48,047 INFO L471 AbstractCegarLoop]: Abstraction has 7141 states and 12464 transitions. [2025-03-08 05:32:48,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 12464 transitions. [2025-03-08 05:32:48,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 05:32:48,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:48,082 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:48,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:32:48,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:48,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 939072708, now seen corresponding path program 1 times [2025-03-08 05:32:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:48,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596362806] [2025-03-08 05:32:48,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:48,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 05:32:48,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 05:32:48,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:48,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:48,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:48,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596362806] [2025-03-08 05:32:48,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596362806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:48,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:48,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:48,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085485233] [2025-03-08 05:32:48,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:48,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:48,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:48,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:48,144 INFO L87 Difference]: Start difference. First operand 7141 states and 12464 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:48,379 INFO L93 Difference]: Finished difference Result 18026 states and 31662 transitions. [2025-03-08 05:32:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:48,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2025-03-08 05:32:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:48,432 INFO L225 Difference]: With dead ends: 18026 [2025-03-08 05:32:48,432 INFO L226 Difference]: Without dead ends: 11962 [2025-03-08 05:32:48,460 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-08 05:32:48,460 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 122 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1328 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-08 05:32:48,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1328 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11962 states. [2025-03-08 05:32:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11962 to 11954. [2025-03-08 05:32:48,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11954 states, 9834 states have (on average 1.6822249339027862) internal successors, (16543), 9841 states have internal predecessors, (16543), 2086 states have call successors, (2086), 30 states have call predecessors, (2086), 33 states have return successors, (2281), 2084 states have call predecessors, (2281), 2085 states have call successors, (2281) [2025-03-08 05:32:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11954 states to 11954 states and 20910 transitions. [2025-03-08 05:32:48,895 INFO L78 Accepts]: Start accepts. Automaton has 11954 states and 20910 transitions. Word has length 193 [2025-03-08 05:32:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:48,896 INFO L471 AbstractCegarLoop]: Abstraction has 11954 states and 20910 transitions. [2025-03-08 05:32:48,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 11954 states and 20910 transitions. [2025-03-08 05:32:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 05:32:48,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:48,938 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:48,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:32:48,939 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:48,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:48,939 INFO L85 PathProgramCache]: Analyzing trace with hash -754658358, now seen corresponding path program 1 times [2025-03-08 05:32:48,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:48,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455894185] [2025-03-08 05:32:48,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:48,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 05:32:48,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 05:32:48,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:48,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:49,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455894185] [2025-03-08 05:32:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455894185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:49,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:49,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:49,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576302628] [2025-03-08 05:32:49,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:49,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:49,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:49,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:49,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:49,008 INFO L87 Difference]: Start difference. First operand 11954 states and 20910 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:49,421 INFO L93 Difference]: Finished difference Result 28544 states and 49906 transitions. [2025-03-08 05:32:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:49,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 194 [2025-03-08 05:32:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:49,493 INFO L225 Difference]: With dead ends: 28544 [2025-03-08 05:32:49,493 INFO L226 Difference]: Without dead ends: 18612 [2025-03-08 05:32:49,527 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-08 05:32:49,528 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 120 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1306 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-08 05:32:49,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1306 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18612 states. [2025-03-08 05:32:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18612 to 18604. [2025-03-08 05:32:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18604 states, 15281 states have (on average 1.6610169491525424) internal successors, (25382), 15288 states have internal predecessors, (25382), 3289 states have call successors, (3289), 30 states have call predecessors, (3289), 33 states have return successors, (3628), 3287 states have call predecessors, (3628), 3288 states have call successors, (3628) [2025-03-08 05:32:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18604 states to 18604 states and 32299 transitions. [2025-03-08 05:32:50,375 INFO L78 Accepts]: Start accepts. Automaton has 18604 states and 32299 transitions. Word has length 194 [2025-03-08 05:32:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:50,376 INFO L471 AbstractCegarLoop]: Abstraction has 18604 states and 32299 transitions. [2025-03-08 05:32:50,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 18604 states and 32299 transitions. [2025-03-08 05:32:50,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 05:32:50,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:50,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:50,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:32:50,435 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:50,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:50,436 INFO L85 PathProgramCache]: Analyzing trace with hash 135707594, now seen corresponding path program 1 times [2025-03-08 05:32:50,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:50,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035048350] [2025-03-08 05:32:50,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 05:32:50,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 05:32:50,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:50,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:50,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:50,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035048350] [2025-03-08 05:32:50,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035048350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:50,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:50,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628872730] [2025-03-08 05:32:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:50,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:50,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:50,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:50,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:50,491 INFO L87 Difference]: Start difference. First operand 18604 states and 32299 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:51,163 INFO L93 Difference]: Finished difference Result 49141 states and 85651 transitions. [2025-03-08 05:32:51,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:51,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 176 [2025-03-08 05:32:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:51,292 INFO L225 Difference]: With dead ends: 49141 [2025-03-08 05:32:51,292 INFO L226 Difference]: Without dead ends: 33164 [2025-03-08 05:32:51,333 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-08 05:32:51,334 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 118 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:51,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1326 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33164 states. [2025-03-08 05:32:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33164 to 33156. [2025-03-08 05:32:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33156 states, 27383 states have (on average 1.658547273856042) internal successors, (45416), 27390 states have internal predecessors, (45416), 5739 states have call successors, (5739), 30 states have call predecessors, (5739), 33 states have return successors, (6352), 5737 states have call predecessors, (6352), 5738 states have call successors, (6352) [2025-03-08 05:32:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33156 states to 33156 states and 57507 transitions. [2025-03-08 05:32:52,350 INFO L78 Accepts]: Start accepts. Automaton has 33156 states and 57507 transitions. Word has length 176 [2025-03-08 05:32:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:52,351 INFO L471 AbstractCegarLoop]: Abstraction has 33156 states and 57507 transitions. [2025-03-08 05:32:52,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 33156 states and 57507 transitions. [2025-03-08 05:32:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 05:32:52,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:52,433 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:52,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:32:52,433 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:52,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2000598034, now seen corresponding path program 1 times [2025-03-08 05:32:52,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:52,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003635582] [2025-03-08 05:32:52,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:52,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:52,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 05:32:52,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 05:32:52,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:52,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 05:32:52,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:52,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003635582] [2025-03-08 05:32:52,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003635582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:52,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:52,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:52,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053363716] [2025-03-08 05:32:52,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:52,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:52,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:52,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:52,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:52,542 INFO L87 Difference]: Start difference. First operand 33156 states and 57507 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:53,562 INFO L93 Difference]: Finished difference Result 62606 states and 108734 transitions. [2025-03-08 05:32:53,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:53,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 196 [2025-03-08 05:32:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:53,735 INFO L225 Difference]: With dead ends: 62606 [2025-03-08 05:32:53,735 INFO L226 Difference]: Without dead ends: 33164 [2025-03-08 05:32:53,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 05:32:53,832 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 131 mSDsluCounter, 2297 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:53,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 3108 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33164 states. [2025-03-08 05:32:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33164 to 33156. [2025-03-08 05:32:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33156 states, 27383 states have (on average 1.6488332176898075) internal successors, (45150), 27390 states have internal predecessors, (45150), 5739 states have call successors, (5739), 30 states have call predecessors, (5739), 33 states have return successors, (6352), 5737 states have call predecessors, (6352), 5738 states have call successors, (6352) [2025-03-08 05:32:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33156 states to 33156 states and 57241 transitions. [2025-03-08 05:32:55,007 INFO L78 Accepts]: Start accepts. Automaton has 33156 states and 57241 transitions. Word has length 196 [2025-03-08 05:32:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:55,008 INFO L471 AbstractCegarLoop]: Abstraction has 33156 states and 57241 transitions. [2025-03-08 05:32:55,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:32:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 33156 states and 57241 transitions. [2025-03-08 05:32:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 05:32:55,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:55,107 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:55,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:32:55,107 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:55,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:55,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1538130874, now seen corresponding path program 1 times [2025-03-08 05:32:55,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:55,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988559064] [2025-03-08 05:32:55,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:55,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:55,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:32:55,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:32:55,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:55,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 05:32:55,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:55,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988559064] [2025-03-08 05:32:55,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988559064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:55,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:55,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:55,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903896438] [2025-03-08 05:32:55,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:55,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:55,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:55,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:55,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:55,178 INFO L87 Difference]: Start difference. First operand 33156 states and 57241 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:56,384 INFO L93 Difference]: Finished difference Result 90398 states and 156518 transitions. [2025-03-08 05:32:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:56,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 177 [2025-03-08 05:32:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:56,685 INFO L225 Difference]: With dead ends: 90398 [2025-03-08 05:32:56,685 INFO L226 Difference]: Without dead ends: 60739 [2025-03-08 05:32:56,791 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-08 05:32:56,792 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 116 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1329 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:56,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1329 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:32:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60739 states. [2025-03-08 05:32:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60739 to 60731. [2025-03-08 05:32:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60731 states, 50445 states have (on average 1.6444047973039944) internal successors, (82952), 50452 states have internal predecessors, (82952), 10252 states have call successors, (10252), 30 states have call predecessors, (10252), 33 states have return successors, (11397), 10250 states have call predecessors, (11397), 10251 states have call successors, (11397) [2025-03-08 05:32:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60731 states to 60731 states and 104601 transitions. [2025-03-08 05:32:59,313 INFO L78 Accepts]: Start accepts. Automaton has 60731 states and 104601 transitions. Word has length 177 [2025-03-08 05:32:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:59,314 INFO L471 AbstractCegarLoop]: Abstraction has 60731 states and 104601 transitions. [2025-03-08 05:32:59,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 05:32:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 60731 states and 104601 transitions. [2025-03-08 05:32:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 05:32:59,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:59,472 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:32:59,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:32:59,473 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:59,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash -184284186, now seen corresponding path program 1 times [2025-03-08 05:32:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921556296] [2025-03-08 05:32:59,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:59,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 05:32:59,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 05:32:59,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:59,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 05:32:59,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:59,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921556296] [2025-03-08 05:32:59,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921556296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:59,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:59,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:59,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526967267] [2025-03-08 05:32:59,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:59,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:59,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:59,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:59,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:59,548 INFO L87 Difference]: Start difference. First operand 60731 states and 104601 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:33:01,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:01,444 INFO L93 Difference]: Finished difference Result 113745 states and 196298 transitions. [2025-03-08 05:33:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:01,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 197 [2025-03-08 05:33:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:01,946 INFO L225 Difference]: With dead ends: 113745 [2025-03-08 05:33:01,946 INFO L226 Difference]: Without dead ends: 113491 [2025-03-08 05:33:02,025 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-08 05:33:02,026 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 111 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1340 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-08 05:33:02,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1340 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113491 states. [2025-03-08 05:33:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113491 to 113483. [2025-03-08 05:33:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113483 states, 94829 states have (on average 1.6388341119277858) internal successors, (155409), 94836 states have internal predecessors, (155409), 18620 states have call successors, (18620), 30 states have call predecessors, (18620), 33 states have return successors, (20811), 18618 states have call predecessors, (20811), 18619 states have call successors, (20811) [2025-03-08 05:33:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113483 states to 113483 states and 194840 transitions. [2025-03-08 05:33:06,015 INFO L78 Accepts]: Start accepts. Automaton has 113483 states and 194840 transitions. Word has length 197 [2025-03-08 05:33:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:06,016 INFO L471 AbstractCegarLoop]: Abstraction has 113483 states and 194840 transitions. [2025-03-08 05:33:06,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-08 05:33:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 113483 states and 194840 transitions. [2025-03-08 05:33:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 05:33:06,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:06,194 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:33:06,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:33:06,194 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:06,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:06,194 INFO L85 PathProgramCache]: Analyzing trace with hash -33805145, now seen corresponding path program 1 times [2025-03-08 05:33:06,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:06,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529282615] [2025-03-08 05:33:06,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:06,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:06,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 05:33:06,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:33:06,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:06,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:06,498 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 05:33:06,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:06,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529282615] [2025-03-08 05:33:06,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529282615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:06,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826854298] [2025-03-08 05:33:06,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:06,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:06,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:06,501 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-08 05:33:06,502 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-08 05:33:06,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 05:33:06,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 05:33:06,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:06,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:06,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:33:06,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:33:06,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:33:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 05:33:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826854298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:33:07,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:33:07,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-03-08 05:33:07,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040520286] [2025-03-08 05:33:07,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:33:07,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 05:33:07,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:07,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 05:33:07,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:33:07,292 INFO L87 Difference]: Start difference. First operand 113483 states and 194840 transitions. Second operand has 28 states, 26 states have (on average 10.384615384615385) internal successors, (270), 24 states have internal predecessors, (270), 9 states have call successors, (58), 8 states have call predecessors, (58), 12 states have return successors, (51), 11 states have call predecessors, (51), 9 states have call successors, (51)