./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_productSimulator.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdf21b24c583a6d136f11a4b24a73548bc1166a9ff6f145f509a3c93fdab8434 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:48:51,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:48:51,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:48:51,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:48:51,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:48:51,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:48:51,824 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:48:51,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:48:51,825 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:48:51,825 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:48:51,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:48:51,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:48:51,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:48:51,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:48:51,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:48:51,827 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:48:51,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:51,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:48:51,828 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdf21b24c583a6d136f11a4b24a73548bc1166a9ff6f145f509a3c93fdab8434 [2025-02-05 15:48:52,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:48:52,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:48:52,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:48:52,343 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:48:52,343 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:48:52,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_productSimulator.cil.c [2025-02-05 15:48:54,002 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd9753347/4cf8ac232b27451ab098096f4459c9db/FLAGfdea84c66 [2025-02-05 15:48:54,703 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:48:54,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_productSimulator.cil.c [2025-02-05 15:48:54,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd9753347/4cf8ac232b27451ab098096f4459c9db/FLAGfdea84c66 [2025-02-05 15:48:54,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd9753347/4cf8ac232b27451ab098096f4459c9db [2025-02-05 15:48:54,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:48:54,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:48:54,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:54,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:48:54,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:48:54,792 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:54" (1/1) ... [2025-02-05 15:48:54,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0a8f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:54, skipping insertion in model container [2025-02-05 15:48:54,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:54" (1/1) ... [2025-02-05 15:48:54,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:48:55,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_productSimulator.cil.c[73270,73283] [2025-02-05 15:48:55,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:55,990 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:48:56,008 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-02-05 15:48:56,014 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [168] [2025-02-05 15:48:56,015 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [445] [2025-02-05 15:48:56,015 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [463] [2025-02-05 15:48:56,015 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [829] [2025-02-05 15:48:56,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1909] [2025-02-05 15:48:56,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [2321] [2025-02-05 15:48:56,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2365] [2025-02-05 15:48:56,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2572] [2025-02-05 15:48:56,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3132] [2025-02-05 15:48:56,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3481] [2025-02-05 15:48:56,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_productSimulator.cil.c[73270,73283] [2025-02-05 15:48:56,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:56,435 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:48:56,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56 WrapperNode [2025-02-05 15:48:56,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:56,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:56,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:48:56,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:48:56,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,649 INFO L138 Inliner]: procedures = 152, calls = 266, calls flagged for inlining = 68, calls inlined = 65, statements flattened = 1328 [2025-02-05 15:48:56,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:56,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:48:56,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:48:56,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:48:56,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,800 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:48:56,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:48:56,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:48:56,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:48:56,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:48:56,951 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (1/1) ... [2025-02-05 15:48:56,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:56,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:57,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:48:57,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:48:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:48:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:48:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-02-05 15:48:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-02-05 15:48:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-02-05 15:48:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-02-05 15:48:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:48:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:48:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:48:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:48:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:48:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:48:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:48:57,113 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:48:57,113 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-02-05 15:48:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-02-05 15:48:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:48:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:48:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-02-05 15:48:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-02-05 15:48:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:48:57,116 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:48:57,116 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:48:57,117 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:48:57,117 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:48:57,118 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:48:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-02-05 15:48:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-02-05 15:48:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-02-05 15:48:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-02-05 15:48:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:48:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:48:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:48:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:48:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:48:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:48:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-02-05 15:48:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-02-05 15:48:57,120 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:48:57,120 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:48:57,121 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:48:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:48:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:48:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:48:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-02-05 15:48:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-02-05 15:48:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:48:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:48:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:48:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-02-05 15:48:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-02-05 15:48:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-02-05 15:48:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-02-05 15:48:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:48:57,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:48:57,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:48:57,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:48:57,559 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:48:57,562 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:48:57,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2507: #res := ~retValue_acc~34; [2025-02-05 15:48:57,623 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2228: #res := ~retValue_acc~31; [2025-02-05 15:48:57,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016: #res := ~retValue_acc~43; [2025-02-05 15:48:57,722 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1451: #res := ~retValue_acc~15; [2025-02-05 15:48:57,997 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L995: #res := ~retValue_acc~9; [2025-02-05 15:48:58,108 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-1: getEmailId_#res#1 := getEmailId_~retValue_acc~24#1; [2025-02-05 15:48:58,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2191: #res := ~retValue_acc~30; [2025-02-05 15:48:58,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2039: #res := ~retValue_acc~26; [2025-02-05 15:48:58,360 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~35#1; [2025-02-05 15:48:58,360 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545: #res#1 := ~retValue_acc~36#1; [2025-02-05 15:48:58,533 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~16#1; [2025-02-05 15:48:58,533 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: #res#1 := ~retValue_acc~17#1; [2025-02-05 15:48:58,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1767: #res := ~retValue_acc~20; [2025-02-05 15:48:58,676 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2569-1: createEmail_#res#1 := createEmail_~retValue_acc~38#1; [2025-02-05 15:48:58,690 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2154: #res := ~retValue_acc~29; [2025-02-05 15:48:58,777 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1886-1: getClientId_#res#1 := getClientId_~retValue_acc~22#1; [2025-02-05 15:48:58,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2302-1: isVerified_#res#1 := isVerified_~retValue_acc~33#1; [2025-02-05 15:48:58,892 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1839-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~21#1; [2025-02-05 15:48:58,910 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265: #res := ~retValue_acc~32; [2025-02-05 15:48:58,987 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: #res := ~retValue_acc~0; [2025-02-05 15:48:59,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1321: #res := ~retValue_acc~13; [2025-02-05 15:48:59,094 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1404-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~14#1; [2025-02-05 15:48:59,684 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1606-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~18#1; [2025-02-05 15:48:59,685 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2982-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~41#1; [2025-02-05 15:48:59,685 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1713-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~19#1; [2025-02-05 15:48:59,685 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L165-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:48:59,685 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2973-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~40#1; [2025-02-05 15:48:59,685 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2991-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~42#1; [2025-02-05 15:48:59,699 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2002: #res := ~retValue_acc~25; [2025-02-05 15:49:00,193 INFO L? ?]: Removed 629 outVars from TransFormulas that were not future-live. [2025-02-05 15:49:00,194 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:49:00,229 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:49:00,229 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:49:00,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:49:00 BoogieIcfgContainer [2025-02-05 15:49:00,230 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:49:00,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:49:00,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:49:00,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:49:00,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:48:54" (1/3) ... [2025-02-05 15:49:00,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49dfb36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:49:00, skipping insertion in model container [2025-02-05 15:49:00,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:56" (2/3) ... [2025-02-05 15:49:00,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49dfb36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:49:00, skipping insertion in model container [2025-02-05 15:49:00,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:49:00" (3/3) ... [2025-02-05 15:49:00,239 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_productSimulator.cil.c [2025-02-05 15:49:00,253 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:49:00,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_productSimulator.cil.c that has 44 procedures, 603 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:49:00,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:49:00,446 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;@6d1cfe36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:49:00,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:49:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 603 states, 448 states have (on average 1.5133928571428572) internal successors, (678), 468 states have internal predecessors, (678), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 15:49:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:49:00,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:00,547 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:00,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:00,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:00,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1092424816, now seen corresponding path program 1 times [2025-02-05 15:49:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:00,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816793214] [2025-02-05 15:49:00,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:00,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:49:00,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:49:00,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:00,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:49:01,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:01,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816793214] [2025-02-05 15:49:01,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816793214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:01,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:01,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:49:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999772324] [2025-02-05 15:49:01,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:01,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:49:01,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:01,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:49:01,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:49:01,379 INFO L87 Difference]: Start difference. First operand has 603 states, 448 states have (on average 1.5133928571428572) internal successors, (678), 468 states have internal predecessors, (678), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:49:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:01,530 INFO L93 Difference]: Finished difference Result 938 states and 1377 transitions. [2025-02-05 15:49:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:49:01,532 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2025-02-05 15:49:01,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:01,558 INFO L225 Difference]: With dead ends: 938 [2025-02-05 15:49:01,559 INFO L226 Difference]: Without dead ends: 596 [2025-02-05 15:49:01,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:49:01,573 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:01,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-05 15:49:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-05 15:49:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.51131221719457) internal successors, (668), 461 states have internal predecessors, (668), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 15:49:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 887 transitions. [2025-02-05 15:49:01,737 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 887 transitions. Word has length 127 [2025-02-05 15:49:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:01,740 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 887 transitions. [2025-02-05 15:49:01,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:49:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 887 transitions. [2025-02-05 15:49:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:49:01,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:01,752 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:01,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:49:01,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:01,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:01,753 INFO L85 PathProgramCache]: Analyzing trace with hash -725998881, now seen corresponding path program 1 times [2025-02-05 15:49:01,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:01,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883954820] [2025-02-05 15:49:01,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:01,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:01,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:49:01,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:49:01,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:01,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:49:02,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:02,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883954820] [2025-02-05 15:49:02,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883954820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:02,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:49:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844676275] [2025-02-05 15:49:02,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:02,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:49:02,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:02,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:49:02,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:49:02,471 INFO L87 Difference]: Start difference. First operand 596 states and 887 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:49:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:02,629 INFO L93 Difference]: Finished difference Result 1156 states and 1718 transitions. [2025-02-05 15:49:02,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:49:02,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 128 [2025-02-05 15:49:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:02,639 INFO L225 Difference]: With dead ends: 1156 [2025-02-05 15:49:02,641 INFO L226 Difference]: Without dead ends: 596 [2025-02-05 15:49:02,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:49:02,646 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 0 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3528 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:02,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3528 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-05 15:49:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-02-05 15:49:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.495475113122172) internal successors, (661), 461 states have internal predecessors, (661), 110 states have call successors, (110), 43 states have call predecessors, (110), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 15:49:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 880 transitions. [2025-02-05 15:49:02,757 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 880 transitions. Word has length 128 [2025-02-05 15:49:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:02,758 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 880 transitions. [2025-02-05 15:49:02,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:49:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 880 transitions. [2025-02-05 15:49:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:49:02,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:02,767 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:02,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:49:02,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:02,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:02,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1507398243, now seen corresponding path program 1 times [2025-02-05 15:49:02,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:02,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580529642] [2025-02-05 15:49:02,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:02,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:02,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:49:02,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:49:02,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:02,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:49:03,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:03,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580529642] [2025-02-05 15:49:03,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580529642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:03,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:03,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:03,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389085152] [2025-02-05 15:49:03,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:03,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:03,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:03,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:03,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:03,008 INFO L87 Difference]: Start difference. First operand 596 states and 880 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:49:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:03,112 INFO L93 Difference]: Finished difference Result 1166 states and 1742 transitions. [2025-02-05 15:49:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:03,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 133 [2025-02-05 15:49:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:03,119 INFO L225 Difference]: With dead ends: 1166 [2025-02-05 15:49:03,119 INFO L226 Difference]: Without dead ends: 595 [2025-02-05 15:49:03,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:03,127 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 846 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:03,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 873 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-05 15:49:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-02-05 15:49:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 443 states have (on average 1.4830699774266365) internal successors, (657), 460 states have internal predecessors, (657), 107 states have call successors, (107), 44 states have call predecessors, (107), 44 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-05 15:49:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 870 transitions. [2025-02-05 15:49:03,196 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 870 transitions. Word has length 133 [2025-02-05 15:49:03,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:03,197 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 870 transitions. [2025-02-05 15:49:03,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:49:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 870 transitions. [2025-02-05 15:49:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:49:03,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:03,200 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:03,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:49:03,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash 51914971, now seen corresponding path program 1 times [2025-02-05 15:49:03,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:03,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554811494] [2025-02-05 15:49:03,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:03,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:03,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:49:03,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:49:03,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:03,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:49:03,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554811494] [2025-02-05 15:49:03,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554811494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:03,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:03,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:03,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326801588] [2025-02-05 15:49:03,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:03,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:03,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:03,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:03,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:03,406 INFO L87 Difference]: Start difference. First operand 595 states and 870 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 15:49:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:03,482 INFO L93 Difference]: Finished difference Result 1159 states and 1710 transitions. [2025-02-05 15:49:03,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:03,483 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 149 [2025-02-05 15:49:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:03,488 INFO L225 Difference]: With dead ends: 1159 [2025-02-05 15:49:03,488 INFO L226 Difference]: Without dead ends: 594 [2025-02-05 15:49:03,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:03,492 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 832 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:03,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 891 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-02-05 15:49:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-02-05 15:49:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 443 states have (on average 1.4785553047404063) internal successors, (655), 459 states have internal predecessors, (655), 106 states have call successors, (106), 44 states have call predecessors, (106), 44 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:49:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 866 transitions. [2025-02-05 15:49:03,562 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 866 transitions. Word has length 149 [2025-02-05 15:49:03,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:03,562 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 866 transitions. [2025-02-05 15:49:03,562 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, (25), 2 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-05 15:49:03,562 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 866 transitions. [2025-02-05 15:49:03,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 15:49:03,569 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:03,569 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:03,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:49:03,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1397617501, now seen corresponding path program 1 times [2025-02-05 15:49:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355053075] [2025-02-05 15:49:03,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:03,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 15:49:03,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 15:49:03,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:03,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:49:03,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:03,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355053075] [2025-02-05 15:49:03,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355053075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:03,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:03,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:03,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713334655] [2025-02-05 15:49:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:03,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:03,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:03,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:03,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:03,799 INFO L87 Difference]: Start difference. First operand 594 states and 866 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:49:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:03,969 INFO L93 Difference]: Finished difference Result 1139 states and 1668 transitions. [2025-02-05 15:49:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:03,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2025-02-05 15:49:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:03,974 INFO L225 Difference]: With dead ends: 1139 [2025-02-05 15:49:03,974 INFO L226 Difference]: Without dead ends: 591 [2025-02-05 15:49:03,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:03,977 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 804 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:03,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 868 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:49:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-02-05 15:49:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-02-05 15:49:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 443 states have (on average 1.4537246049661399) internal successors, (644), 454 states have internal predecessors, (644), 103 states have call successors, (103), 44 states have call predecessors, (103), 44 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 15:49:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 849 transitions. [2025-02-05 15:49:04,056 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 849 transitions. Word has length 157 [2025-02-05 15:49:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:04,056 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 849 transitions. [2025-02-05 15:49:04,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:49:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 849 transitions. [2025-02-05 15:49:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 15:49:04,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:04,059 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:04,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:49:04,060 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:04,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:04,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1578270728, now seen corresponding path program 1 times [2025-02-05 15:49:04,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:04,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996091235] [2025-02-05 15:49:04,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:04,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:04,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:49:04,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:49:04,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:04,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 15:49:04,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:04,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996091235] [2025-02-05 15:49:04,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996091235] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:49:04,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065313681] [2025-02-05 15:49:04,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:04,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:49:04,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:49:04,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:49:04,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:49:04,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:49:04,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:49:04,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:04,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:04,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1384 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:49:04,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:49:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:49:05,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:49:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065313681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:05,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:49:05,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:49:05,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336081824] [2025-02-05 15:49:05,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:05,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:05,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:05,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:49:05,026 INFO L87 Difference]: Start difference. First operand 591 states and 849 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:05,086 INFO L93 Difference]: Finished difference Result 917 states and 1299 transitions. [2025-02-05 15:49:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:05,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 168 [2025-02-05 15:49:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:05,093 INFO L225 Difference]: With dead ends: 917 [2025-02-05 15:49:05,093 INFO L226 Difference]: Without dead ends: 593 [2025-02-05 15:49:05,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:49:05,097 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:05,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1690 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-02-05 15:49:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-02-05 15:49:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 445 states have (on average 1.451685393258427) internal successors, (646), 456 states have internal predecessors, (646), 103 states have call successors, (103), 44 states have call predecessors, (103), 44 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 15:49:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 851 transitions. [2025-02-05 15:49:05,141 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 851 transitions. Word has length 168 [2025-02-05 15:49:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:05,142 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 851 transitions. [2025-02-05 15:49:05,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 851 transitions. [2025-02-05 15:49:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 15:49:05,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:05,146 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:05,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:49:05,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:49:05,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:05,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:05,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1807429373, now seen corresponding path program 1 times [2025-02-05 15:49:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:05,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899020871] [2025-02-05 15:49:05,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:05,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 15:49:05,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 15:49:05,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:05,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-05 15:49:06,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899020871] [2025-02-05 15:49:06,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899020871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:49:06,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661738353] [2025-02-05 15:49:06,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:06,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:49:06,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:49:06,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:49:06,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:49:06,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 15:49:06,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 15:49:06,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:06,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:06,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:49:06,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:49:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:49:06,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:49:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661738353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:06,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:49:06,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:49:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313911796] [2025-02-05 15:49:06,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:06,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:06,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:06,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:49:06,708 INFO L87 Difference]: Start difference. First operand 593 states and 851 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:06,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:06,780 INFO L93 Difference]: Finished difference Result 1205 states and 1762 transitions. [2025-02-05 15:49:06,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:06,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2025-02-05 15:49:06,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:06,786 INFO L225 Difference]: With dead ends: 1205 [2025-02-05 15:49:06,786 INFO L226 Difference]: Without dead ends: 690 [2025-02-05 15:49:06,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:49:06,803 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 165 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:06,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1659 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-02-05 15:49:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 682. [2025-02-05 15:49:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 520 states have (on average 1.4673076923076922) internal successors, (763), 531 states have internal predecessors, (763), 117 states have call successors, (117), 44 states have call predecessors, (117), 44 states have return successors, (116), 115 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-05 15:49:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 996 transitions. [2025-02-05 15:49:06,906 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 996 transitions. Word has length 175 [2025-02-05 15:49:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:06,906 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 996 transitions. [2025-02-05 15:49:06,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 996 transitions. [2025-02-05 15:49:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 15:49:06,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:06,910 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:06,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:49:07,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:49:07,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:07,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1223846041, now seen corresponding path program 1 times [2025-02-05 15:49:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:07,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494085252] [2025-02-05 15:49:07,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:07,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:07,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 15:49:07,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 15:49:07,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:07,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:07,532 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-05 15:49:07,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:07,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494085252] [2025-02-05 15:49:07,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494085252] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:49:07,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188749213] [2025-02-05 15:49:07,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:07,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:49:07,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:49:07,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:49:07,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:49:07,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 15:49:07,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 15:49:07,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:07,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:07,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:49:08,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:49:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 15:49:08,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:49:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188749213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:49:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-02-05 15:49:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544448473] [2025-02-05 15:49:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:08,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:49:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:08,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:49:08,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:49:08,125 INFO L87 Difference]: Start difference. First operand 682 states and 996 transitions. Second operand has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:49:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:08,287 INFO L93 Difference]: Finished difference Result 1311 states and 1929 transitions. [2025-02-05 15:49:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:49:08,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 183 [2025-02-05 15:49:08,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:08,295 INFO L225 Difference]: With dead ends: 1311 [2025-02-05 15:49:08,295 INFO L226 Difference]: Without dead ends: 684 [2025-02-05 15:49:08,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:49:08,299 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 4 mSDsluCounter, 4999 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5835 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:08,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5835 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:49:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-02-05 15:49:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2025-02-05 15:49:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 533 states have internal predecessors, (764), 117 states have call successors, (117), 44 states have call predecessors, (117), 45 states have return successors, (118), 115 states have call predecessors, (118), 116 states have call successors, (118) [2025-02-05 15:49:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 999 transitions. [2025-02-05 15:49:08,340 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 999 transitions. Word has length 183 [2025-02-05 15:49:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:08,342 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 999 transitions. [2025-02-05 15:49:08,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:49:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 999 transitions. [2025-02-05 15:49:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 15:49:08,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:08,346 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:08,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:49:08,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:49:08,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:08,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:08,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1255924977, now seen corresponding path program 1 times [2025-02-05 15:49:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:08,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744064194] [2025-02-05 15:49:08,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:08,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 15:49:08,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 15:49:08,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:08,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 15:49:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744064194] [2025-02-05 15:49:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744064194] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:49:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15230824] [2025-02-05 15:49:09,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:09,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:49:09,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:49:09,090 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:49:09,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:49:09,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 15:49:09,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 15:49:09,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:09,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:09,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:49:09,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:49:09,667 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 15:49:09,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:49:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15230824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:09,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:49:09,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 15:49:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293032169] [2025-02-05 15:49:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:09,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:49:09,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:09,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:49:09,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:49:09,669 INFO L87 Difference]: Start difference. First operand 684 states and 999 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-05 15:49:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:09,774 INFO L93 Difference]: Finished difference Result 1312 states and 1933 transitions. [2025-02-05 15:49:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:49:09,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 177 [2025-02-05 15:49:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:09,780 INFO L225 Difference]: With dead ends: 1312 [2025-02-05 15:49:09,780 INFO L226 Difference]: Without dead ends: 686 [2025-02-05 15:49:09,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:49:09,784 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 2 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:09,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4163 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-02-05 15:49:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-02-05 15:49:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 522 states have (on average 1.4655172413793103) internal successors, (765), 535 states have internal predecessors, (765), 117 states have call successors, (117), 44 states have call predecessors, (117), 46 states have return successors, (123), 115 states have call predecessors, (123), 116 states have call successors, (123) [2025-02-05 15:49:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1005 transitions. [2025-02-05 15:49:09,833 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1005 transitions. Word has length 177 [2025-02-05 15:49:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:09,835 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1005 transitions. [2025-02-05 15:49:09,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-05 15:49:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1005 transitions. [2025-02-05 15:49:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 15:49:09,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:09,840 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:09,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:49:10,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-05 15:49:10,043 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:10,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash -58571882, now seen corresponding path program 1 times [2025-02-05 15:49:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:10,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875593100] [2025-02-05 15:49:10,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:10,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:10,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 15:49:10,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 15:49:10,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:10,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-05 15:49:10,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:10,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875593100] [2025-02-05 15:49:10,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875593100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:10,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:10,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:49:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325879105] [2025-02-05 15:49:10,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:10,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:49:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:10,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:49:10,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:49:10,539 INFO L87 Difference]: Start difference. First operand 686 states and 1005 transitions. Second operand has 8 states, 6 states have (on average 17.0) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:49:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:10,727 INFO L93 Difference]: Finished difference Result 1300 states and 1920 transitions. [2025-02-05 15:49:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:49:10,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.0) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 178 [2025-02-05 15:49:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:10,734 INFO L225 Difference]: With dead ends: 1300 [2025-02-05 15:49:10,735 INFO L226 Difference]: Without dead ends: 686 [2025-02-05 15:49:10,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:49:10,738 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 4 mSDsluCounter, 5005 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5842 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:10,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5842 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:49:10,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-02-05 15:49:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-02-05 15:49:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 522 states have (on average 1.4655172413793103) internal successors, (765), 535 states have internal predecessors, (765), 117 states have call successors, (117), 44 states have call predecessors, (117), 46 states have return successors, (122), 115 states have call predecessors, (122), 116 states have call successors, (122) [2025-02-05 15:49:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1004 transitions. [2025-02-05 15:49:10,783 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1004 transitions. Word has length 178 [2025-02-05 15:49:10,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:10,784 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1004 transitions. [2025-02-05 15:49:10,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.0) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:49:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1004 transitions. [2025-02-05 15:49:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-05 15:49:10,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:10,788 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:10,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:49:10,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:10,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash -824215950, now seen corresponding path program 1 times [2025-02-05 15:49:10,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:10,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129015059] [2025-02-05 15:49:10,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:10,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:10,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 15:49:10,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 15:49:10,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:10,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-05 15:49:11,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:11,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129015059] [2025-02-05 15:49:11,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129015059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:11,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:11,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:49:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421858084] [2025-02-05 15:49:11,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:11,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:49:11,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:11,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:49:11,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:49:11,158 INFO L87 Difference]: Start difference. First operand 686 states and 1004 transitions. Second operand has 8 states, 6 states have (on average 18.0) internal successors, (108), 8 states have internal predecessors, (108), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:49:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:11,367 INFO L93 Difference]: Finished difference Result 1302 states and 1923 transitions. [2025-02-05 15:49:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:49:11,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 18.0) internal successors, (108), 8 states have internal predecessors, (108), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 186 [2025-02-05 15:49:11,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:11,382 INFO L225 Difference]: With dead ends: 1302 [2025-02-05 15:49:11,383 INFO L226 Difference]: Without dead ends: 688 [2025-02-05 15:49:11,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:49:11,391 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 3 mSDsluCounter, 5010 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5848 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:11,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5848 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:49:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-02-05 15:49:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-02-05 15:49:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 523 states have (on average 1.4646271510516253) internal successors, (766), 537 states have internal predecessors, (766), 117 states have call successors, (117), 44 states have call predecessors, (117), 47 states have return successors, (124), 115 states have call predecessors, (124), 116 states have call successors, (124) [2025-02-05 15:49:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1007 transitions. [2025-02-05 15:49:11,507 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1007 transitions. Word has length 186 [2025-02-05 15:49:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:11,510 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1007 transitions. [2025-02-05 15:49:11,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 18.0) internal successors, (108), 8 states have internal predecessors, (108), 4 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 15:49:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1007 transitions. [2025-02-05 15:49:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 15:49:11,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:11,524 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:11,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:49:11,524 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:11,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1027945901, now seen corresponding path program 1 times [2025-02-05 15:49:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:11,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469051201] [2025-02-05 15:49:11,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:11,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 15:49:11,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 15:49:11,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:11,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 15:49:11,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469051201] [2025-02-05 15:49:11,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469051201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:11,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:11,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:49:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785182141] [2025-02-05 15:49:11,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:11,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:49:11,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:11,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:49:11,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:49:11,980 INFO L87 Difference]: Start difference. First operand 688 states and 1007 transitions. Second operand has 9 states, 7 states have (on average 15.285714285714286) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:49:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:12,286 INFO L93 Difference]: Finished difference Result 1299 states and 1917 transitions. [2025-02-05 15:49:12,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:49:12,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 15.285714285714286) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 180 [2025-02-05 15:49:12,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:12,296 INFO L225 Difference]: With dead ends: 1299 [2025-02-05 15:49:12,297 INFO L226 Difference]: Without dead ends: 688 [2025-02-05 15:49:12,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:49:12,300 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 7 mSDsluCounter, 5780 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6610 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:12,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6610 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:49:12,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-02-05 15:49:12,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-02-05 15:49:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 523 states have (on average 1.4646271510516253) internal successors, (766), 537 states have internal predecessors, (766), 117 states have call successors, (117), 44 states have call predecessors, (117), 47 states have return successors, (123), 115 states have call predecessors, (123), 116 states have call successors, (123) [2025-02-05 15:49:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1006 transitions. [2025-02-05 15:49:12,377 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1006 transitions. Word has length 180 [2025-02-05 15:49:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:12,378 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1006 transitions. [2025-02-05 15:49:12,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 15.285714285714286) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:49:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1006 transitions. [2025-02-05 15:49:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 15:49:12,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:12,383 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:12,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:49:12,383 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:12,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:12,384 INFO L85 PathProgramCache]: Analyzing trace with hash 598164754, now seen corresponding path program 2 times [2025-02-05 15:49:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:12,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639905720] [2025-02-05 15:49:12,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:49:12,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:12,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes. [2025-02-05 15:49:12,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 15:49:12,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:49:12,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:12,859 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 15:49:12,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:12,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639905720] [2025-02-05 15:49:12,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639905720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:12,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:12,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:49:12,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269695732] [2025-02-05 15:49:12,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:12,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:49:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:12,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:49:12,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:49:12,864 INFO L87 Difference]: Start difference. First operand 688 states and 1006 transitions. Second operand has 8 states, 6 states have (on average 17.5) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:49:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:13,031 INFO L93 Difference]: Finished difference Result 1301 states and 1923 transitions. [2025-02-05 15:49:13,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:49:13,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.5) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 181 [2025-02-05 15:49:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:13,039 INFO L225 Difference]: With dead ends: 1301 [2025-02-05 15:49:13,039 INFO L226 Difference]: Without dead ends: 690 [2025-02-05 15:49:13,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:49:13,042 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 1 mSDsluCounter, 4167 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5005 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:13,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5005 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:49:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-02-05 15:49:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2025-02-05 15:49:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 524 states have (on average 1.463740458015267) internal successors, (767), 539 states have internal predecessors, (767), 117 states have call successors, (117), 44 states have call predecessors, (117), 48 states have return successors, (128), 115 states have call predecessors, (128), 116 states have call successors, (128) [2025-02-05 15:49:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1012 transitions. [2025-02-05 15:49:13,087 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1012 transitions. Word has length 181 [2025-02-05 15:49:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:13,088 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1012 transitions. [2025-02-05 15:49:13,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.5) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:49:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1012 transitions. [2025-02-05 15:49:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 15:49:13,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:13,092 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:13,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:49:13,092 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:13,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash 964689399, now seen corresponding path program 1 times [2025-02-05 15:49:13,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:13,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497169675] [2025-02-05 15:49:13,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:13,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:13,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:49:13,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:49:13,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:13,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 15:49:13,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:13,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497169675] [2025-02-05 15:49:13,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497169675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:13,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:13,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:49:13,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783392057] [2025-02-05 15:49:13,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:13,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:49:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:13,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:49:13,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:49:13,584 INFO L87 Difference]: Start difference. First operand 690 states and 1012 transitions. Second operand has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-05 15:49:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:13,740 INFO L93 Difference]: Finished difference Result 1305 states and 1933 transitions. [2025-02-05 15:49:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:49:13,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 182 [2025-02-05 15:49:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:13,749 INFO L225 Difference]: With dead ends: 1305 [2025-02-05 15:49:13,749 INFO L226 Difference]: Without dead ends: 692 [2025-02-05 15:49:13,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:49:13,757 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 0 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:13,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4163 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:49:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-02-05 15:49:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2025-02-05 15:49:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 524 states have (on average 1.463740458015267) internal successors, (767), 539 states have internal predecessors, (767), 117 states have call successors, (117), 44 states have call predecessors, (117), 48 states have return successors, (128), 115 states have call predecessors, (128), 116 states have call successors, (128) [2025-02-05 15:49:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1012 transitions. [2025-02-05 15:49:13,819 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1012 transitions. Word has length 182 [2025-02-05 15:49:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:13,820 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1012 transitions. [2025-02-05 15:49:13,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.2) internal successors, (106), 6 states have internal predecessors, (106), 3 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-05 15:49:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1012 transitions. [2025-02-05 15:49:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 15:49:13,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:13,824 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:13,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:49:13,825 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:13,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1920210678, now seen corresponding path program 1 times [2025-02-05 15:49:13,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:13,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962237025] [2025-02-05 15:49:13,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:13,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:13,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:49:13,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:49:13,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:13,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:14,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:14,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962237025] [2025-02-05 15:49:14,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962237025] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:49:14,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830536165] [2025-02-05 15:49:14,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:14,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:49:14,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:49:14,252 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:49:14,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:49:14,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:49:15,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:49:15,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:15,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:15,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:49:15,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:49:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:15,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:49:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830536165] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:49:15,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:49:15,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:49:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98023775] [2025-02-05 15:49:15,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:49:15,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:49:15,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:15,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:49:15,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:49:15,404 INFO L87 Difference]: Start difference. First operand 690 states and 1012 transitions. Second operand has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:49:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:15,678 INFO L93 Difference]: Finished difference Result 1572 states and 2379 transitions. [2025-02-05 15:49:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:49:15,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 182 [2025-02-05 15:49:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:15,690 INFO L225 Difference]: With dead ends: 1572 [2025-02-05 15:49:15,690 INFO L226 Difference]: Without dead ends: 1248 [2025-02-05 15:49:15,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:49:15,694 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 637 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3699 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:15,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 3699 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:49:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2025-02-05 15:49:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1224. [2025-02-05 15:49:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 979 states have (on average 1.5178753830439224) internal successors, (1486), 994 states have internal predecessors, (1486), 196 states have call successors, (196), 44 states have call predecessors, (196), 48 states have return successors, (217), 194 states have call predecessors, (217), 195 states have call successors, (217) [2025-02-05 15:49:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1899 transitions. [2025-02-05 15:49:15,784 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1899 transitions. Word has length 182 [2025-02-05 15:49:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:15,785 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1899 transitions. [2025-02-05 15:49:15,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.142857142857142) internal successors, (134), 7 states have internal predecessors, (134), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:49:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1899 transitions. [2025-02-05 15:49:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 15:49:15,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:15,801 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:15,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:49:16,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:49:16,002 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash -811118716, now seen corresponding path program 1 times [2025-02-05 15:49:16,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:16,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041614549] [2025-02-05 15:49:16,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:16,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 15:49:16,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 15:49:16,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:16,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:16,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:16,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041614549] [2025-02-05 15:49:16,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041614549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:16,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:16,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:16,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349094198] [2025-02-05 15:49:16,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:16,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:16,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:16,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:16,102 INFO L87 Difference]: Start difference. First operand 1224 states and 1899 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:49:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:16,169 INFO L93 Difference]: Finished difference Result 2819 states and 4444 transitions. [2025-02-05 15:49:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:16,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 193 [2025-02-05 15:49:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:16,184 INFO L225 Difference]: With dead ends: 2819 [2025-02-05 15:49:16,185 INFO L226 Difference]: Without dead ends: 1728 [2025-02-05 15:49:16,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:16,191 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 163 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:16,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1699 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-02-05 15:49:16,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1720. [2025-02-05 15:49:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1396 states have (on average 1.5308022922636104) internal successors, (2137), 1411 states have internal predecessors, (2137), 275 states have call successors, (275), 44 states have call predecessors, (275), 48 states have return successors, (306), 273 states have call predecessors, (306), 274 states have call successors, (306) [2025-02-05 15:49:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2718 transitions. [2025-02-05 15:49:16,336 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2718 transitions. Word has length 193 [2025-02-05 15:49:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:16,339 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2718 transitions. [2025-02-05 15:49:16,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:49:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2718 transitions. [2025-02-05 15:49:16,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 15:49:16,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:16,350 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:16,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:49:16,350 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:16,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1441397484, now seen corresponding path program 1 times [2025-02-05 15:49:16,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:16,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77119633] [2025-02-05 15:49:16,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:16,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 15:49:16,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 15:49:16,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:16,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:16,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:16,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77119633] [2025-02-05 15:49:16,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77119633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:16,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:16,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:16,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355399238] [2025-02-05 15:49:16,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:16,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:16,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:16,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:16,443 INFO L87 Difference]: Start difference. First operand 1720 states and 2718 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:49:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:16,542 INFO L93 Difference]: Finished difference Result 4055 states and 6474 transitions. [2025-02-05 15:49:16,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:16,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 194 [2025-02-05 15:49:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:16,562 INFO L225 Difference]: With dead ends: 4055 [2025-02-05 15:49:16,562 INFO L226 Difference]: Without dead ends: 2529 [2025-02-05 15:49:16,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:16,571 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 161 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:16,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1688 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2529 states. [2025-02-05 15:49:16,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2529 to 2521. [2025-02-05 15:49:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2521 states, 2078 states have (on average 1.5442733397497594) internal successors, (3209), 2093 states have internal predecessors, (3209), 394 states have call successors, (394), 44 states have call predecessors, (394), 48 states have return successors, (425), 392 states have call predecessors, (425), 393 states have call successors, (425) [2025-02-05 15:49:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 4028 transitions. [2025-02-05 15:49:16,711 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 4028 transitions. Word has length 194 [2025-02-05 15:49:16,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:16,711 INFO L471 AbstractCegarLoop]: Abstraction has 2521 states and 4028 transitions. [2025-02-05 15:49:16,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:49:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 4028 transitions. [2025-02-05 15:49:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 15:49:16,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:16,725 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:16,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:49:16,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:16,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:16,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2104049699, now seen corresponding path program 1 times [2025-02-05 15:49:16,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:16,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175371860] [2025-02-05 15:49:16,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:16,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:16,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 15:49:16,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 15:49:16,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:16,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:16,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:16,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175371860] [2025-02-05 15:49:16,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175371860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:16,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096491520] [2025-02-05 15:49:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:16,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:16,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:16,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:16,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:16,890 INFO L87 Difference]: Start difference. First operand 2521 states and 4028 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:49:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:17,239 INFO L93 Difference]: Finished difference Result 5936 states and 9579 transitions. [2025-02-05 15:49:17,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:17,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 195 [2025-02-05 15:49:17,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:17,298 INFO L225 Difference]: With dead ends: 5936 [2025-02-05 15:49:17,301 INFO L226 Difference]: Without dead ends: 3763 [2025-02-05 15:49:17,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:17,321 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 159 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:17,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1681 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3763 states. [2025-02-05 15:49:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3763 to 3755. [2025-02-05 15:49:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3150 states have (on average 1.5555555555555556) internal successors, (4900), 3165 states have internal predecessors, (4900), 556 states have call successors, (556), 44 states have call predecessors, (556), 48 states have return successors, (603), 554 states have call predecessors, (603), 555 states have call successors, (603) [2025-02-05 15:49:17,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 6059 transitions. [2025-02-05 15:49:17,588 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 6059 transitions. Word has length 195 [2025-02-05 15:49:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:17,589 INFO L471 AbstractCegarLoop]: Abstraction has 3755 states and 6059 transitions. [2025-02-05 15:49:17,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:49:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 6059 transitions. [2025-02-05 15:49:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 15:49:17,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:17,606 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:17,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:49:17,606 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:17,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:17,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2070671778, now seen corresponding path program 1 times [2025-02-05 15:49:17,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:17,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986234532] [2025-02-05 15:49:17,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:17,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:17,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 15:49:17,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 15:49:17,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:17,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:17,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:17,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986234532] [2025-02-05 15:49:17,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986234532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:17,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:17,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:17,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962831481] [2025-02-05 15:49:17,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:17,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:17,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:17,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:17,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:17,745 INFO L87 Difference]: Start difference. First operand 3755 states and 6059 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:17,934 INFO L93 Difference]: Finished difference Result 8907 states and 14500 transitions. [2025-02-05 15:49:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:17,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 189 [2025-02-05 15:49:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:17,971 INFO L225 Difference]: With dead ends: 8907 [2025-02-05 15:49:17,971 INFO L226 Difference]: Without dead ends: 5755 [2025-02-05 15:49:17,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:17,984 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 157 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:17,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1681 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5755 states. [2025-02-05 15:49:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5755 to 5747. [2025-02-05 15:49:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5747 states, 4897 states have (on average 1.5650398202981417) internal successors, (7664), 4912 states have internal predecessors, (7664), 801 states have call successors, (801), 44 states have call predecessors, (801), 48 states have return successors, (874), 799 states have call predecessors, (874), 800 states have call successors, (874) [2025-02-05 15:49:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 9339 transitions. [2025-02-05 15:49:18,257 INFO L78 Accepts]: Start accepts. Automaton has 5747 states and 9339 transitions. Word has length 189 [2025-02-05 15:49:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:18,258 INFO L471 AbstractCegarLoop]: Abstraction has 5747 states and 9339 transitions. [2025-02-05 15:49:18,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 5747 states and 9339 transitions. [2025-02-05 15:49:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 15:49:18,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:18,276 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:18,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:49:18,277 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:18,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:18,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1440447245, now seen corresponding path program 1 times [2025-02-05 15:49:18,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:18,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027001758] [2025-02-05 15:49:18,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:18,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:18,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 15:49:18,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 15:49:18,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:18,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:18,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027001758] [2025-02-05 15:49:18,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027001758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:18,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:18,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:18,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754103588] [2025-02-05 15:49:18,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:18,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:18,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:18,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:18,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:18,356 INFO L87 Difference]: Start difference. First operand 5747 states and 9339 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:18,609 INFO L93 Difference]: Finished difference Result 13844 states and 22642 transitions. [2025-02-05 15:49:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:18,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-02-05 15:49:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:18,675 INFO L225 Difference]: With dead ends: 13844 [2025-02-05 15:49:18,675 INFO L226 Difference]: Without dead ends: 9091 [2025-02-05 15:49:18,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:18,697 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 155 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:18,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1690 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:18,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2025-02-05 15:49:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 9083. [2025-02-05 15:49:19,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9083 states, 7740 states have (on average 1.5631782945736434) internal successors, (12099), 7755 states have internal predecessors, (12099), 1294 states have call successors, (1294), 44 states have call predecessors, (1294), 48 states have return successors, (1411), 1292 states have call predecessors, (1411), 1293 states have call successors, (1411) [2025-02-05 15:49:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9083 states to 9083 states and 14804 transitions. [2025-02-05 15:49:19,152 INFO L78 Accepts]: Start accepts. Automaton has 9083 states and 14804 transitions. Word has length 190 [2025-02-05 15:49:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:19,152 INFO L471 AbstractCegarLoop]: Abstraction has 9083 states and 14804 transitions. [2025-02-05 15:49:19,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 9083 states and 14804 transitions. [2025-02-05 15:49:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 15:49:19,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:19,176 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:19,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:49:19,176 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:19,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:19,176 INFO L85 PathProgramCache]: Analyzing trace with hash 326263809, now seen corresponding path program 1 times [2025-02-05 15:49:19,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:19,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95545661] [2025-02-05 15:49:19,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:19,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:19,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 15:49:19,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 15:49:19,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:19,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:19,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95545661] [2025-02-05 15:49:19,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95545661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:19,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:19,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:19,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885565617] [2025-02-05 15:49:19,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:19,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:19,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:19,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:19,256 INFO L87 Difference]: Start difference. First operand 9083 states and 14804 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:19,944 INFO L93 Difference]: Finished difference Result 22692 states and 37302 transitions. [2025-02-05 15:49:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:19,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-02-05 15:49:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:20,088 INFO L225 Difference]: With dead ends: 22692 [2025-02-05 15:49:20,089 INFO L226 Difference]: Without dead ends: 15093 [2025-02-05 15:49:20,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:20,146 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 153 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:20,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1684 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15093 states. [2025-02-05 15:49:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15093 to 15085. [2025-02-05 15:49:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15085 states, 12920 states have (on average 1.5695820433436531) internal successors, (20279), 12935 states have internal predecessors, (20279), 2116 states have call successors, (2116), 44 states have call predecessors, (2116), 48 states have return successors, (2311), 2114 states have call predecessors, (2311), 2115 states have call successors, (2311) [2025-02-05 15:49:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15085 states to 15085 states and 24706 transitions. [2025-02-05 15:49:20,886 INFO L78 Accepts]: Start accepts. Automaton has 15085 states and 24706 transitions. Word has length 191 [2025-02-05 15:49:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:20,886 INFO L471 AbstractCegarLoop]: Abstraction has 15085 states and 24706 transitions. [2025-02-05 15:49:20,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 15085 states and 24706 transitions. [2025-02-05 15:49:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 15:49:20,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:20,915 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:20,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:49:20,915 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:20,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:20,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1790479807, now seen corresponding path program 1 times [2025-02-05 15:49:20,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:20,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960065015] [2025-02-05 15:49:20,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:20,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:20,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 15:49:20,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 15:49:20,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:20,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:20,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:20,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960065015] [2025-02-05 15:49:20,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960065015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:20,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:20,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:20,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872960585] [2025-02-05 15:49:20,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:20,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:20,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:20,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:20,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:20,994 INFO L87 Difference]: Start difference. First operand 15085 states and 24706 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:49:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:21,578 INFO L93 Difference]: Finished difference Result 36299 states and 59203 transitions. [2025-02-05 15:49:21,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:21,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 199 [2025-02-05 15:49:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:21,694 INFO L225 Difference]: With dead ends: 36299 [2025-02-05 15:49:21,694 INFO L226 Difference]: Without dead ends: 23825 [2025-02-05 15:49:21,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:21,750 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 151 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:21,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1673 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23825 states. [2025-02-05 15:49:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23825 to 23817. [2025-02-05 15:49:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23817 states, 20449 states have (on average 1.543351753141963) internal successors, (31560), 20464 states have internal predecessors, (31560), 3319 states have call successors, (3319), 44 states have call predecessors, (3319), 48 states have return successors, (3658), 3317 states have call predecessors, (3658), 3318 states have call successors, (3658) [2025-02-05 15:49:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23817 states to 23817 states and 38537 transitions. [2025-02-05 15:49:23,384 INFO L78 Accepts]: Start accepts. Automaton has 23817 states and 38537 transitions. Word has length 199 [2025-02-05 15:49:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:23,385 INFO L471 AbstractCegarLoop]: Abstraction has 23817 states and 38537 transitions. [2025-02-05 15:49:23,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:49:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 23817 states and 38537 transitions. [2025-02-05 15:49:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 15:49:23,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:23,434 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:23,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:49:23,434 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:23,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash 971314272, now seen corresponding path program 1 times [2025-02-05 15:49:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351468175] [2025-02-05 15:49:23,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:23,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 15:49:23,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 15:49:23,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:23,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:23,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:23,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351468175] [2025-02-05 15:49:23,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351468175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:23,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:23,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:23,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539735163] [2025-02-05 15:49:23,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:23,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:23,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:23,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:23,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:23,536 INFO L87 Difference]: Start difference. First operand 23817 states and 38537 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:24,936 INFO L93 Difference]: Finished difference Result 62757 states and 101956 transitions. [2025-02-05 15:49:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:24,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 193 [2025-02-05 15:49:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:25,137 INFO L225 Difference]: With dead ends: 62757 [2025-02-05 15:49:25,138 INFO L226 Difference]: Without dead ends: 42355 [2025-02-05 15:49:25,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:25,195 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 149 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:25,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1685 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42355 states. [2025-02-05 15:49:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42355 to 42347. [2025-02-05 15:49:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42347 states, 36529 states have (on average 1.5438145035451285) internal successors, (56394), 36544 states have internal predecessors, (56394), 5769 states have call successors, (5769), 44 states have call predecessors, (5769), 48 states have return successors, (6382), 5767 states have call predecessors, (6382), 5768 states have call successors, (6382) [2025-02-05 15:49:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42347 states to 42347 states and 68545 transitions. [2025-02-05 15:49:26,886 INFO L78 Accepts]: Start accepts. Automaton has 42347 states and 68545 transitions. Word has length 193 [2025-02-05 15:49:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:26,886 INFO L471 AbstractCegarLoop]: Abstraction has 42347 states and 68545 transitions. [2025-02-05 15:49:26,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 42347 states and 68545 transitions. [2025-02-05 15:49:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 15:49:26,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:26,927 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:26,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:49:26,929 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:26,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1350594191, now seen corresponding path program 1 times [2025-02-05 15:49:26,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119009550] [2025-02-05 15:49:26,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:26,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:26,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 15:49:26,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 15:49:26,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:26,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119009550] [2025-02-05 15:49:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119009550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:27,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:27,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502103042] [2025-02-05 15:49:27,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:27,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:27,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:27,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:27,016 INFO L87 Difference]: Start difference. First operand 42347 states and 68545 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:29,708 INFO L93 Difference]: Finished difference Result 114639 states and 186598 transitions. [2025-02-05 15:49:29,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:29,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 194 [2025-02-05 15:49:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:30,133 INFO L225 Difference]: With dead ends: 114639 [2025-02-05 15:49:30,133 INFO L226 Difference]: Without dead ends: 76874 [2025-02-05 15:49:30,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:30,396 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 147 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:30,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1693 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:49:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76874 states. [2025-02-05 15:49:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76874 to 76866. [2025-02-05 15:49:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76866 states, 66535 states have (on average 1.547952205606072) internal successors, (102993), 66550 states have internal predecessors, (102993), 10282 states have call successors, (10282), 44 states have call predecessors, (10282), 48 states have return successors, (11427), 10280 states have call predecessors, (11427), 10281 states have call successors, (11427) [2025-02-05 15:49:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76866 states to 76866 states and 124702 transitions. [2025-02-05 15:49:33,568 INFO L78 Accepts]: Start accepts. Automaton has 76866 states and 124702 transitions. Word has length 194 [2025-02-05 15:49:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:33,568 INFO L471 AbstractCegarLoop]: Abstraction has 76866 states and 124702 transitions. [2025-02-05 15:49:33,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 76866 states and 124702 transitions. [2025-02-05 15:49:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 15:49:33,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:33,604 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:33,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 15:49:33,605 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:33,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1928312481, now seen corresponding path program 1 times [2025-02-05 15:49:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:33,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082353643] [2025-02-05 15:49:33,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:33,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 15:49:33,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 15:49:33,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:33,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:33,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:33,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082353643] [2025-02-05 15:49:33,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082353643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:33,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:33,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:49:33,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675271549] [2025-02-05 15:49:33,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:33,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:49:33,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:33,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:49:33,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:33,686 INFO L87 Difference]: Start difference. First operand 76866 states and 124702 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:36,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:36,854 INFO L93 Difference]: Finished difference Result 143590 states and 233780 transitions. [2025-02-05 15:49:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:49:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 195 [2025-02-05 15:49:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:37,586 INFO L225 Difference]: With dead ends: 143590 [2025-02-05 15:49:37,586 INFO L226 Difference]: Without dead ends: 143266 [2025-02-05 15:49:37,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:49:37,666 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 141 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1692 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.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:37,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1692 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:49:37,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143266 states. [2025-02-05 15:49:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143266 to 143258. [2025-02-05 15:49:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143258 states, 124559 states have (on average 1.5473871819780185) internal successors, (192741), 124574 states have internal predecessors, (192741), 18650 states have call successors, (18650), 44 states have call predecessors, (18650), 48 states have return successors, (20841), 18648 states have call predecessors, (20841), 18649 states have call successors, (20841) [2025-02-05 15:49:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143258 states to 143258 states and 232232 transitions. [2025-02-05 15:49:44,633 INFO L78 Accepts]: Start accepts. Automaton has 143258 states and 232232 transitions. Word has length 195 [2025-02-05 15:49:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:44,634 INFO L471 AbstractCegarLoop]: Abstraction has 143258 states and 232232 transitions. [2025-02-05 15:49:44,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:49:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 143258 states and 232232 transitions. [2025-02-05 15:49:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 15:49:44,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:44,682 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:44,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 15:49:44,682 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:44,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash 339899152, now seen corresponding path program 1 times [2025-02-05 15:49:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:44,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835843214] [2025-02-05 15:49:44,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:44,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 15:49:44,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 15:49:44,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:44,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-05 15:49:45,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:45,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835843214] [2025-02-05 15:49:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835843214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:45,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:45,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 15:49:45,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916018175] [2025-02-05 15:49:45,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:45,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:49:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:45,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:49:45,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:49:45,293 INFO L87 Difference]: Start difference. First operand 143258 states and 232232 transitions. Second operand has 14 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 7 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) [2025-02-05 15:49:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:55,286 INFO L93 Difference]: Finished difference Result 285508 states and 468321 transitions. [2025-02-05 15:49:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 15:49:55,287 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 7 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (23), 7 states have call predecessors, (23), 7 states have call successors, (23) Word has length 196 [2025-02-05 15:49:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:57,108 INFO L225 Difference]: With dead ends: 285508 [2025-02-05 15:49:57,109 INFO L226 Difference]: Without dead ends: 285190 [2025-02-05 15:49:57,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-02-05 15:49:57,258 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 2102 mSDsluCounter, 9879 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 10884 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:57,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 10884 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2260 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 15:49:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285190 states.