./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product21.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_spec9_product21.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 f4fee54ccb193d38705f292ec1df682c5f160e2b5ba09e341cb9a12b4e6b2606 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:37:32,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:37:32,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:37:32,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:37:32,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:37:32,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:37:32,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:37:32,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:37:32,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:37:32,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:37:32,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:37:32,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:37:32,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:37:32,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:37:32,903 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:37:32,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:37:32,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:37:32,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:37:32,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:37:32,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:37:32,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:37:32,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:37:32,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:37:32,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:37:32,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:37:32,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:37:32,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:37:32,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:37:32,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:37:32,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:37:32,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:37:32,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:37:32,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:37:32,906 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 -> f4fee54ccb193d38705f292ec1df682c5f160e2b5ba09e341cb9a12b4e6b2606 [2025-03-08 05:37:33,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:37:33,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:37:33,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:37:33,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:37:33,142 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:37:33,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product21.cil.c [2025-03-08 05:37:34,325 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356c5feb7/b00b1d04100246d78561351f5df6689d/FLAG8d4cc36e1 [2025-03-08 05:37:34,663 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:37:34,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product21.cil.c [2025-03-08 05:37:34,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356c5feb7/b00b1d04100246d78561351f5df6689d/FLAG8d4cc36e1 [2025-03-08 05:37:34,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356c5feb7/b00b1d04100246d78561351f5df6689d [2025-03-08 05:37:34,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:37:34,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:37:34,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:37:34,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:37:34,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:37:34,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:37:34" (1/1) ... [2025-03-08 05:37:34,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1f6b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:34, skipping insertion in model container [2025-03-08 05:37:34,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:37:34" (1/1) ... [2025-03-08 05:37:34,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:37:34,995 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_spec9_product21.cil.c[10263,10276] [2025-03-08 05:37:35,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:37:35,195 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:37:35,202 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2025-03-08 05:37:35,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [393] [2025-03-08 05:37:35,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [498] [2025-03-08 05:37:35,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [507] [2025-03-08 05:37:35,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [545] [2025-03-08 05:37:35,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [562] [2025-03-08 05:37:35,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1634] [2025-03-08 05:37:35,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2037] [2025-03-08 05:37:35,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2079] [2025-03-08 05:37:35,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2308] [2025-03-08 05:37:35,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2596] [2025-03-08 05:37:35,225 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_spec9_product21.cil.c[10263,10276] [2025-03-08 05:37:35,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:37:35,332 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:37:35,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35 WrapperNode [2025-03-08 05:37:35,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:37:35,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:37:35,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:37:35,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:37:35,339 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:37:35" (1/1) ... [2025-03-08 05:37:35,355 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:37:35" (1/1) ... [2025-03-08 05:37:35,394 INFO L138 Inliner]: procedures = 129, calls = 200, calls flagged for inlining = 58, calls inlined = 55, statements flattened = 1074 [2025-03-08 05:37:35,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:37:35,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:37:35,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:37:35,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:37:35,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (1/1) ... [2025-03-08 05:37:35,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (1/1) ... [2025-03-08 05:37:35,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (1/1) ... [2025-03-08 05:37:35,428 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:37:35,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (1/1) ... [2025-03-08 05:37:35,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (1/1) ... [2025-03-08 05:37:35,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (1/1) ... [2025-03-08 05:37:35,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (1/1) ... [2025-03-08 05:37:35,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (1/1) ... [2025-03-08 05:37:35,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (1/1) ... [2025-03-08 05:37:35,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:37:35,470 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:37:35,470 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:37:35,470 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:37:35,471 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (1/1) ... [2025-03-08 05:37:35,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:37:35,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:35,497 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:37:35,503 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:37:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:37:35,524 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:37:35,524 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:37:35,525 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:37:35,525 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-03-08 05:37:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:37:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:37:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:37:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:37:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:37:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:37:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:37:35,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:37:35,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:37:35,721 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:37:35,725 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:37:35,842 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1268: #res#1 := ~retValue_acc~23#1; [2025-03-08 05:37:35,842 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1223-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~22#1; [2025-03-08 05:37:36,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1564-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~27#1; [2025-03-08 05:37:36,074 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1176-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~21#1; [2025-03-08 05:37:36,074 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1681-1: getEmailId_#res#1 := getEmailId_~retValue_acc~30#1; [2025-03-08 05:37:36,074 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L451-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~5#1; [2025-03-08 05:37:36,074 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1492-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~26#1; [2025-03-08 05:37:36,075 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L361-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~4#1; [2025-03-08 05:37:36,075 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L471-1: isReadable_#res#1 := isReadable_~retValue_acc~6#1; [2025-03-08 05:37:36,075 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1718-1: getEmailFrom_#res#1 := getEmailFrom_~retValue_acc~31#1; [2025-03-08 05:37:36,075 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1611-1: getClientId_#res#1 := getClientId_~retValue_acc~28#1; [2025-03-08 05:37:36,087 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L495-1: createEmail_#res#1 := createEmail_~retValue_acc~8#1; [2025-03-08 05:37:36,096 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L720: #res := ~retValue_acc~15; [2025-03-08 05:37:36,106 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1870: #res := ~retValue_acc~35; [2025-03-08 05:37:36,133 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: #res := ~retValue_acc~36; [2025-03-08 05:37:36,151 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1755: #res := ~retValue_acc~32; [2025-03-08 05:37:36,217 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1046: #res := ~retValue_acc~19; [2025-03-08 05:37:36,465 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L318-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~1#1; [2025-03-08 05:37:36,466 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L336-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~3#1; [2025-03-08 05:37:36,466 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1331-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~24#1; [2025-03-08 05:37:36,466 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L327-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~2#1; [2025-03-08 05:37:36,466 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L542-1: valid_product_#res#1 := valid_product_~retValue_acc~10#1; [2025-03-08 05:37:36,466 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1438-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~25#1; [2025-03-08 05:37:36,586 INFO L? ?]: Removed 524 outVars from TransFormulas that were not future-live. [2025-03-08 05:37:36,587 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:37:36,604 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:37:36,604 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:37:36,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:37:36 BoogieIcfgContainer [2025-03-08 05:37:36,605 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:37:36,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:37:36,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:37:36,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:37:36,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:37:34" (1/3) ... [2025-03-08 05:37:36,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f08fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:37:36, skipping insertion in model container [2025-03-08 05:37:36,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:37:35" (2/3) ... [2025-03-08 05:37:36,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f08fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:37:36, skipping insertion in model container [2025-03-08 05:37:36,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:37:36" (3/3) ... [2025-03-08 05:37:36,612 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec9_product21.cil.c [2025-03-08 05:37:36,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:37:36,624 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec9_product21.cil.c that has 22 procedures, 375 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:37:36,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:37:36,677 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;@3d409237, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:37:36,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:37:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 375 states, 295 states have (on average 1.5694915254237287) internal successors, (463), 300 states have internal predecessors, (463), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 05:37:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:37:36,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:36,692 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] [2025-03-08 05:37:36,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:36,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1187320196, now seen corresponding path program 1 times [2025-03-08 05:37:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:36,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831099775] [2025-03-08 05:37:36,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:36,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:37:36,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:37:36,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:36,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:37,297 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:37:37,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:37,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831099775] [2025-03-08 05:37:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831099775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731864918] [2025-03-08 05:37:37,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:37,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:37,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:37,304 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:37:37,306 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:37:37,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:37:37,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:37:37,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:37,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:37,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:37:37,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:37,671 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:37:37,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:37:37,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731864918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:37,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:37:37,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:37:37,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432597642] [2025-03-08 05:37:37,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:37,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:37,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:37,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:37:37,704 INFO L87 Difference]: Start difference. First operand has 375 states, 295 states have (on average 1.5694915254237287) internal successors, (463), 300 states have internal predecessors, (463), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:37,771 INFO L93 Difference]: Finished difference Result 560 states and 850 transitions. [2025-03-08 05:37:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:37,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-03-08 05:37:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:37,783 INFO L225 Difference]: With dead ends: 560 [2025-03-08 05:37:37,783 INFO L226 Difference]: Without dead ends: 369 [2025-03-08 05:37:37,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 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:37:37,790 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 0 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1143 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:37:37,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-08 05:37:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-08 05:37:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 290 states have (on average 1.5655172413793104) internal successors, (454), 294 states have internal predecessors, (454), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 05:37:37,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 567 transitions. [2025-03-08 05:37:37,837 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 567 transitions. Word has length 98 [2025-03-08 05:37:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:37,841 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 567 transitions. [2025-03-08 05:37:37,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 567 transitions. [2025-03-08 05:37:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:37:37,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:37,849 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] [2025-03-08 05:37:37,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:37:38,050 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:37:38,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:38,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1457106508, now seen corresponding path program 1 times [2025-03-08 05:37:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:38,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516001908] [2025-03-08 05:37:38,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:38,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:38,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:37:38,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:37:38,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:38,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:38,241 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:37:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:38,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516001908] [2025-03-08 05:37:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516001908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747046689] [2025-03-08 05:37:38,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:38,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:38,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:38,246 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:37:38,249 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:37:38,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:37:38,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:37:38,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:38,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:38,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:37:38,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:38,541 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:37:38,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:37:38,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747046689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:38,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:37:38,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:37:38,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028345419] [2025-03-08 05:37:38,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:38,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:38,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:38,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:37:38,547 INFO L87 Difference]: Start difference. First operand 369 states and 567 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:38,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:38,584 INFO L93 Difference]: Finished difference Result 785 states and 1225 transitions. [2025-03-08 05:37:38,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:38,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-03-08 05:37:38,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:38,588 INFO L225 Difference]: With dead ends: 785 [2025-03-08 05:37:38,588 INFO L226 Difference]: Without dead ends: 442 [2025-03-08 05:37:38,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 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:37:38,590 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 134 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1091 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:37:38,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1091 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-08 05:37:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 434. [2025-03-08 05:37:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 341 states have (on average 1.5865102639296187) internal successors, (541), 345 states have internal predecessors, (541), 71 states have call successors, (71), 21 states have call predecessors, (71), 21 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 05:37:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 682 transitions. [2025-03-08 05:37:38,622 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 682 transitions. Word has length 102 [2025-03-08 05:37:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:38,622 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 682 transitions. [2025-03-08 05:37:38,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 682 transitions. [2025-03-08 05:37:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:37:38,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:38,627 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] [2025-03-08 05:37:38,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:37:38,827 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:37:38,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:38,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1634362288, now seen corresponding path program 1 times [2025-03-08 05:37:38,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:38,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905929401] [2025-03-08 05:37:38,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:38,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:38,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:37:38,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:37:38,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:38,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:39,023 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:37:39,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:39,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905929401] [2025-03-08 05:37:39,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905929401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:39,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028713510] [2025-03-08 05:37:39,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:39,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:39,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:39,027 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:37:39,029 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:37:39,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:37:39,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:37:39,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:39,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:39,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:37:39,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:39,325 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:37:39,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:37:39,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028713510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:39,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:37:39,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:37:39,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173605881] [2025-03-08 05:37:39,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:39,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:39,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:39,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:39,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:37:39,328 INFO L87 Difference]: Start difference. First operand 434 states and 682 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:39,398 INFO L93 Difference]: Finished difference Result 859 states and 1354 transitions. [2025-03-08 05:37:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:39,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2025-03-08 05:37:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:39,403 INFO L225 Difference]: With dead ends: 859 [2025-03-08 05:37:39,403 INFO L226 Difference]: Without dead ends: 436 [2025-03-08 05:37:39,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 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:37:39,406 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 2 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2221 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:37:39,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2221 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-08 05:37:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-03-08 05:37:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 347 states have internal predecessors, (542), 71 states have call successors, (71), 21 states have call predecessors, (71), 22 states have return successors, (72), 69 states have call predecessors, (72), 70 states have call successors, (72) [2025-03-08 05:37:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 685 transitions. [2025-03-08 05:37:39,433 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 685 transitions. Word has length 103 [2025-03-08 05:37:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:39,434 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 685 transitions. [2025-03-08 05:37:39,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 685 transitions. [2025-03-08 05:37:39,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:37:39,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:39,439 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] [2025-03-08 05:37:39,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:37:39,640 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:37:39,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:39,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:39,641 INFO L85 PathProgramCache]: Analyzing trace with hash -19600175, now seen corresponding path program 1 times [2025-03-08 05:37:39,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:39,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166930553] [2025-03-08 05:37:39,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:39,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:39,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:37:39,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:37:39,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:39,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:39,826 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:37:39,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:39,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166930553] [2025-03-08 05:37:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166930553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:39,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398178486] [2025-03-08 05:37:39,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:39,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:39,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:39,829 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:37:39,831 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:37:39,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:37:40,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:37:40,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:40,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:40,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:37:40,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:40,130 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:37:40,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:37:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398178486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:40,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:37:40,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:37:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020909411] [2025-03-08 05:37:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:40,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:40,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:40,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:37:40,131 INFO L87 Difference]: Start difference. First operand 436 states and 685 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:40,195 INFO L93 Difference]: Finished difference Result 861 states and 1359 transitions. [2025-03-08 05:37:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:40,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-03-08 05:37:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:40,198 INFO L225 Difference]: With dead ends: 861 [2025-03-08 05:37:40,198 INFO L226 Difference]: Without dead ends: 438 [2025-03-08 05:37:40,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:37:40,201 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 2 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2207 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:37:40,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2207 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-08 05:37:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-08 05:37:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 343 states have (on average 1.5830903790087463) internal successors, (543), 349 states have internal predecessors, (543), 71 states have call successors, (71), 21 states have call predecessors, (71), 23 states have return successors, (77), 69 states have call predecessors, (77), 70 states have call successors, (77) [2025-03-08 05:37:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 691 transitions. [2025-03-08 05:37:40,220 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 691 transitions. Word has length 104 [2025-03-08 05:37:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:40,220 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 691 transitions. [2025-03-08 05:37:40,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 691 transitions. [2025-03-08 05:37:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 05:37:40,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:40,222 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] [2025-03-08 05:37:40,242 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:37:40,423 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:37:40,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:40,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash 519130522, now seen corresponding path program 1 times [2025-03-08 05:37:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:40,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396023597] [2025-03-08 05:37:40,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:40,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:40,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 05:37:40,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 05:37:40,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:40,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:40,539 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:37:40,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:40,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396023597] [2025-03-08 05:37:40,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396023597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:40,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:40,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:37:40,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139861970] [2025-03-08 05:37:40,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:40,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:40,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:40,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:40,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:37:40,540 INFO L87 Difference]: Start difference. First operand 438 states and 691 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:40,579 INFO L93 Difference]: Finished difference Result 853 states and 1350 transitions. [2025-03-08 05:37:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2025-03-08 05:37:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:40,582 INFO L225 Difference]: With dead ends: 853 [2025-03-08 05:37:40,582 INFO L226 Difference]: Without dead ends: 438 [2025-03-08 05:37:40,583 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:37:40,584 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 2 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2225 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:37:40,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2225 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-08 05:37:40,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-08 05:37:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 343 states have (on average 1.5830903790087463) internal successors, (543), 349 states have internal predecessors, (543), 71 states have call successors, (71), 21 states have call predecessors, (71), 23 states have return successors, (76), 69 states have call predecessors, (76), 70 states have call successors, (76) [2025-03-08 05:37:40,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 690 transitions. [2025-03-08 05:37:40,604 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 690 transitions. Word has length 105 [2025-03-08 05:37:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:40,605 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 690 transitions. [2025-03-08 05:37:40,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 690 transitions. [2025-03-08 05:37:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:37:40,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:40,607 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] [2025-03-08 05:37:40,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:37:40,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:40,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:40,607 INFO L85 PathProgramCache]: Analyzing trace with hash -914567651, now seen corresponding path program 2 times [2025-03-08 05:37:40,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:40,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179253659] [2025-03-08 05:37:40,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:37:40,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:40,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-03-08 05:37:40,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:37:40,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:37:40,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:40,722 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:37:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:40,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179253659] [2025-03-08 05:37:40,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179253659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:40,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:40,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:37:40,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483907020] [2025-03-08 05:37:40,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:40,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:40,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:40,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:40,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:37:40,725 INFO L87 Difference]: Start difference. First operand 438 states and 690 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:40,773 INFO L93 Difference]: Finished difference Result 851 states and 1345 transitions. [2025-03-08 05:37:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:40,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2025-03-08 05:37:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:40,778 INFO L225 Difference]: With dead ends: 851 [2025-03-08 05:37:40,779 INFO L226 Difference]: Without dead ends: 438 [2025-03-08 05:37:40,780 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:37:40,782 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 2 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2211 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:37:40,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2211 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-08 05:37:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-08 05:37:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 343 states have (on average 1.5830903790087463) internal successors, (543), 349 states have internal predecessors, (543), 71 states have call successors, (71), 21 states have call predecessors, (71), 23 states have return successors, (75), 69 states have call predecessors, (75), 70 states have call successors, (75) [2025-03-08 05:37:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 689 transitions. [2025-03-08 05:37:40,808 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 689 transitions. Word has length 106 [2025-03-08 05:37:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:40,808 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 689 transitions. [2025-03-08 05:37:40,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 689 transitions. [2025-03-08 05:37:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:37:40,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:40,810 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] [2025-03-08 05:37:40,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:37:40,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:40,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash -87602936, now seen corresponding path program 3 times [2025-03-08 05:37:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:40,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673579695] [2025-03-08 05:37:40,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:37:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:40,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 107 statements into 3 equivalence classes. [2025-03-08 05:37:40,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 95 of 107 statements. [2025-03-08 05:37:40,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 05:37:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:40,908 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:37:40,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:40,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673579695] [2025-03-08 05:37:40,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673579695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:40,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:40,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:37:40,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511448653] [2025-03-08 05:37:40,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:40,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:40,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:40,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:40,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:37:40,909 INFO L87 Difference]: Start difference. First operand 438 states and 689 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:40,957 INFO L93 Difference]: Finished difference Result 853 states and 1351 transitions. [2025-03-08 05:37:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:40,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2025-03-08 05:37:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:40,960 INFO L225 Difference]: With dead ends: 853 [2025-03-08 05:37:40,960 INFO L226 Difference]: Without dead ends: 440 [2025-03-08 05:37:40,962 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:37:40,962 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1 mSDsluCounter, 1662 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2222 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:37:40,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2222 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-08 05:37:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-03-08 05:37:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 344 states have (on average 1.5813953488372092) internal successors, (544), 351 states have internal predecessors, (544), 71 states have call successors, (71), 21 states have call predecessors, (71), 24 states have return successors, (80), 69 states have call predecessors, (80), 70 states have call successors, (80) [2025-03-08 05:37:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 695 transitions. [2025-03-08 05:37:40,998 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 695 transitions. Word has length 107 [2025-03-08 05:37:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:40,998 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 695 transitions. [2025-03-08 05:37:40,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 695 transitions. [2025-03-08 05:37:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:37:41,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:41,000 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] [2025-03-08 05:37:41,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:37:41,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:41,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:41,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1814860608, now seen corresponding path program 1 times [2025-03-08 05:37:41,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:41,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989270320] [2025-03-08 05:37:41,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:41,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:41,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:37:41,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:37:41,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:41,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:41,101 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:37:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:41,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989270320] [2025-03-08 05:37:41,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989270320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:41,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:41,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:37:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694647819] [2025-03-08 05:37:41,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:41,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:41,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:41,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:37:41,103 INFO L87 Difference]: Start difference. First operand 440 states and 695 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:41,139 INFO L93 Difference]: Finished difference Result 859 states and 1361 transitions. [2025-03-08 05:37:41,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:41,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-08 05:37:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:41,142 INFO L225 Difference]: With dead ends: 859 [2025-03-08 05:37:41,142 INFO L226 Difference]: Without dead ends: 442 [2025-03-08 05:37:41,143 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:37:41,144 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 1 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2228 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:37:41,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2228 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-08 05:37:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-03-08 05:37:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 345 states have (on average 1.5797101449275361) internal successors, (545), 353 states have internal predecessors, (545), 71 states have call successors, (71), 21 states have call predecessors, (71), 25 states have return successors, (82), 69 states have call predecessors, (82), 70 states have call successors, (82) [2025-03-08 05:37:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 698 transitions. [2025-03-08 05:37:41,158 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 698 transitions. Word has length 108 [2025-03-08 05:37:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:41,159 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 698 transitions. [2025-03-08 05:37:41,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 698 transitions. [2025-03-08 05:37:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:37:41,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:41,161 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] [2025-03-08 05:37:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:37:41,161 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:41,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:41,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1164082081, now seen corresponding path program 1 times [2025-03-08 05:37:41,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:41,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647523093] [2025-03-08 05:37:41,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:41,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:41,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:37:41,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:37:41,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:41,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:41,250 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:37:41,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:41,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647523093] [2025-03-08 05:37:41,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647523093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:41,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:41,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:37:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604456596] [2025-03-08 05:37:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:41,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:41,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:41,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:41,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:37:41,252 INFO L87 Difference]: Start difference. First operand 442 states and 698 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:41,288 INFO L93 Difference]: Finished difference Result 861 states and 1364 transitions. [2025-03-08 05:37:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:41,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-03-08 05:37:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:41,292 INFO L225 Difference]: With dead ends: 861 [2025-03-08 05:37:41,292 INFO L226 Difference]: Without dead ends: 444 [2025-03-08 05:37:41,293 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:37:41,293 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:41,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2221 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-08 05:37:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2025-03-08 05:37:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 345 states have (on average 1.5797101449275361) internal successors, (545), 353 states have internal predecessors, (545), 71 states have call successors, (71), 21 states have call predecessors, (71), 25 states have return successors, (82), 69 states have call predecessors, (82), 70 states have call successors, (82) [2025-03-08 05:37:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 698 transitions. [2025-03-08 05:37:41,309 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 698 transitions. Word has length 109 [2025-03-08 05:37:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:41,309 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 698 transitions. [2025-03-08 05:37:41,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 05:37:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 698 transitions. [2025-03-08 05:37:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:37:41,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:41,312 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] [2025-03-08 05:37:41,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:37:41,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:41,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:41,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2119603360, now seen corresponding path program 1 times [2025-03-08 05:37:41,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:41,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505040752] [2025-03-08 05:37:41,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:41,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:41,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:37:41,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:37:41,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:41,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:41,420 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:37:41,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:41,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505040752] [2025-03-08 05:37:41,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505040752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:37:41,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239814230] [2025-03-08 05:37:41,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:37:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:37:41,423 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:37:41,425 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:37:41,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:37:41,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:37:41,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:41,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:41,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:37:41,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:37:41,663 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:37:41,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:37:41,740 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:37:41,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239814230] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:37:41,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:37:41,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:37:41,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549675746] [2025-03-08 05:37:41,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:37:41,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:37:41,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:41,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:37:41,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:37:41,743 INFO L87 Difference]: Start difference. First operand 442 states and 698 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:37:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:41,917 INFO L93 Difference]: Finished difference Result 1051 states and 1717 transitions. [2025-03-08 05:37:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:37:41,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 109 [2025-03-08 05:37:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:41,924 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 05:37:41,924 INFO L226 Difference]: Without dead ends: 873 [2025-03-08 05:37:41,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 215 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:37:41,926 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 735 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:37:41,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2165 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:37:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-08 05:37:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 849. [2025-03-08 05:37:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 673 states have (on average 1.6448736998514115) internal successors, (1107), 681 states have internal predecessors, (1107), 150 states have call successors, (150), 21 states have call predecessors, (150), 25 states have return successors, (171), 148 states have call predecessors, (171), 149 states have call successors, (171) [2025-03-08 05:37:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1428 transitions. [2025-03-08 05:37:41,962 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1428 transitions. Word has length 109 [2025-03-08 05:37:41,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:41,963 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1428 transitions. [2025-03-08 05:37:41,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:37:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1428 transitions. [2025-03-08 05:37:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 05:37:41,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:41,967 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] [2025-03-08 05:37:41,975 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:37:42,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:37:42,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:42,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash -517380017, now seen corresponding path program 1 times [2025-03-08 05:37:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:42,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712403497] [2025-03-08 05:37:42,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:42,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 05:37:42,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 05:37:42,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:42,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:42,215 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:37:42,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:42,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712403497] [2025-03-08 05:37:42,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712403497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:42,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:42,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:42,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842539252] [2025-03-08 05:37:42,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:42,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:42,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:42,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:42,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:42,217 INFO L87 Difference]: Start difference. First operand 849 states and 1428 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:42,251 INFO L93 Difference]: Finished difference Result 2045 states and 3485 transitions. [2025-03-08 05:37:42,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:42,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-03-08 05:37:42,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:42,259 INFO L225 Difference]: With dead ends: 2045 [2025-03-08 05:37:42,259 INFO L226 Difference]: Without dead ends: 1260 [2025-03-08 05:37:42,262 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:37:42,262 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 132 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1137 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:37:42,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1137 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2025-03-08 05:37:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1252. [2025-03-08 05:37:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 997 states have (on average 1.6599799398194583) internal successors, (1655), 1005 states have internal predecessors, (1655), 229 states have call successors, (229), 21 states have call predecessors, (229), 25 states have return successors, (260), 227 states have call predecessors, (260), 228 states have call successors, (260) [2025-03-08 05:37:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2144 transitions. [2025-03-08 05:37:42,310 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2144 transitions. Word has length 116 [2025-03-08 05:37:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:42,310 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 2144 transitions. [2025-03-08 05:37:42,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2144 transitions. [2025-03-08 05:37:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 05:37:42,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:42,317 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:37:42,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:37:42,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:42,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1392657708, now seen corresponding path program 1 times [2025-03-08 05:37:42,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:42,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436153571] [2025-03-08 05:37:42,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:42,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 05:37:42,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 05:37:42,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:42,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:42,364 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:37:42,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:42,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436153571] [2025-03-08 05:37:42,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436153571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:42,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:42,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:42,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128772259] [2025-03-08 05:37:42,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:42,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:42,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:42,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:42,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:42,366 INFO L87 Difference]: Start difference. First operand 1252 states and 2144 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:42,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:42,414 INFO L93 Difference]: Finished difference Result 3031 states and 5219 transitions. [2025-03-08 05:37:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:42,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-03-08 05:37:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:42,426 INFO L225 Difference]: With dead ends: 3031 [2025-03-08 05:37:42,426 INFO L226 Difference]: Without dead ends: 1892 [2025-03-08 05:37:42,431 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:37:42,431 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 130 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1136 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:37:42,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2025-03-08 05:37:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1884. [2025-03-08 05:37:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1510 states have (on average 1.6701986754966887) internal successors, (2522), 1518 states have internal predecessors, (2522), 348 states have call successors, (348), 21 states have call predecessors, (348), 25 states have return successors, (379), 346 states have call predecessors, (379), 347 states have call successors, (379) [2025-03-08 05:37:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 3249 transitions. [2025-03-08 05:37:42,502 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 3249 transitions. Word has length 117 [2025-03-08 05:37:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:42,502 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 3249 transitions. [2025-03-08 05:37:42,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 3249 transitions. [2025-03-08 05:37:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:37:42,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:42,511 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] [2025-03-08 05:37:42,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:37:42,511 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:42,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash 553845038, now seen corresponding path program 1 times [2025-03-08 05:37:42,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:42,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549022031] [2025-03-08 05:37:42,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:42,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:42,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:37:42,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:37:42,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:42,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:42,566 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:37:42,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:42,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549022031] [2025-03-08 05:37:42,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549022031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:42,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:42,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:42,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383830950] [2025-03-08 05:37:42,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:42,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:42,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:42,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:42,568 INFO L87 Difference]: Start difference. First operand 1884 states and 3249 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:42,653 INFO L93 Difference]: Finished difference Result 4515 states and 7841 transitions. [2025-03-08 05:37:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:42,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-03-08 05:37:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:42,668 INFO L225 Difference]: With dead ends: 4515 [2025-03-08 05:37:42,668 INFO L226 Difference]: Without dead ends: 2862 [2025-03-08 05:37:42,674 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:37:42,675 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 128 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1121 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:37:42,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2025-03-08 05:37:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2854. [2025-03-08 05:37:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2318 states have (on average 1.678602243313201) internal successors, (3891), 2326 states have internal predecessors, (3891), 510 states have call successors, (510), 21 states have call predecessors, (510), 25 states have return successors, (557), 508 states have call predecessors, (557), 509 states have call successors, (557) [2025-03-08 05:37:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 4958 transitions. [2025-03-08 05:37:42,787 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 4958 transitions. Word has length 118 [2025-03-08 05:37:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:42,787 INFO L471 AbstractCegarLoop]: Abstraction has 2854 states and 4958 transitions. [2025-03-08 05:37:42,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4958 transitions. [2025-03-08 05:37:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:37:42,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:42,799 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] [2025-03-08 05:37:42,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:37:42,800 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:42,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1637020565, now seen corresponding path program 1 times [2025-03-08 05:37:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:42,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342762806] [2025-03-08 05:37:42,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:42,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:37:42,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:37:42,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:42,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:42,850 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:37:42,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:42,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342762806] [2025-03-08 05:37:42,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342762806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:42,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:42,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:42,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160560256] [2025-03-08 05:37:42,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:42,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:42,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:42,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:42,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:42,852 INFO L87 Difference]: Start difference. First operand 2854 states and 4958 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:42,965 INFO L93 Difference]: Finished difference Result 6862 states and 11996 transitions. [2025-03-08 05:37:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:42,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-08 05:37:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:42,992 INFO L225 Difference]: With dead ends: 6862 [2025-03-08 05:37:42,992 INFO L226 Difference]: Without dead ends: 4432 [2025-03-08 05:37:43,002 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:37:43,002 INFO L435 NwaCegarLoop]: 565 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, 1121 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:37:43,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4432 states. [2025-03-08 05:37:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4432 to 4424. [2025-03-08 05:37:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4424 states, 3643 states have (on average 1.6846006038978865) internal successors, (6137), 3651 states have internal predecessors, (6137), 755 states have call successors, (755), 21 states have call predecessors, (755), 25 states have return successors, (828), 753 states have call predecessors, (828), 754 states have call successors, (828) [2025-03-08 05:37:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 7720 transitions. [2025-03-08 05:37:43,268 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 7720 transitions. Word has length 119 [2025-03-08 05:37:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:43,270 INFO L471 AbstractCegarLoop]: Abstraction has 4424 states and 7720 transitions. [2025-03-08 05:37:43,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 7720 transitions. [2025-03-08 05:37:43,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:37:43,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:43,288 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] [2025-03-08 05:37:43,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:37:43,288 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:43,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash 182706989, now seen corresponding path program 1 times [2025-03-08 05:37:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:43,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762917615] [2025-03-08 05:37:43,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:43,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:43,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:37:43,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:37:43,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:43,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:43,352 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:37:43,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:43,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762917615] [2025-03-08 05:37:43,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762917615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:43,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:43,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:43,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909129955] [2025-03-08 05:37:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:43,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:43,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:43,353 INFO L87 Difference]: Start difference. First operand 4424 states and 7720 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:43,522 INFO L93 Difference]: Finished difference Result 10775 states and 18923 transitions. [2025-03-08 05:37:43,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:43,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-08 05:37:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:43,564 INFO L225 Difference]: With dead ends: 10775 [2025-03-08 05:37:43,564 INFO L226 Difference]: Without dead ends: 7071 [2025-03-08 05:37:43,581 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:37:43,582 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 124 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1145 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:37:43,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2025-03-08 05:37:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 7063. [2025-03-08 05:37:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7063 states, 5789 states have (on average 1.6838832268094663) internal successors, (9748), 5797 states have internal predecessors, (9748), 1248 states have call successors, (1248), 21 states have call predecessors, (1248), 25 states have return successors, (1365), 1246 states have call predecessors, (1365), 1247 states have call successors, (1365) [2025-03-08 05:37:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7063 states to 7063 states and 12361 transitions. [2025-03-08 05:37:43,948 INFO L78 Accepts]: Start accepts. Automaton has 7063 states and 12361 transitions. Word has length 120 [2025-03-08 05:37:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:43,949 INFO L471 AbstractCegarLoop]: Abstraction has 7063 states and 12361 transitions. [2025-03-08 05:37:43,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 7063 states and 12361 transitions. [2025-03-08 05:37:43,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 05:37:43,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:43,970 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:37:43,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:37:43,970 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:43,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:43,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2013811286, now seen corresponding path program 1 times [2025-03-08 05:37:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:43,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229477595] [2025-03-08 05:37:43,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:43,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:43,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 05:37:43,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 05:37:43,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:43,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:44,018 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:37:44,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:44,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229477595] [2025-03-08 05:37:44,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229477595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:44,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:44,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:44,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244853328] [2025-03-08 05:37:44,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:44,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:44,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:44,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:44,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:44,020 INFO L87 Difference]: Start difference. First operand 7063 states and 12361 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:44,307 INFO L93 Difference]: Finished difference Result 17872 states and 31458 transitions. [2025-03-08 05:37:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:44,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-08 05:37:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:44,371 INFO L225 Difference]: With dead ends: 17872 [2025-03-08 05:37:44,371 INFO L226 Difference]: Without dead ends: 11884 [2025-03-08 05:37:44,398 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:37:44,398 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 122 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1128 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:37:44,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1128 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11884 states. [2025-03-08 05:37:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11884 to 11876. [2025-03-08 05:37:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11876 states, 9780 states have (on average 1.6842535787321062) internal successors, (16472), 9788 states have internal predecessors, (16472), 2070 states have call successors, (2070), 21 states have call predecessors, (2070), 25 states have return successors, (2265), 2068 states have call predecessors, (2265), 2069 states have call successors, (2265) [2025-03-08 05:37:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11876 states to 11876 states and 20807 transitions. [2025-03-08 05:37:44,942 INFO L78 Accepts]: Start accepts. Automaton has 11876 states and 20807 transitions. Word has length 121 [2025-03-08 05:37:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:44,943 INFO L471 AbstractCegarLoop]: Abstraction has 11876 states and 20807 transitions. [2025-03-08 05:37:44,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 11876 states and 20807 transitions. [2025-03-08 05:37:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:37:44,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:44,973 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] [2025-03-08 05:37:44,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:37:44,973 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:44,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash 356306764, now seen corresponding path program 1 times [2025-03-08 05:37:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:44,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818613469] [2025-03-08 05:37:44,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:44,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:44,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:37:44,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:37:44,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:44,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:45,024 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:37:45,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818613469] [2025-03-08 05:37:45,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818613469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:45,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:45,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382986558] [2025-03-08 05:37:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:45,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:45,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:45,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:45,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:45,026 INFO L87 Difference]: Start difference. First operand 11876 states and 20807 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:45,564 INFO L93 Difference]: Finished difference Result 28390 states and 49702 transitions. [2025-03-08 05:37:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:45,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-08 05:37:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:45,655 INFO L225 Difference]: With dead ends: 28390 [2025-03-08 05:37:45,655 INFO L226 Difference]: Without dead ends: 18534 [2025-03-08 05:37:45,702 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:37:45,703 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 120 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1096 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:37:45,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1096 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18534 states. [2025-03-08 05:37:46,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18534 to 18526. [2025-03-08 05:37:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18526 states, 15227 states have (on average 1.662244696919945) internal successors, (25311), 15235 states have internal predecessors, (25311), 3273 states have call successors, (3273), 21 states have call predecessors, (3273), 25 states have return successors, (3612), 3271 states have call predecessors, (3612), 3272 states have call successors, (3612) [2025-03-08 05:37:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18526 states to 18526 states and 32196 transitions. [2025-03-08 05:37:46,472 INFO L78 Accepts]: Start accepts. Automaton has 18526 states and 32196 transitions. Word has length 122 [2025-03-08 05:37:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:46,472 INFO L471 AbstractCegarLoop]: Abstraction has 18526 states and 32196 transitions. [2025-03-08 05:37:46,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:46,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18526 states and 32196 transitions. [2025-03-08 05:37:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:37:46,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:46,499 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] [2025-03-08 05:37:46,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:37:46,500 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:46,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:46,500 INFO L85 PathProgramCache]: Analyzing trace with hash 882818199, now seen corresponding path program 1 times [2025-03-08 05:37:46,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:46,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576825324] [2025-03-08 05:37:46,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:46,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:37:46,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:37:46,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:46,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:46,555 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:37:46,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:46,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576825324] [2025-03-08 05:37:46,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576825324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:46,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:46,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:46,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781719357] [2025-03-08 05:37:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:46,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:46,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:46,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:46,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:46,557 INFO L87 Difference]: Start difference. First operand 18526 states and 32196 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:47,138 INFO L93 Difference]: Finished difference Result 48987 states and 85447 transitions. [2025-03-08 05:37:47,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:47,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-03-08 05:37:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:47,293 INFO L225 Difference]: With dead ends: 48987 [2025-03-08 05:37:47,293 INFO L226 Difference]: Without dead ends: 33086 [2025-03-08 05:37:47,352 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:37:47,353 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 118 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1124 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:37:47,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33086 states. [2025-03-08 05:37:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33086 to 33078. [2025-03-08 05:37:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33078 states, 27329 states have (on average 1.6592264627318964) internal successors, (45345), 27337 states have internal predecessors, (45345), 5723 states have call successors, (5723), 21 states have call predecessors, (5723), 25 states have return successors, (6336), 5721 states have call predecessors, (6336), 5722 states have call successors, (6336) [2025-03-08 05:37:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33078 states to 33078 states and 57404 transitions. [2025-03-08 05:37:48,788 INFO L78 Accepts]: Start accepts. Automaton has 33078 states and 57404 transitions. Word has length 123 [2025-03-08 05:37:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:48,788 INFO L471 AbstractCegarLoop]: Abstraction has 33078 states and 57404 transitions. [2025-03-08 05:37:48,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 33078 states and 57404 transitions. [2025-03-08 05:37:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:37:48,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:48,823 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] [2025-03-08 05:37:48,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:37:48,823 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:48,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash -333481580, now seen corresponding path program 2 times [2025-03-08 05:37:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:48,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039815187] [2025-03-08 05:37:48,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:37:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:48,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-03-08 05:37:48,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:37:48,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:37:48,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:48,952 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:37:48,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:48,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039815187] [2025-03-08 05:37:48,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039815187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:48,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:48,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:37:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005193258] [2025-03-08 05:37:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:48,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:37:48,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:48,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:37:48,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:37:48,955 INFO L87 Difference]: Start difference. First operand 33078 states and 57404 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:49,968 INFO L93 Difference]: Finished difference Result 62452 states and 108530 transitions. [2025-03-08 05:37:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:37:49,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-03-08 05:37:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:50,161 INFO L225 Difference]: With dead ends: 62452 [2025-03-08 05:37:50,161 INFO L226 Difference]: Without dead ends: 33086 [2025-03-08 05:37:50,255 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:37:50,256 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 131 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 2714 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:37:50,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 2714 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33086 states. [2025-03-08 05:37:51,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33086 to 33078. [2025-03-08 05:37:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33078 states, 27329 states have (on average 1.6494932123385415) internal successors, (45079), 27337 states have internal predecessors, (45079), 5723 states have call successors, (5723), 21 states have call predecessors, (5723), 25 states have return successors, (6336), 5721 states have call predecessors, (6336), 5722 states have call successors, (6336) [2025-03-08 05:37:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33078 states to 33078 states and 57138 transitions. [2025-03-08 05:37:51,673 INFO L78 Accepts]: Start accepts. Automaton has 33078 states and 57138 transitions. Word has length 124 [2025-03-08 05:37:51,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:51,674 INFO L471 AbstractCegarLoop]: Abstraction has 33078 states and 57138 transitions. [2025-03-08 05:37:51,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 33078 states and 57138 transitions. [2025-03-08 05:37:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:37:51,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:51,697 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] [2025-03-08 05:37:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:37:51,697 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash -929518965, now seen corresponding path program 1 times [2025-03-08 05:37:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039432061] [2025-03-08 05:37:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:51,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:37:51,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:37:51,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:51,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:51,750 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:37:51,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:51,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039432061] [2025-03-08 05:37:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039432061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804392438] [2025-03-08 05:37:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:51,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:51,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:51,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:51,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:51,752 INFO L87 Difference]: Start difference. First operand 33078 states and 57138 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:53,469 INFO L93 Difference]: Finished difference Result 90244 states and 156314 transitions. [2025-03-08 05:37:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:53,470 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-03-08 05:37:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:53,840 INFO L225 Difference]: With dead ends: 90244 [2025-03-08 05:37:53,840 INFO L226 Difference]: Without dead ends: 60661 [2025-03-08 05:37:53,964 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:37:53,965 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 116 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1132 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:37:53,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60661 states. [2025-03-08 05:37:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60661 to 60653. [2025-03-08 05:37:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60653 states, 50391 states have (on average 1.6447579924986604) internal successors, (82881), 50399 states have internal predecessors, (82881), 10236 states have call successors, (10236), 21 states have call predecessors, (10236), 25 states have return successors, (11381), 10234 states have call predecessors, (11381), 10235 states have call successors, (11381) [2025-03-08 05:37:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60653 states to 60653 states and 104498 transitions. [2025-03-08 05:37:56,250 INFO L78 Accepts]: Start accepts. Automaton has 60653 states and 104498 transitions. Word has length 124 [2025-03-08 05:37:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:37:56,251 INFO L471 AbstractCegarLoop]: Abstraction has 60653 states and 104498 transitions. [2025-03-08 05:37:56,251 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 60653 states and 104498 transitions. [2025-03-08 05:37:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:37:56,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:37:56,280 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] [2025-03-08 05:37:56,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:37:56,280 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:37:56,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:37:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash 807145336, now seen corresponding path program 1 times [2025-03-08 05:37:56,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:37:56,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924032897] [2025-03-08 05:37:56,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:37:56,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:37:56,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 05:37:56,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:37:56,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:37:56,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:37:56,518 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:37:56,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:37:56,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924032897] [2025-03-08 05:37:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924032897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:37:56,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:37:56,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:37:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743838923] [2025-03-08 05:37:56,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:37:56,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:37:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:37:56,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:37:56,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:37:56,520 INFO L87 Difference]: Start difference. First operand 60653 states and 104498 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:37:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:37:58,776 INFO L93 Difference]: Finished difference Result 113591 states and 196094 transitions. [2025-03-08 05:37:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:37:58,777 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-03-08 05:37:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:37:59,234 INFO L225 Difference]: With dead ends: 113591 [2025-03-08 05:37:59,234 INFO L226 Difference]: Without dead ends: 113413 [2025-03-08 05:37:59,293 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:37:59,295 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 111 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1138 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:37:59,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:37:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113413 states. [2025-03-08 05:38:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113413 to 113405. [2025-03-08 05:38:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113405 states, 94775 states have (on average 1.6390187285676603) internal successors, (155338), 94783 states have internal predecessors, (155338), 18604 states have call successors, (18604), 21 states have call predecessors, (18604), 25 states have return successors, (20795), 18602 states have call predecessors, (20795), 18603 states have call successors, (20795) [2025-03-08 05:38:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113405 states to 113405 states and 194737 transitions. [2025-03-08 05:38:03,179 INFO L78 Accepts]: Start accepts. Automaton has 113405 states and 194737 transitions. Word has length 125 [2025-03-08 05:38:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:38:03,180 INFO L471 AbstractCegarLoop]: Abstraction has 113405 states and 194737 transitions. [2025-03-08 05:38:03,180 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:38:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 113405 states and 194737 transitions. [2025-03-08 05:38:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:38:03,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:38:03,215 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] [2025-03-08 05:38:03,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:38:03,216 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:38:03,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:38:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1749492342, now seen corresponding path program 1 times [2025-03-08 05:38:03,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:38:03,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334684675] [2025-03-08 05:38:03,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:38:03,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:38:03,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:38:03,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:38:03,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:38:03,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:38:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:38:03,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:38:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334684675] [2025-03-08 05:38:03,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334684675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:38:03,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:38:03,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:38:03,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639408471] [2025-03-08 05:38:03,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:38:03,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:38:03,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:38:03,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:38:03,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:38:03,929 INFO L87 Difference]: Start difference. First operand 113405 states and 194737 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:38:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:38:09,166 INFO L93 Difference]: Finished difference Result 225974 states and 393500 transitions. [2025-03-08 05:38:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 05:38:09,167 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 126 [2025-03-08 05:38:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:38:10,420 INFO L225 Difference]: With dead ends: 225974 [2025-03-08 05:38:10,420 INFO L226 Difference]: Without dead ends: 225802 [2025-03-08 05:38:10,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:38:10,523 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 1414 mSDsluCounter, 5815 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 6504 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:38:10,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 6504 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 05:38:10,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225802 states.