./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product29.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_spec1_product29.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 63bdee5cc43e6d0ce6e1fd7ff8178b7d4c48f0f239c647cbda6fb7b36603cc42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:31:23,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:31:23,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:31:23,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:31:23,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:31:23,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:31:23,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:31:23,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:31:23,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:31:23,544 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:31:23,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:31:23,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:31:23,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:31:23,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:31:23,546 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:31:23,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:31:23,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:31:23,546 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:31:23,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:31:23,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:31:23,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:31:23,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:31:23,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:31:23,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:31:23,547 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:31:23,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:31:23,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:31:23,547 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:31:23,547 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:31:23,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:31:23,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:31:23,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:31:23,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:31:23,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:31:23,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:31:23,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:31:23,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:31:23,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:31:23,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:31:23,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:31:23,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:31:23,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:31:23,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:31:23,549 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 -> 63bdee5cc43e6d0ce6e1fd7ff8178b7d4c48f0f239c647cbda6fb7b36603cc42 [2025-03-08 05:31:23,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:31:23,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:31:23,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:31:23,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:31:23,784 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:31:23,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product29.cil.c [2025-03-08 05:31:24,894 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a20cf9b5/1e7223d306a24504aa5f420a9b70e03d/FLAG2dfdcad3a [2025-03-08 05:31:25,271 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:31:25,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product29.cil.c [2025-03-08 05:31:25,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a20cf9b5/1e7223d306a24504aa5f420a9b70e03d/FLAG2dfdcad3a [2025-03-08 05:31:25,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a20cf9b5/1e7223d306a24504aa5f420a9b70e03d [2025-03-08 05:31:25,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:31:25,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:31:25,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:31:25,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:31:25,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:31:25,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:25,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1298cda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25, skipping insertion in model container [2025-03-08 05:31:25,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:25,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:31:25,710 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_spec1_product29.cil.c[32754,32767] [2025-03-08 05:31:25,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:31:25,794 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:31:25,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-08 05:31:25,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [460] [2025-03-08 05:31:25,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [826] [2025-03-08 05:31:25,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1051] [2025-03-08 05:31:25,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1201] [2025-03-08 05:31:25,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1499] [2025-03-08 05:31:25,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1508] [2025-03-08 05:31:25,801 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2578] [2025-03-08 05:31:25,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [2613] [2025-03-08 05:31:25,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2641] [2025-03-08 05:31:25,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2658] [2025-03-08 05:31:25,860 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_spec1_product29.cil.c[32754,32767] [2025-03-08 05:31:25,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:31:25,921 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:31:25,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25 WrapperNode [2025-03-08 05:31:25,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:31:25,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:31:25,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:31:25,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:31:25,930 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:31:25" (1/1) ... [2025-03-08 05:31:25,945 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:31:25" (1/1) ... [2025-03-08 05:31:25,982 INFO L138 Inliner]: procedures = 131, calls = 211, calls flagged for inlining = 55, calls inlined = 47, statements flattened = 920 [2025-03-08 05:31:25,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:31:25,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:31:25,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:31:25,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:31:25,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:25,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:25,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:26,024 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:31:26,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:26,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:26,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:26,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:26,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:26,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:26,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:31:26,046 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:31:26,046 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:31:26,046 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:31:26,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (1/1) ... [2025-03-08 05:31:26,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:31:26,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:26,073 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:31:26,075 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:31:26,090 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:31:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:31:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:31:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:31:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:31:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:31:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:31:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:31:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:31:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:31:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:31:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:31:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:31:26,091 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:31:26,091 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:31:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:31:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:31:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:31:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:31:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:31:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:31:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:31:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:31:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:31:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:31:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:31:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:31:26,092 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:31:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:31:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:31:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:31:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:31:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:31:26,094 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:31:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:31:26,094 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:31:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:31:26,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:31:26,220 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:31:26,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:31:26,297 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: #res := ~retValue_acc~8; [2025-03-08 05:31:26,305 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2934: #res := ~retValue_acc~43; [2025-03-08 05:31:26,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2167-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~29#1; [2025-03-08 05:31:26,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2212: #res#1 := ~retValue_acc~30#1; [2025-03-08 05:31:26,456 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555-1: getClientId_#res#1 := getClientId_~retValue_acc~35#1; [2025-03-08 05:31:26,478 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2436: #res := ~retValue_acc~33; [2025-03-08 05:31:26,491 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2120: #res := ~retValue_acc~28; [2025-03-08 05:31:26,502 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1198-1: createEmail_#res#1 := createEmail_~retValue_acc~17#1; [2025-03-08 05:31:26,511 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664: #res := ~retValue_acc~22; [2025-03-08 05:31:26,522 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-03-08 05:31:26,555 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-03-08 05:31:26,562 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: #res := ~retValue_acc~9; [2025-03-08 05:31:26,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-08 05:31:26,629 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1990: #res := ~retValue_acc~26; [2025-03-08 05:31:26,834 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2909-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~42#1; [2025-03-08 05:31:26,834 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2382-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~32#1; [2025-03-08 05:31:26,834 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2275-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~31#1; [2025-03-08 05:31:26,834 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2610-1: valid_product_#res#1 := valid_product_~retValue_acc~37#1; [2025-03-08 05:31:26,834 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2891-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~40#1; [2025-03-08 05:31:26,834 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~41#1; [2025-03-08 05:31:26,839 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-03-08 05:31:26,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1154-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~14#1; [2025-03-08 05:31:26,848 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1174: #res#1 := ~retValue_acc~15#1; [2025-03-08 05:31:26,977 INFO L? ?]: Removed 502 outVars from TransFormulas that were not future-live. [2025-03-08 05:31:26,977 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:31:26,999 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:31:26,999 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:31:26,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:26 BoogieIcfgContainer [2025-03-08 05:31:26,999 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:31:27,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:31:27,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:31:27,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:31:27,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:31:25" (1/3) ... [2025-03-08 05:31:27,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61dbdf9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:27, skipping insertion in model container [2025-03-08 05:31:27,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:31:25" (2/3) ... [2025-03-08 05:31:27,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61dbdf9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:31:27, skipping insertion in model container [2025-03-08 05:31:27,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:31:26" (3/3) ... [2025-03-08 05:31:27,010 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product29.cil.c [2025-03-08 05:31:27,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:31:27,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product29.cil.c that has 29 procedures, 406 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:31:27,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:31:27,096 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;@62fd5c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:31:27,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:31:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 406 states, 313 states have (on average 1.5559105431309903) internal successors, (487), 318 states have internal predecessors, (487), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-08 05:31:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:31:27,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:27,116 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:27,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:27,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash 111294383, now seen corresponding path program 1 times [2025-03-08 05:31:27,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:27,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921805405] [2025-03-08 05:31:27,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:27,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:27,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:31:27,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:31:27,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:27,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:31:27,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:27,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921805405] [2025-03-08 05:31:27,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921805405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:27,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532522020] [2025-03-08 05:31:27,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:27,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:27,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:27,768 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:31:27,769 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:31:27,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:31:28,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:31:28,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:28,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:28,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:31:28,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:31:28,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:28,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532522020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:28,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:28,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:31:28,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408023302] [2025-03-08 05:31:28,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:28,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:28,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:28,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:28,112 INFO L87 Difference]: Start difference. First operand has 406 states, 313 states have (on average 1.5559105431309903) internal successors, (487), 318 states have internal predecessors, (487), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:28,197 INFO L93 Difference]: Finished difference Result 627 states and 930 transitions. [2025-03-08 05:31:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:28,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-03-08 05:31:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:28,209 INFO L225 Difference]: With dead ends: 627 [2025-03-08 05:31:28,209 INFO L226 Difference]: Without dead ends: 400 [2025-03-08 05:31:28,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 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:31:28,215 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 0 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1215 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:31:28,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1215 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-08 05:31:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-03-08 05:31:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 308 states have (on average 1.551948051948052) internal successors, (478), 312 states have internal predecessors, (478), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 05:31:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 603 transitions. [2025-03-08 05:31:28,279 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 603 transitions. Word has length 110 [2025-03-08 05:31:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:28,280 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 603 transitions. [2025-03-08 05:31:28,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 603 transitions. [2025-03-08 05:31:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:31:28,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:28,289 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:28,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:31:28,493 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:31:28,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:28,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1881905207, now seen corresponding path program 1 times [2025-03-08 05:31:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395044227] [2025-03-08 05:31:28,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:28,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:31:28,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:31:28,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:28,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:28,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:28,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395044227] [2025-03-08 05:31:28,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395044227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:28,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570800827] [2025-03-08 05:31:28,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:28,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:28,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:28,717 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:31:28,719 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:31:28,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:31:28,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:31:28,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:28,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:28,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:31:28,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:31:29,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:29,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570800827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:29,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:29,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:31:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29270059] [2025-03-08 05:31:29,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:29,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:29,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:29,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:31:29,010 INFO L87 Difference]: Start difference. First operand 400 states and 603 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:29,040 INFO L93 Difference]: Finished difference Result 842 states and 1289 transitions. [2025-03-08 05:31:29,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:29,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-08 05:31:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:29,048 INFO L225 Difference]: With dead ends: 842 [2025-03-08 05:31:29,048 INFO L226 Difference]: Without dead ends: 468 [2025-03-08 05:31:29,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 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:31:29,049 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 126 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1177 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:31:29,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1177 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-08 05:31:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 460. [2025-03-08 05:31:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 354 states have (on average 1.573446327683616) internal successors, (557), 358 states have internal predecessors, (557), 77 states have call successors, (77), 28 states have call predecessors, (77), 28 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 05:31:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 710 transitions. [2025-03-08 05:31:29,085 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 710 transitions. Word has length 114 [2025-03-08 05:31:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:29,086 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 710 transitions. [2025-03-08 05:31:29,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 710 transitions. [2025-03-08 05:31:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 05:31:29,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:29,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:29,097 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:31:29,290 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:31:29,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:29,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1284879937, now seen corresponding path program 1 times [2025-03-08 05:31:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:29,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858872154] [2025-03-08 05:31:29,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:29,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:31:29,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:31:29,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:29,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:29,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:29,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858872154] [2025-03-08 05:31:29,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858872154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:29,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345343094] [2025-03-08 05:31:29,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:29,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:29,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:29,488 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:31:29,490 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:31:29,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 05:31:29,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 05:31:29,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:29,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:29,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:31:29,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:31:29,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:29,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345343094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:29,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:29,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:31:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282197733] [2025-03-08 05:31:29,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:29,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:29,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:29,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:29,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:31:29,799 INFO L87 Difference]: Start difference. First operand 460 states and 710 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:29,875 INFO L93 Difference]: Finished difference Result 911 states and 1410 transitions. [2025-03-08 05:31:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:29,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-08 05:31:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:29,883 INFO L225 Difference]: With dead ends: 911 [2025-03-08 05:31:29,883 INFO L226 Difference]: Without dead ends: 462 [2025-03-08 05:31:29,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 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:31:29,886 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2365 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:31:29,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2365 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-08 05:31:29,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2025-03-08 05:31:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 355 states have (on average 1.5718309859154929) internal successors, (558), 360 states have internal predecessors, (558), 77 states have call successors, (77), 28 states have call predecessors, (77), 29 states have return successors, (78), 75 states have call predecessors, (78), 76 states have call successors, (78) [2025-03-08 05:31:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 713 transitions. [2025-03-08 05:31:29,911 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 713 transitions. Word has length 115 [2025-03-08 05:31:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:29,911 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 713 transitions. [2025-03-08 05:31:29,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 713 transitions. [2025-03-08 05:31:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:31:29,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:29,916 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:29,924 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:31:30,116 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:31:30,117 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:30,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1618527194, now seen corresponding path program 1 times [2025-03-08 05:31:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219602039] [2025-03-08 05:31:30,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:30,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:31:30,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:31:30,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:30,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:31:30,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:30,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219602039] [2025-03-08 05:31:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219602039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:30,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081540458] [2025-03-08 05:31:30,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:30,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:30,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:30,275 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:31:30,277 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:31:30,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:31:30,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:31:30,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:30,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:30,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:31:30,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:31:30,539 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:31:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081540458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:30,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:31:30,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:31:30,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419923693] [2025-03-08 05:31:30,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:30,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:30,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:30,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:31:30,542 INFO L87 Difference]: Start difference. First operand 462 states and 713 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:30,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:30,599 INFO L93 Difference]: Finished difference Result 913 states and 1415 transitions. [2025-03-08 05:31:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:30,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-08 05:31:30,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:30,602 INFO L225 Difference]: With dead ends: 913 [2025-03-08 05:31:30,602 INFO L226 Difference]: Without dead ends: 464 [2025-03-08 05:31:30,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 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:31:30,603 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 2 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2351 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:31:30,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2351 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-08 05:31:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-03-08 05:31:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 356 states have (on average 1.5702247191011236) internal successors, (559), 362 states have internal predecessors, (559), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (83), 75 states have call predecessors, (83), 76 states have call successors, (83) [2025-03-08 05:31:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 719 transitions. [2025-03-08 05:31:30,617 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 719 transitions. Word has length 116 [2025-03-08 05:31:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:30,617 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 719 transitions. [2025-03-08 05:31:30,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 719 transitions. [2025-03-08 05:31:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:31:30,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:30,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:30,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:31:30,819 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:31:30,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:30,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1625295787, now seen corresponding path program 1 times [2025-03-08 05:31:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895672194] [2025-03-08 05:31:30,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:30,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:31:30,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:31:30,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:30,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:31:30,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:30,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895672194] [2025-03-08 05:31:30,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895672194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:30,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:30,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:30,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630969627] [2025-03-08 05:31:30,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:30,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:30,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:30,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:30,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:30,972 INFO L87 Difference]: Start difference. First operand 464 states and 719 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:31,015 INFO L93 Difference]: Finished difference Result 905 states and 1406 transitions. [2025-03-08 05:31:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-03-08 05:31:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:31,020 INFO L225 Difference]: With dead ends: 905 [2025-03-08 05:31:31,020 INFO L226 Difference]: Without dead ends: 464 [2025-03-08 05:31:31,023 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:31:31,024 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 2 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2369 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:31:31,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2369 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-08 05:31:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-03-08 05:31:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 356 states have (on average 1.5702247191011236) internal successors, (559), 362 states have internal predecessors, (559), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (82), 75 states have call predecessors, (82), 76 states have call successors, (82) [2025-03-08 05:31:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 718 transitions. [2025-03-08 05:31:31,052 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 718 transitions. Word has length 117 [2025-03-08 05:31:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:31,054 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 718 transitions. [2025-03-08 05:31:31,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 718 transitions. [2025-03-08 05:31:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:31:31,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:31,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:31,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:31:31,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:31,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 651944734, now seen corresponding path program 2 times [2025-03-08 05:31:31,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:31,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746129802] [2025-03-08 05:31:31,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:31:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:31,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 118 statements into 2 equivalence classes. [2025-03-08 05:31:31,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:31:31,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:31:31,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:31:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746129802] [2025-03-08 05:31:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746129802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:31,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:31,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945324136] [2025-03-08 05:31:31,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:31,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:31,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:31,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:31,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:31,185 INFO L87 Difference]: Start difference. First operand 464 states and 718 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:31,232 INFO L93 Difference]: Finished difference Result 903 states and 1401 transitions. [2025-03-08 05:31:31,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:31,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-03-08 05:31:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:31,235 INFO L225 Difference]: With dead ends: 903 [2025-03-08 05:31:31,235 INFO L226 Difference]: Without dead ends: 464 [2025-03-08 05:31:31,237 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:31:31,237 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 2 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:31,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2355 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:31,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-08 05:31:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-03-08 05:31:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 356 states have (on average 1.5702247191011236) internal successors, (559), 362 states have internal predecessors, (559), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (81), 75 states have call predecessors, (81), 76 states have call successors, (81) [2025-03-08 05:31:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 717 transitions. [2025-03-08 05:31:31,254 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 717 transitions. Word has length 118 [2025-03-08 05:31:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:31,255 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 717 transitions. [2025-03-08 05:31:31,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 717 transitions. [2025-03-08 05:31:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:31:31,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:31,258 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:31,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:31:31,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:31,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 252546159, now seen corresponding path program 3 times [2025-03-08 05:31:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:31,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859498218] [2025-03-08 05:31:31,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:31:31,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:31,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 3 equivalence classes. [2025-03-08 05:31:31,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 107 of 119 statements. [2025-03-08 05:31:31,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:31:31,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:31:31,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:31,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859498218] [2025-03-08 05:31:31,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859498218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:31,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:31,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:31,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190320724] [2025-03-08 05:31:31,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:31,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:31,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:31,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:31,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:31,360 INFO L87 Difference]: Start difference. First operand 464 states and 717 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:31,409 INFO L93 Difference]: Finished difference Result 905 states and 1407 transitions. [2025-03-08 05:31:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:31,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-03-08 05:31:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:31,413 INFO L225 Difference]: With dead ends: 905 [2025-03-08 05:31:31,413 INFO L226 Difference]: Without dead ends: 466 [2025-03-08 05:31:31,417 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:31:31,417 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2366 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:31:31,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2366 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-08 05:31:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-03-08 05:31:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 357 states have (on average 1.5686274509803921) internal successors, (560), 364 states have internal predecessors, (560), 77 states have call successors, (77), 28 states have call predecessors, (77), 31 states have return successors, (86), 75 states have call predecessors, (86), 76 states have call successors, (86) [2025-03-08 05:31:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 723 transitions. [2025-03-08 05:31:31,461 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 723 transitions. Word has length 119 [2025-03-08 05:31:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:31,461 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 723 transitions. [2025-03-08 05:31:31,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 723 transitions. [2025-03-08 05:31:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:31:31,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:31,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:31,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:31:31,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:31,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash -69408639, now seen corresponding path program 1 times [2025-03-08 05:31:31,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:31,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865283808] [2025-03-08 05:31:31,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:31,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:31,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:31:31,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:31:31,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:31,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:31:31,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:31,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865283808] [2025-03-08 05:31:31,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865283808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:31,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:31,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:31,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126585199] [2025-03-08 05:31:31,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:31,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:31,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:31,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:31,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:31,578 INFO L87 Difference]: Start difference. First operand 466 states and 723 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:31,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:31,620 INFO L93 Difference]: Finished difference Result 911 states and 1417 transitions. [2025-03-08 05:31:31,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:31,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-08 05:31:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:31,624 INFO L225 Difference]: With dead ends: 911 [2025-03-08 05:31:31,624 INFO L226 Difference]: Without dead ends: 468 [2025-03-08 05:31:31,626 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:31:31,626 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2372 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:31:31,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2372 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-08 05:31:31,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-08 05:31:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 358 states have (on average 1.5670391061452513) internal successors, (561), 366 states have internal predecessors, (561), 77 states have call successors, (77), 28 states have call predecessors, (77), 32 states have return successors, (88), 75 states have call predecessors, (88), 76 states have call successors, (88) [2025-03-08 05:31:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 726 transitions. [2025-03-08 05:31:31,644 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 726 transitions. Word has length 120 [2025-03-08 05:31:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:31,644 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 726 transitions. [2025-03-08 05:31:31,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:31:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 726 transitions. [2025-03-08 05:31:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:31:31,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:31,647 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:31,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:31:31,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:31,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1351122597, now seen corresponding path program 1 times [2025-03-08 05:31:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:31,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843894418] [2025-03-08 05:31:31,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:31,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:31:31,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:31:31,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:31,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843894418] [2025-03-08 05:31:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843894418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:31:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178010219] [2025-03-08 05:31:31,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:31,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:31:31,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:31:31,736 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:31:31,737 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:31:31,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:31:31,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:31:31,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:31,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:31,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:31:31,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:31:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:31,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:31:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:32,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178010219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:31:32,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:31:32,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:31:32,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771328494] [2025-03-08 05:31:32,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:31:32,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:31:32,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:32,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:31:32,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:31:32,075 INFO L87 Difference]: Start difference. First operand 468 states and 726 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:31:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:32,225 INFO L93 Difference]: Finished difference Result 1088 states and 1749 transitions. [2025-03-08 05:31:32,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:31:32,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 121 [2025-03-08 05:31:32,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:32,231 INFO L225 Difference]: With dead ends: 1088 [2025-03-08 05:31:32,231 INFO L226 Difference]: Without dead ends: 874 [2025-03-08 05:31:32,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 239 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:31:32,233 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 459 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:32,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 2174 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:31:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-08 05:31:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 850. [2025-03-08 05:31:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 661 states have (on average 1.638426626323752) internal successors, (1083), 669 states have internal predecessors, (1083), 156 states have call successors, (156), 28 states have call predecessors, (156), 32 states have return successors, (177), 154 states have call predecessors, (177), 155 states have call successors, (177) [2025-03-08 05:31:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1416 transitions. [2025-03-08 05:31:32,269 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1416 transitions. Word has length 121 [2025-03-08 05:31:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:32,269 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1416 transitions. [2025-03-08 05:31:32,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 05:31:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1416 transitions. [2025-03-08 05:31:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:31:32,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:32,274 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:32,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:31:32,475 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:31:32,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:32,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1093764594, now seen corresponding path program 1 times [2025-03-08 05:31:32,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:32,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150492763] [2025-03-08 05:31:32,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:32,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:31:32,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:31:32,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:32,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:32,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:32,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150492763] [2025-03-08 05:31:32,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150492763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:32,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:32,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957205164] [2025-03-08 05:31:32,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:32,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:32,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:32,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:32,530 INFO L87 Difference]: Start difference. First operand 850 states and 1416 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:32,562 INFO L93 Difference]: Finished difference Result 2022 states and 3421 transitions. [2025-03-08 05:31:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:32,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-03-08 05:31:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:32,569 INFO L225 Difference]: With dead ends: 2022 [2025-03-08 05:31:32,569 INFO L226 Difference]: Without dead ends: 1236 [2025-03-08 05:31:32,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:32,572 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 124 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1214 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:31:32,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1214 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2025-03-08 05:31:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1228. [2025-03-08 05:31:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 960 states have (on average 1.6572916666666666) internal successors, (1591), 968 states have internal predecessors, (1591), 235 states have call successors, (235), 28 states have call predecessors, (235), 32 states have return successors, (266), 233 states have call predecessors, (266), 234 states have call successors, (266) [2025-03-08 05:31:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 2092 transitions. [2025-03-08 05:31:32,613 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 2092 transitions. Word has length 128 [2025-03-08 05:31:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:32,614 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 2092 transitions. [2025-03-08 05:31:32,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 2092 transitions. [2025-03-08 05:31:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:31:32,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:32,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:32,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:31:32,620 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:32,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1163306097, now seen corresponding path program 1 times [2025-03-08 05:31:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:32,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207600055] [2025-03-08 05:31:32,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:32,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:32,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:31:32,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:31:32,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:32,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:32,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:32,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207600055] [2025-03-08 05:31:32,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207600055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:32,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:32,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:32,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590552102] [2025-03-08 05:31:32,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:32,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:32,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:32,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:32,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:32,670 INFO L87 Difference]: Start difference. First operand 1228 states and 2092 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:32,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:32,716 INFO L93 Difference]: Finished difference Result 2943 states and 5051 transitions. [2025-03-08 05:31:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:32,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-03-08 05:31:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:32,726 INFO L225 Difference]: With dead ends: 2943 [2025-03-08 05:31:32,726 INFO L226 Difference]: Without dead ends: 1828 [2025-03-08 05:31:32,731 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:31:32,731 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 122 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1206 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:31:32,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2025-03-08 05:31:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1820. [2025-03-08 05:31:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1433 states have (on average 1.6706210746685275) internal successors, (2394), 1441 states have internal predecessors, (2394), 354 states have call successors, (354), 28 states have call predecessors, (354), 32 states have return successors, (385), 352 states have call predecessors, (385), 353 states have call successors, (385) [2025-03-08 05:31:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 3133 transitions. [2025-03-08 05:31:32,834 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 3133 transitions. Word has length 129 [2025-03-08 05:31:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:32,834 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 3133 transitions. [2025-03-08 05:31:32,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 3133 transitions. [2025-03-08 05:31:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:31:32,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:32,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:32,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:31:32,844 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:32,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:32,844 INFO L85 PathProgramCache]: Analyzing trace with hash 164185709, now seen corresponding path program 1 times [2025-03-08 05:31:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:32,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358186061] [2025-03-08 05:31:32,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:32,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:32,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:31:32,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:31:32,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:32,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:32,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:32,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358186061] [2025-03-08 05:31:32,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358186061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:32,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:32,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:32,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712158065] [2025-03-08 05:31:32,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:32,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:32,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:32,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:32,902 INFO L87 Difference]: Start difference. First operand 1820 states and 3133 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:32,986 INFO L93 Difference]: Finished difference Result 4322 states and 7505 transitions. [2025-03-08 05:31:32,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-08 05:31:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:33,001 INFO L225 Difference]: With dead ends: 4322 [2025-03-08 05:31:33,001 INFO L226 Difference]: Without dead ends: 2733 [2025-03-08 05:31:33,008 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:31:33,009 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 120 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1193 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:31:33,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1193 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:33,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-03-08 05:31:33,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2725. [2025-03-08 05:31:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2725 states, 2176 states have (on average 1.6815257352941178) internal successors, (3659), 2184 states have internal predecessors, (3659), 516 states have call successors, (516), 28 states have call predecessors, (516), 32 states have return successors, (563), 514 states have call predecessors, (563), 515 states have call successors, (563) [2025-03-08 05:31:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 4738 transitions. [2025-03-08 05:31:33,115 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 4738 transitions. Word has length 130 [2025-03-08 05:31:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:33,115 INFO L471 AbstractCegarLoop]: Abstraction has 2725 states and 4738 transitions. [2025-03-08 05:31:33,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 4738 transitions. [2025-03-08 05:31:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:31:33,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:33,127 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:33,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:31:33,127 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:33,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:33,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1109401392, now seen corresponding path program 1 times [2025-03-08 05:31:33,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:33,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078370034] [2025-03-08 05:31:33,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:33,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:31:33,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:31:33,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:33,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:33,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:33,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078370034] [2025-03-08 05:31:33,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078370034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:33,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:33,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:33,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881327987] [2025-03-08 05:31:33,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:33,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:33,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:33,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:33,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:33,177 INFO L87 Difference]: Start difference. First operand 2725 states and 4738 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:33,300 INFO L93 Difference]: Finished difference Result 6494 states and 11380 transitions. [2025-03-08 05:31:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:33,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-03-08 05:31:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:33,322 INFO L225 Difference]: With dead ends: 6494 [2025-03-08 05:31:33,322 INFO L226 Difference]: Without dead ends: 4193 [2025-03-08 05:31:33,329 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:31:33,330 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 118 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1193 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:31:33,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1193 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4193 states. [2025-03-08 05:31:33,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4193 to 4185. [2025-03-08 05:31:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 3391 states have (on average 1.6894721321144206) internal successors, (5729), 3399 states have internal predecessors, (5729), 761 states have call successors, (761), 28 states have call predecessors, (761), 32 states have return successors, (834), 759 states have call predecessors, (834), 760 states have call successors, (834) [2025-03-08 05:31:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 7324 transitions. [2025-03-08 05:31:33,497 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 7324 transitions. Word has length 131 [2025-03-08 05:31:33,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:33,499 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 7324 transitions. [2025-03-08 05:31:33,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 7324 transitions. [2025-03-08 05:31:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:31:33,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:33,518 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:33,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:31:33,519 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:33,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:33,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2016490516, now seen corresponding path program 1 times [2025-03-08 05:31:33,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:33,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602843660] [2025-03-08 05:31:33,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:33,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:33,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:31:33,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:31:33,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:33,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:33,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:33,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602843660] [2025-03-08 05:31:33,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602843660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:33,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:33,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:33,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141971468] [2025-03-08 05:31:33,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:33,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:33,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:33,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:33,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:33,578 INFO L87 Difference]: Start difference. First operand 4185 states and 7324 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:33,772 INFO L93 Difference]: Finished difference Result 10377 states and 18259 transitions. [2025-03-08 05:31:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-08 05:31:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:33,810 INFO L225 Difference]: With dead ends: 10377 [2025-03-08 05:31:33,811 INFO L226 Difference]: Without dead ends: 6832 [2025-03-08 05:31:33,825 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:31:33,826 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 116 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1209 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:31:33,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1209 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6832 states. [2025-03-08 05:31:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6832 to 6824. [2025-03-08 05:31:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6824 states, 5537 states have (on average 1.6868340256456564) internal successors, (9340), 5545 states have internal predecessors, (9340), 1254 states have call successors, (1254), 28 states have call predecessors, (1254), 32 states have return successors, (1371), 1252 states have call predecessors, (1371), 1253 states have call successors, (1371) [2025-03-08 05:31:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6824 states to 6824 states and 11965 transitions. [2025-03-08 05:31:34,191 INFO L78 Accepts]: Start accepts. Automaton has 6824 states and 11965 transitions. Word has length 132 [2025-03-08 05:31:34,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:34,192 INFO L471 AbstractCegarLoop]: Abstraction has 6824 states and 11965 transitions. [2025-03-08 05:31:34,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 6824 states and 11965 transitions. [2025-03-08 05:31:34,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:31:34,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:34,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:34,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:31:34,220 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:34,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash -483175087, now seen corresponding path program 1 times [2025-03-08 05:31:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:34,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623427358] [2025-03-08 05:31:34,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:34,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:31:34,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:31:34,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:34,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:34,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:34,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623427358] [2025-03-08 05:31:34,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623427358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:34,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:34,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:34,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561893284] [2025-03-08 05:31:34,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:34,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:34,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:34,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:34,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:34,277 INFO L87 Difference]: Start difference. First operand 6824 states and 11965 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:34,558 INFO L93 Difference]: Finished difference Result 17279 states and 30482 transitions. [2025-03-08 05:31:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-03-08 05:31:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:34,626 INFO L225 Difference]: With dead ends: 17279 [2025-03-08 05:31:34,626 INFO L226 Difference]: Without dead ends: 11450 [2025-03-08 05:31:34,649 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:31:34,650 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 114 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1196 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:31:34,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1196 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2025-03-08 05:31:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 11442. [2025-03-08 05:31:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11442 states, 9333 states have (on average 1.6877745633772634) internal successors, (15752), 9341 states have internal predecessors, (15752), 2076 states have call successors, (2076), 28 states have call predecessors, (2076), 32 states have return successors, (2271), 2074 states have call predecessors, (2271), 2075 states have call successors, (2271) [2025-03-08 05:31:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11442 states to 11442 states and 20099 transitions. [2025-03-08 05:31:35,182 INFO L78 Accepts]: Start accepts. Automaton has 11442 states and 20099 transitions. Word has length 133 [2025-03-08 05:31:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:35,182 INFO L471 AbstractCegarLoop]: Abstraction has 11442 states and 20099 transitions. [2025-03-08 05:31:35,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 11442 states and 20099 transitions. [2025-03-08 05:31:35,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:31:35,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:35,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:35,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:31:35,221 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:35,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:35,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1470793461, now seen corresponding path program 1 times [2025-03-08 05:31:35,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:35,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292065306] [2025-03-08 05:31:35,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:35,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:35,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:31:35,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:31:35,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:35,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:35,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:35,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292065306] [2025-03-08 05:31:35,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292065306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:35,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:35,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261655653] [2025-03-08 05:31:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:35,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:35,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:35,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:35,279 INFO L87 Difference]: Start difference. First operand 11442 states and 20099 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:35,676 INFO L93 Difference]: Finished difference Result 27272 states and 47886 transitions. [2025-03-08 05:31:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:35,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-03-08 05:31:35,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:35,765 INFO L225 Difference]: With dead ends: 27272 [2025-03-08 05:31:35,765 INFO L226 Difference]: Without dead ends: 17740 [2025-03-08 05:31:35,807 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:31:35,808 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 112 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1176 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:31:35,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:35,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17740 states. [2025-03-08 05:31:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17740 to 17732. [2025-03-08 05:31:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17732 states, 14420 states have (on average 1.6653952843273232) internal successors, (24015), 14428 states have internal predecessors, (24015), 3279 states have call successors, (3279), 28 states have call predecessors, (3279), 32 states have return successors, (3618), 3277 states have call predecessors, (3618), 3278 states have call successors, (3618) [2025-03-08 05:31:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17732 states to 17732 states and 30912 transitions. [2025-03-08 05:31:36,472 INFO L78 Accepts]: Start accepts. Automaton has 17732 states and 30912 transitions. Word has length 134 [2025-03-08 05:31:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:36,472 INFO L471 AbstractCegarLoop]: Abstraction has 17732 states and 30912 transitions. [2025-03-08 05:31:36,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 17732 states and 30912 transitions. [2025-03-08 05:31:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:31:36,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:36,507 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:36,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:31:36,507 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:36,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash -626237806, now seen corresponding path program 1 times [2025-03-08 05:31:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:36,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202709655] [2025-03-08 05:31:36,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:36,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:36,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:31:36,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:31:36,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:36,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:36,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:36,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202709655] [2025-03-08 05:31:36,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202709655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:36,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:36,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:36,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568229716] [2025-03-08 05:31:36,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:36,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:36,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:36,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:36,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:36,574 INFO L87 Difference]: Start difference. First operand 17732 states and 30912 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:37,298 INFO L93 Difference]: Finished difference Result 46859 states and 82015 transitions. [2025-03-08 05:31:37,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:37,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-03-08 05:31:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:37,451 INFO L225 Difference]: With dead ends: 46859 [2025-03-08 05:31:37,452 INFO L226 Difference]: Without dead ends: 31607 [2025-03-08 05:31:37,511 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:31:37,512 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 110 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1196 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:31:37,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1196 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31607 states. [2025-03-08 05:31:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31607 to 31599. [2025-03-08 05:31:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31599 states, 25837 states have (on average 1.6624608120137787) internal successors, (42953), 25845 states have internal predecessors, (42953), 5729 states have call successors, (5729), 28 states have call predecessors, (5729), 32 states have return successors, (6342), 5727 states have call predecessors, (6342), 5728 states have call successors, (6342) [2025-03-08 05:31:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31599 states to 31599 states and 55024 transitions. [2025-03-08 05:31:38,896 INFO L78 Accepts]: Start accepts. Automaton has 31599 states and 55024 transitions. Word has length 135 [2025-03-08 05:31:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:38,897 INFO L471 AbstractCegarLoop]: Abstraction has 31599 states and 55024 transitions. [2025-03-08 05:31:38,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 31599 states and 55024 transitions. [2025-03-08 05:31:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:31:38,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:38,930 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:38,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:31:38,930 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:38,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:38,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1688234131, now seen corresponding path program 2 times [2025-03-08 05:31:38,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:38,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604428371] [2025-03-08 05:31:38,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:31:38,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:38,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-03-08 05:31:38,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:31:38,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:31:38,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:31:39,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:39,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604428371] [2025-03-08 05:31:39,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604428371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:39,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:39,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:31:39,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427380629] [2025-03-08 05:31:39,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:39,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:31:39,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:39,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:31:39,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:31:39,031 INFO L87 Difference]: Start difference. First operand 31599 states and 55024 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:39,686 INFO L93 Difference]: Finished difference Result 59679 states and 104066 transitions. [2025-03-08 05:31:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:31:39,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-03-08 05:31:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:39,811 INFO L225 Difference]: With dead ends: 59679 [2025-03-08 05:31:39,811 INFO L226 Difference]: Without dead ends: 31607 [2025-03-08 05:31:39,862 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:31:39,863 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 123 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2848 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:31:39,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2848 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:39,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31607 states. [2025-03-08 05:31:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31607 to 31599. [2025-03-08 05:31:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31599 states, 25837 states have (on average 1.6521654990904517) internal successors, (42687), 25845 states have internal predecessors, (42687), 5729 states have call successors, (5729), 28 states have call predecessors, (5729), 32 states have return successors, (6342), 5727 states have call predecessors, (6342), 5728 states have call successors, (6342) [2025-03-08 05:31:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31599 states to 31599 states and 54758 transitions. [2025-03-08 05:31:41,015 INFO L78 Accepts]: Start accepts. Automaton has 31599 states and 54758 transitions. Word has length 136 [2025-03-08 05:31:41,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:41,016 INFO L471 AbstractCegarLoop]: Abstraction has 31599 states and 54758 transitions. [2025-03-08 05:31:41,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31599 states and 54758 transitions. [2025-03-08 05:31:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:31:41,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:41,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:41,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:31:41,057 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:41,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:41,057 INFO L85 PathProgramCache]: Analyzing trace with hash -709786294, now seen corresponding path program 1 times [2025-03-08 05:31:41,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:41,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757021606] [2025-03-08 05:31:41,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:41,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:31:41,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:31:41,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:41,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:41,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757021606] [2025-03-08 05:31:41,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757021606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:41,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:41,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:41,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801554359] [2025-03-08 05:31:41,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:41,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:41,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:41,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:41,120 INFO L87 Difference]: Start difference. First operand 31599 states and 54758 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:42,607 INFO L93 Difference]: Finished difference Result 86141 states and 149722 transitions. [2025-03-08 05:31:42,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:42,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-03-08 05:31:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:42,852 INFO L225 Difference]: With dead ends: 86141 [2025-03-08 05:31:42,852 INFO L226 Difference]: Without dead ends: 57852 [2025-03-08 05:31:42,925 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:31:42,926 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 108 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1209 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:31:42,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1209 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57852 states. [2025-03-08 05:31:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57852 to 57844. [2025-03-08 05:31:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57844 states, 47569 states have (on average 1.6473123252538417) internal successors, (78361), 47577 states have internal predecessors, (78361), 10242 states have call successors, (10242), 28 states have call predecessors, (10242), 32 states have return successors, (11387), 10240 states have call predecessors, (11387), 10241 states have call successors, (11387) [2025-03-08 05:31:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57844 states to 57844 states and 99990 transitions. [2025-03-08 05:31:44,750 INFO L78 Accepts]: Start accepts. Automaton has 57844 states and 99990 transitions. Word has length 136 [2025-03-08 05:31:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:44,751 INFO L471 AbstractCegarLoop]: Abstraction has 57844 states and 99990 transitions. [2025-03-08 05:31:44,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 57844 states and 99990 transitions. [2025-03-08 05:31:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:31:44,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:44,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:44,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:31:44,793 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:44,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1886929011, now seen corresponding path program 1 times [2025-03-08 05:31:44,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:44,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771220240] [2025-03-08 05:31:44,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:44,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:44,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:31:44,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:31:44,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:44,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:45,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:45,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771220240] [2025-03-08 05:31:45,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771220240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:45,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:45,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:31:45,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901169289] [2025-03-08 05:31:45,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:45,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:31:45,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:45,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:31:45,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:31:45,114 INFO L87 Difference]: Start difference. First operand 57844 states and 99990 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:47,408 INFO L93 Difference]: Finished difference Result 108203 states and 187446 transitions. [2025-03-08 05:31:47,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:31:47,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-03-08 05:31:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:47,980 INFO L225 Difference]: With dead ends: 108203 [2025-03-08 05:31:47,980 INFO L226 Difference]: Without dead ends: 107989 [2025-03-08 05:31:48,070 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:31:48,072 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 103 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1210 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:31:48,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1210 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:31:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107989 states. [2025-03-08 05:31:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107989 to 107981. [2025-03-08 05:31:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107981 states, 89338 states have (on average 1.6413396315117867) internal successors, (146634), 89346 states have internal predecessors, (146634), 18610 states have call successors, (18610), 28 states have call predecessors, (18610), 32 states have return successors, (20801), 18608 states have call predecessors, (20801), 18609 states have call successors, (20801) [2025-03-08 05:31:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107981 states to 107981 states and 186045 transitions. [2025-03-08 05:31:51,940 INFO L78 Accepts]: Start accepts. Automaton has 107981 states and 186045 transitions. Word has length 137 [2025-03-08 05:31:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:31:51,941 INFO L471 AbstractCegarLoop]: Abstraction has 107981 states and 186045 transitions. [2025-03-08 05:31:51,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:31:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 107981 states and 186045 transitions. [2025-03-08 05:31:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:31:51,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:31:51,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:31:51,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:31:51,999 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:31:52,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:31:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1579444553, now seen corresponding path program 1 times [2025-03-08 05:31:52,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:31:52,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413703677] [2025-03-08 05:31:52,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:31:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:31:52,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:31:52,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:31:52,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:31:52,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:31:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:31:52,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:31:52,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413703677] [2025-03-08 05:31:52,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413703677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:31:52,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:31:52,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 05:31:52,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330968805] [2025-03-08 05:31:52,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:31:52,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:31:52,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:31:52,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:31:52,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:31:52,787 INFO L87 Difference]: Start difference. First operand 107981 states and 186045 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 05:31:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:57,546 INFO L93 Difference]: Finished difference Result 215346 states and 376426 transitions. [2025-03-08 05:31:57,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 05:31:57,547 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 138 [2025-03-08 05:31:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:58,460 INFO L225 Difference]: With dead ends: 215346 [2025-03-08 05:31:58,460 INFO L226 Difference]: Without dead ends: 215138 [2025-03-08 05:31:58,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2025-03-08 05:31:58,558 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 1732 mSDsluCounter, 7167 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 7845 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:58,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 7845 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:31:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215138 states. [2025-03-08 05:32:04,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215138 to 215036. [2025-03-08 05:32:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215036 states, 177977 states have (on average 1.6418638363384033) internal successors, (292214), 177884 states have internal predecessors, (292214), 36976 states have call successors, (36976), 75 states have call predecessors, (36976), 82 states have return successors, (44634), 37082 states have call predecessors, (44634), 36973 states have call successors, (44634) [2025-03-08 05:32:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215036 states to 215036 states and 373824 transitions. [2025-03-08 05:32:05,910 INFO L78 Accepts]: Start accepts. Automaton has 215036 states and 373824 transitions. Word has length 138 [2025-03-08 05:32:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:05,910 INFO L471 AbstractCegarLoop]: Abstraction has 215036 states and 373824 transitions. [2025-03-08 05:32:05,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 12 states have internal predecessors, (94), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 05:32:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 215036 states and 373824 transitions. [2025-03-08 05:32:06,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:32:06,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:06,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:06,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:32:06,031 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:06,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:06,032 INFO L85 PathProgramCache]: Analyzing trace with hash 801963841, now seen corresponding path program 1 times [2025-03-08 05:32:06,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:06,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525077851] [2025-03-08 05:32:06,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:06,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:06,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:32:06,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:32:06,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:06,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:32:06,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:06,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525077851] [2025-03-08 05:32:06,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525077851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:06,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:06,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:06,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011339337] [2025-03-08 05:32:06,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:06,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:06,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:06,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:06,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:06,107 INFO L87 Difference]: Start difference. First operand 215036 states and 373824 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)