./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_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_spec6_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 c86855dab8667fe80df418e2dda62d52081f1a657b6492a63fb3d2a1da4890b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:47:03,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:47:03,601 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:47:03,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:47:03,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:47:03,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:47:03,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:47:03,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:47:03,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:47:03,620 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:47:03,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:47:03,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:47:03,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:47:03,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:47:03,620 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:47:03,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:47:03,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:47:03,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:47:03,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:47:03,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:47:03,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:47:03,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:47:03,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:47:03,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:47:03,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:47:03,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:47:03,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:47:03,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:47:03,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:47:03,622 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 -> c86855dab8667fe80df418e2dda62d52081f1a657b6492a63fb3d2a1da4890b5 [2025-02-05 15:47:03,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:47:03,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:47:03,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:47:03,858 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:47:03,859 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:47:03,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_productSimulator.cil.c [2025-02-05 15:47:05,080 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7b406cec/97fa976fb4f34261971e91ffc674b171/FLAGed5a25117 [2025-02-05 15:47:05,456 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:47:05,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_productSimulator.cil.c [2025-02-05 15:47:05,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7b406cec/97fa976fb4f34261971e91ffc674b171/FLAGed5a25117 [2025-02-05 15:47:05,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7b406cec/97fa976fb4f34261971e91ffc674b171 [2025-02-05 15:47:05,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:47:05,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:47:05,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:47:05,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:47:05,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:47:05,510 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:47:05" (1/1) ... [2025-02-05 15:47:05,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd6818d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:05, skipping insertion in model container [2025-02-05 15:47:05,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:47:05" (1/1) ... [2025-02-05 15:47:05,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:47:05,868 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_spec6_productSimulator.cil.c[17001,17014] [2025-02-05 15:47:06,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:47:06,121 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:47:06,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [48] [2025-02-05 15:47:06,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [111] [2025-02-05 15:47:06,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [477] [2025-02-05 15:47:06,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [692] [2025-02-05 15:47:06,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [701] [2025-02-05 15:47:06,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [811] [2025-02-05 15:47:06,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1890] [2025-02-05 15:47:06,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1907] [2025-02-05 15:47:06,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2184] [2025-02-05 15:47:06,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2539] [2025-02-05 15:47:06,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2941] [2025-02-05 15:47:06,154 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_spec6_productSimulator.cil.c[17001,17014] [2025-02-05 15:47:06,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:47:06,225 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:47:06,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06 WrapperNode [2025-02-05 15:47:06,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:47:06,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:47:06,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:47:06,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:47:06,231 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:47:06" (1/1) ... [2025-02-05 15:47:06,250 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:47:06" (1/1) ... [2025-02-05 15:47:06,307 INFO L138 Inliner]: procedures = 152, calls = 268, calls flagged for inlining = 68, calls inlined = 65, statements flattened = 1341 [2025-02-05 15:47:06,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:47:06,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:47:06,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:47:06,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:47:06,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (1/1) ... [2025-02-05 15:47:06,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (1/1) ... [2025-02-05 15:47:06,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (1/1) ... [2025-02-05 15:47:06,366 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:47:06,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (1/1) ... [2025-02-05 15:47:06,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (1/1) ... [2025-02-05 15:47:06,393 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (1/1) ... [2025-02-05 15:47:06,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (1/1) ... [2025-02-05 15:47:06,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (1/1) ... [2025-02-05 15:47:06,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (1/1) ... [2025-02-05 15:47:06,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:47:06,417 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:47:06,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:47:06,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:47:06,418 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (1/1) ... [2025-02-05 15:47:06,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:47:06,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:06,448 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:47:06,451 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:47:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:47:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:47:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-02-05 15:47:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-02-05 15:47:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-02-05 15:47:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-02-05 15:47:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:47:06,484 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:47:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:47:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:47:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:47:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:47:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:47:06,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:47:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-02-05 15:47:06,486 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-02-05 15:47:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:47:06,486 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:47:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:47:06,487 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:47:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-02-05 15:47:06,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-02-05 15:47:06,489 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:47:06,489 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:47:06,489 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:47:06,489 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-02-05 15:47:06,489 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-02-05 15:47:06,489 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:47:06,489 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:47:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:47:06,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:47:06,699 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:47:06,701 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:47:06,764 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: #res := ~retValue_acc~3; [2025-02-05 15:47:06,772 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2848: #res := ~retValue_acc~37; [2025-02-05 15:47:06,780 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3380: #res := ~retValue_acc~44; [2025-02-05 15:47:06,789 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1432: #res := ~retValue_acc~19; [2025-02-05 15:47:06,832 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L976: #res := ~retValue_acc~13; [2025-02-05 15:47:06,855 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2585-1: getEmailId_#res#1 := getEmailId_~retValue_acc~30#1; [2025-02-05 15:47:06,877 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2811: #res := ~retValue_acc~36; [2025-02-05 15:47:06,894 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2659: #res := ~retValue_acc~32; [2025-02-05 15:47:06,958 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L665: #res#1 := ~retValue_acc~5#1; [2025-02-05 15:47:06,958 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L647-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~4#1; [2025-02-05 15:47:07,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1524: #res#1 := ~retValue_acc~21#1; [2025-02-05 15:47:07,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1479-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~20#1; [2025-02-05 15:47:07,093 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1748: #res := ~retValue_acc~24; [2025-02-05 15:47:07,103 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L689-1: createEmail_#res#1 := createEmail_~retValue_acc~7#1; [2025-02-05 15:47:07,108 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2774: #res := ~retValue_acc~35; [2025-02-05 15:47:07,163 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1867-1: getClientId_#res#1 := getClientId_~retValue_acc~26#1; [2025-02-05 15:47:07,246 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2922-1: isVerified_#res#1 := isVerified_~retValue_acc~39#1; [2025-02-05 15:47:07,246 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1820-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~25#1; [2025-02-05 15:47:07,262 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2885: #res := ~retValue_acc~38; [2025-02-05 15:47:07,314 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~8; [2025-02-05 15:47:07,353 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1302: #res := ~retValue_acc~17; [2025-02-05 15:47:07,383 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1385-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~18#1; [2025-02-05 15:47:07,686 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3355-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~43#1; [2025-02-05 15:47:07,686 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1694-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~23#1; [2025-02-05 15:47:07,686 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3346-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~42#1; [2025-02-05 15:47:07,686 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L808-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-02-05 15:47:07,687 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3337-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~41#1; [2025-02-05 15:47:07,687 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1587-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~22#1; [2025-02-05 15:47:07,691 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2622: #res := ~retValue_acc~31; [2025-02-05 15:47:07,854 INFO L? ?]: Removed 631 outVars from TransFormulas that were not future-live. [2025-02-05 15:47:07,854 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:47:07,876 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:47:07,876 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:47:07,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:47:07 BoogieIcfgContainer [2025-02-05 15:47:07,876 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:47:07,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:47:07,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:47:07,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:47:07,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:47:05" (1/3) ... [2025-02-05 15:47:07,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1076f1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:47:07, skipping insertion in model container [2025-02-05 15:47:07,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:47:06" (2/3) ... [2025-02-05 15:47:07,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1076f1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:47:07, skipping insertion in model container [2025-02-05 15:47:07,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:47:07" (3/3) ... [2025-02-05 15:47:07,887 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_productSimulator.cil.c [2025-02-05 15:47:07,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:47:07,914 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_productSimulator.cil.c that has 44 procedures, 607 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:47:08,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:47:08,050 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;@f051c60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:47:08,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:47:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 607 states, 450 states have (on average 1.511111111111111) internal successors, (680), 470 states have internal predecessors, (680), 112 states have call successors, (112), 43 states have call predecessors, (112), 43 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:47:08,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 15:47:08,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:08,086 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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] [2025-02-05 15:47:08,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:08,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:08,095 INFO L85 PathProgramCache]: Analyzing trace with hash -355979650, now seen corresponding path program 1 times [2025-02-05 15:47:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:08,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509856681] [2025-02-05 15:47:08,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:08,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:08,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 15:47:08,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 15:47:08,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:08,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 15:47:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:08,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509856681] [2025-02-05 15:47:08,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509856681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:08,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:08,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:47:08,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323776973] [2025-02-05 15:47:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:08,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:47:08,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:08,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:47:08,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:47:08,492 INFO L87 Difference]: Start difference. First operand has 607 states, 450 states have (on average 1.511111111111111) internal successors, (680), 470 states have internal predecessors, (680), 112 states have call successors, (112), 43 states have call predecessors, (112), 43 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) Second operand has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 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:47:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:08,544 INFO L93 Difference]: Finished difference Result 946 states and 1389 transitions. [2025-02-05 15:47:08,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:47:08,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 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 166 [2025-02-05 15:47:08,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:08,556 INFO L225 Difference]: With dead ends: 946 [2025-02-05 15:47:08,556 INFO L226 Difference]: Without dead ends: 600 [2025-02-05 15:47:08,561 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:47:08,562 INFO L435 NwaCegarLoop]: 901 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, 901 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:47:08,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-05 15:47:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-02-05 15:47:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 444 states have (on average 1.509009009009009) internal successors, (670), 463 states have internal predecessors, (670), 112 states have call successors, (112), 43 states have call predecessors, (112), 43 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-02-05 15:47:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 893 transitions. [2025-02-05 15:47:08,615 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 893 transitions. Word has length 166 [2025-02-05 15:47:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:08,616 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 893 transitions. [2025-02-05 15:47:08,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 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:47:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 893 transitions. [2025-02-05 15:47:08,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 15:47:08,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:08,621 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] [2025-02-05 15:47:08,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:47:08,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:08,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1269761619, now seen corresponding path program 1 times [2025-02-05 15:47:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417512617] [2025-02-05 15:47:08,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:08,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:47:08,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:47:08,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:08,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:08,903 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:47:08,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:08,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417512617] [2025-02-05 15:47:08,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417512617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:08,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:08,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:47:08,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090198384] [2025-02-05 15:47:08,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:08,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:47:08,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:08,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:47:08,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:47:08,906 INFO L87 Difference]: Start difference. First operand 600 states and 893 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:47:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:09,027 INFO L93 Difference]: Finished difference Result 1164 states and 1730 transitions. [2025-02-05 15:47:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:47:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 153 [2025-02-05 15:47:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:09,037 INFO L225 Difference]: With dead ends: 1164 [2025-02-05 15:47:09,038 INFO L226 Difference]: Without dead ends: 600 [2025-02-05 15:47:09,040 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:47:09,042 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 0 mSDsluCounter, 2661 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3552 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:47:09,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3552 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-05 15:47:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-02-05 15:47:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 444 states have (on average 1.4932432432432432) internal successors, (663), 463 states have internal predecessors, (663), 112 states have call successors, (112), 43 states have call predecessors, (112), 43 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-02-05 15:47:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 886 transitions. [2025-02-05 15:47:09,088 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 886 transitions. Word has length 153 [2025-02-05 15:47:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:09,089 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 886 transitions. [2025-02-05 15:47:09,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:47:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 886 transitions. [2025-02-05 15:47:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 15:47:09,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:09,095 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, 1] [2025-02-05 15:47:09,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:47:09,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:09,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1782939851, now seen corresponding path program 1 times [2025-02-05 15:47:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:09,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734326751] [2025-02-05 15:47:09,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:09,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:09,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:47:09,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:47:09,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:09,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:09,302 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:47:09,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734326751] [2025-02-05 15:47:09,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734326751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:09,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:09,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785268514] [2025-02-05 15:47:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:09,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:09,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:09,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:09,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:09,304 INFO L87 Difference]: Start difference. First operand 600 states and 886 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-05 15:47:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:09,376 INFO L93 Difference]: Finished difference Result 1174 states and 1754 transitions. [2025-02-05 15:47:09,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:09,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 158 [2025-02-05 15:47:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:09,381 INFO L225 Difference]: With dead ends: 1174 [2025-02-05 15:47:09,383 INFO L226 Difference]: Without dead ends: 599 [2025-02-05 15:47:09,386 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:47:09,387 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 852 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 879 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:47:09,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 879 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-05 15:47:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-02-05 15:47:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 445 states have (on average 1.4808988764044944) internal successors, (659), 462 states have internal predecessors, (659), 109 states have call successors, (109), 44 states have call predecessors, (109), 44 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 15:47:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 876 transitions. [2025-02-05 15:47:09,428 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 876 transitions. Word has length 158 [2025-02-05 15:47:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:09,429 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 876 transitions. [2025-02-05 15:47:09,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-05 15:47:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 876 transitions. [2025-02-05 15:47:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 15:47:09,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:09,434 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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] [2025-02-05 15:47:09,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:47:09,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:09,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:09,435 INFO L85 PathProgramCache]: Analyzing trace with hash -610018741, now seen corresponding path program 1 times [2025-02-05 15:47:09,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:09,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204046628] [2025-02-05 15:47:09,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:09,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:09,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 15:47:09,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 15:47:09,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:09,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 15:47:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204046628] [2025-02-05 15:47:09,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204046628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:09,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:09,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:09,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923459971] [2025-02-05 15:47:09,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:09,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:09,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:09,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:09,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:09,581 INFO L87 Difference]: Start difference. First operand 599 states and 876 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, (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:47:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:09,628 INFO L93 Difference]: Finished difference Result 1167 states and 1722 transitions. [2025-02-05 15:47:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:09,628 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, (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 174 [2025-02-05 15:47:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:09,631 INFO L225 Difference]: With dead ends: 1167 [2025-02-05 15:47:09,631 INFO L226 Difference]: Without dead ends: 598 [2025-02-05 15:47:09,635 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:47:09,636 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 838 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 897 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:47:09,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 897 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-02-05 15:47:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-02-05 15:47:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 445 states have (on average 1.4764044943820225) internal successors, (657), 461 states have internal predecessors, (657), 108 states have call successors, (108), 44 states have call predecessors, (108), 44 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-02-05 15:47:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 872 transitions. [2025-02-05 15:47:09,670 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 872 transitions. Word has length 174 [2025-02-05 15:47:09,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:09,670 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 872 transitions. [2025-02-05 15:47:09,670 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, (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:47:09,670 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 872 transitions. [2025-02-05 15:47:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 15:47:09,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:09,672 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1] [2025-02-05 15:47:09,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:47:09,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:09,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash -786378553, now seen corresponding path program 1 times [2025-02-05 15:47:09,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122390990] [2025-02-05 15:47:09,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:09,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:47:09,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:47:09,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:09,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 15:47:09,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:09,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122390990] [2025-02-05 15:47:09,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122390990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:09,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:09,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:09,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751692777] [2025-02-05 15:47:09,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:09,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:09,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:09,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:09,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:09,791 INFO L87 Difference]: Start difference. First operand 598 states and 872 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-05 15:47:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:09,852 INFO L93 Difference]: Finished difference Result 1147 states and 1680 transitions. [2025-02-05 15:47:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:09,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 182 [2025-02-05 15:47:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:09,857 INFO L225 Difference]: With dead ends: 1147 [2025-02-05 15:47:09,857 INFO L226 Difference]: Without dead ends: 595 [2025-02-05 15:47:09,862 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:47:09,862 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 810 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 874 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:09,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 874 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-05 15:47:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-02-05 15:47:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 445 states have (on average 1.451685393258427) internal successors, (646), 456 states have internal predecessors, (646), 105 states have call successors, (105), 44 states have call predecessors, (105), 44 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-02-05 15:47:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 855 transitions. [2025-02-05 15:47:09,942 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 855 transitions. Word has length 182 [2025-02-05 15:47:09,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:09,942 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 855 transitions. [2025-02-05 15:47:09,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-05 15:47:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 855 transitions. [2025-02-05 15:47:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 15:47:09,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:09,945 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:47:09,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:09,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1567122506, now seen corresponding path program 1 times [2025-02-05 15:47:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:09,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879040377] [2025-02-05 15:47:09,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:09,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:09,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 15:47:10,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 15:47:10,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:10,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-05 15:47:10,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:10,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879040377] [2025-02-05 15:47:10,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879040377] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:10,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382597919] [2025-02-05 15:47:10,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:10,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:10,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:10,413 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:47:10,414 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:47:10,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 15:47:10,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 15:47:10,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:10,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:10,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:47:10,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:47:10,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:10,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382597919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:10,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:10,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:47:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113036194] [2025-02-05 15:47:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:10,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:10,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:10,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:47:10,791 INFO L87 Difference]: Start difference. First operand 595 states and 855 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:47:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:10,834 INFO L93 Difference]: Finished difference Result 925 states and 1311 transitions. [2025-02-05 15:47:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:10,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 193 [2025-02-05 15:47:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:10,839 INFO L225 Difference]: With dead ends: 925 [2025-02-05 15:47:10,839 INFO L226 Difference]: Without dead ends: 597 [2025-02-05 15:47:10,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 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:47:10,841 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1702 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:47:10,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1702 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-02-05 15:47:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2025-02-05 15:47:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 447 states have (on average 1.4496644295302012) internal successors, (648), 458 states have internal predecessors, (648), 105 states have call successors, (105), 44 states have call predecessors, (105), 44 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-02-05 15:47:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 857 transitions. [2025-02-05 15:47:10,876 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 857 transitions. Word has length 193 [2025-02-05 15:47:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:10,877 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 857 transitions. [2025-02-05 15:47:10,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:47:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 857 transitions. [2025-02-05 15:47:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 15:47:10,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:10,880 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:10,892 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:47:11,080 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:47:11,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:11,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash -56574988, now seen corresponding path program 1 times [2025-02-05 15:47:11,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:11,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265292784] [2025-02-05 15:47:11,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:11,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:11,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 15:47:11,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 15:47:11,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:11,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:47:11,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:11,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265292784] [2025-02-05 15:47:11,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265292784] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:11,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219099510] [2025-02-05 15:47:11,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:11,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:11,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:11,437 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:47:11,440 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:47:11,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 15:47:11,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 15:47:11,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:11,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:11,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1538 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:47:11,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:47:11,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:11,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219099510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:11,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:11,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:47:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140760000] [2025-02-05 15:47:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:11,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:11,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:11,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:47:11,885 INFO L87 Difference]: Start difference. First operand 597 states and 857 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:11,937 INFO L93 Difference]: Finished difference Result 1213 states and 1774 transitions. [2025-02-05 15:47:11,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:11,939 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 207 [2025-02-05 15:47:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:11,942 INFO L225 Difference]: With dead ends: 1213 [2025-02-05 15:47:11,942 INFO L226 Difference]: Without dead ends: 694 [2025-02-05 15:47:11,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 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:47:11,944 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 165 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1674 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:47:11,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1674 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-02-05 15:47:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 686. [2025-02-05 15:47:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 522 states have (on average 1.4655172413793103) internal successors, (765), 533 states have internal predecessors, (765), 119 states have call successors, (119), 44 states have call predecessors, (119), 44 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-02-05 15:47:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1002 transitions. [2025-02-05 15:47:11,973 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1002 transitions. Word has length 207 [2025-02-05 15:47:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:11,973 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1002 transitions. [2025-02-05 15:47:11,973 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1002 transitions. [2025-02-05 15:47:11,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 15:47:11,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:11,976 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:11,988 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:47:12,180 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:47:12,180 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:12,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:12,181 INFO L85 PathProgramCache]: Analyzing trace with hash 199026074, now seen corresponding path program 1 times [2025-02-05 15:47:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836121331] [2025-02-05 15:47:12,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:12,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 15:47:12,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 15:47:12,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:12,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:47:12,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:12,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836121331] [2025-02-05 15:47:12,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836121331] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:12,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431593836] [2025-02-05 15:47:12,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:12,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:12,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:12,446 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:47:12,448 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:47:12,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 15:47:12,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 15:47:12,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:12,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:12,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:47:12,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-02-05 15:47:12,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:12,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431593836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:12,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:12,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-02-05 15:47:12,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869802932] [2025-02-05 15:47:12,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:47:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:12,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:47:12,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:47:12,944 INFO L87 Difference]: Start difference. First operand 686 states and 1002 transitions. Second operand has 8 states, 6 states have (on average 19.666666666666668) internal successors, (118), 8 states have internal predecessors, (118), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-05 15:47:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:13,055 INFO L93 Difference]: Finished difference Result 1319 states and 1941 transitions. [2025-02-05 15:47:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:47:13,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 19.666666666666668) internal successors, (118), 8 states have internal predecessors, (118), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 201 [2025-02-05 15:47:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:13,060 INFO L225 Difference]: With dead ends: 1319 [2025-02-05 15:47:13,060 INFO L226 Difference]: Without dead ends: 688 [2025-02-05 15:47:13,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 196 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:47:13,062 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 4 mSDsluCounter, 5035 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5877 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:13,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5877 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:13,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-02-05 15:47:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-02-05 15:47:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 523 states have (on average 1.4646271510516253) internal successors, (766), 535 states have internal predecessors, (766), 119 states have call successors, (119), 44 states have call predecessors, (119), 45 states have return successors, (120), 117 states have call predecessors, (120), 118 states have call successors, (120) [2025-02-05 15:47:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1005 transitions. [2025-02-05 15:47:13,122 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1005 transitions. Word has length 201 [2025-02-05 15:47:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:13,123 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1005 transitions. [2025-02-05 15:47:13,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 19.666666666666668) internal successors, (118), 8 states have internal predecessors, (118), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-05 15:47:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1005 transitions. [2025-02-05 15:47:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-05 15:47:13,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:13,126 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:13,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:47:13,327 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:47:13,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:13,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:13,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1192111016, now seen corresponding path program 1 times [2025-02-05 15:47:13,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:13,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295442902] [2025-02-05 15:47:13,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:13,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:13,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 15:47:13,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 15:47:13,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:13,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 15:47:13,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295442902] [2025-02-05 15:47:13,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295442902] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860078656] [2025-02-05 15:47:13,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:13,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:13,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:13,539 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:47:13,541 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:47:13,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-02-05 15:47:13,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-02-05 15:47:13,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:13,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:13,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:47:13,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-02-05 15:47:13,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860078656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:13,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:13,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 15:47:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009743636] [2025-02-05 15:47:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:13,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:47:13,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:13,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:47:13,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:47:13,953 INFO L87 Difference]: Start difference. First operand 688 states and 1005 transitions. Second operand has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 3 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-02-05 15:47:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:14,028 INFO L93 Difference]: Finished difference Result 1320 states and 1945 transitions. [2025-02-05 15:47:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:47:14,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 3 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 209 [2025-02-05 15:47:14,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:14,033 INFO L225 Difference]: With dead ends: 1320 [2025-02-05 15:47:14,033 INFO L226 Difference]: Without dead ends: 690 [2025-02-05 15:47:14,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 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:47:14,036 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 2 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4193 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:47:14,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4193 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-02-05 15:47:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2025-02-05 15:47:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 524 states have (on average 1.463740458015267) internal successors, (767), 537 states have internal predecessors, (767), 119 states have call successors, (119), 44 states have call predecessors, (119), 46 states have return successors, (125), 117 states have call predecessors, (125), 118 states have call successors, (125) [2025-02-05 15:47:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1011 transitions. [2025-02-05 15:47:14,065 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1011 transitions. Word has length 209 [2025-02-05 15:47:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:14,065 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1011 transitions. [2025-02-05 15:47:14,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.0) internal successors, (125), 6 states have internal predecessors, (125), 3 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-02-05 15:47:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1011 transitions. [2025-02-05 15:47:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-05 15:47:14,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:14,070 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:14,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:47:14,274 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:47:14,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:14,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:14,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1481662705, now seen corresponding path program 1 times [2025-02-05 15:47:14,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:14,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789651847] [2025-02-05 15:47:14,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:14,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:14,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 15:47:14,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 15:47:14,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:14,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:47:14,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789651847] [2025-02-05 15:47:14,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789651847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:14,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:47:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611507171] [2025-02-05 15:47:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:14,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:47:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:14,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:47:14,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:47:14,513 INFO L87 Difference]: Start difference. First operand 690 states and 1011 transitions. Second operand has 8 states, 6 states have (on average 20.166666666666668) internal successors, (121), 8 states have internal predecessors, (121), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 15:47:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:14,610 INFO L93 Difference]: Finished difference Result 1308 states and 1932 transitions. [2025-02-05 15:47:14,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:47:14,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 20.166666666666668) internal successors, (121), 8 states have internal predecessors, (121), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 210 [2025-02-05 15:47:14,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:14,615 INFO L225 Difference]: With dead ends: 1308 [2025-02-05 15:47:14,616 INFO L226 Difference]: Without dead ends: 690 [2025-02-05 15:47:14,618 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:47:14,618 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 4 mSDsluCounter, 5041 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5884 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:14,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5884 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-02-05 15:47:14,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2025-02-05 15:47:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 524 states have (on average 1.463740458015267) internal successors, (767), 537 states have internal predecessors, (767), 119 states have call successors, (119), 44 states have call predecessors, (119), 46 states have return successors, (124), 117 states have call predecessors, (124), 118 states have call successors, (124) [2025-02-05 15:47:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1010 transitions. [2025-02-05 15:47:14,647 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1010 transitions. Word has length 210 [2025-02-05 15:47:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:14,647 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1010 transitions. [2025-02-05 15:47:14,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 20.166666666666668) internal successors, (121), 8 states have internal predecessors, (121), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 15:47:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1010 transitions. [2025-02-05 15:47:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 15:47:14,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:14,651 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:14,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:47:14,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:14,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1673424969, now seen corresponding path program 1 times [2025-02-05 15:47:14,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:14,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660054118] [2025-02-05 15:47:14,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:14,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:14,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 15:47:14,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 15:47:14,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:14,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 15:47:14,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:14,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660054118] [2025-02-05 15:47:14,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660054118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:14,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:14,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:47:14,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165842122] [2025-02-05 15:47:14,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:14,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:47:14,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:14,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:47:14,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:47:14,888 INFO L87 Difference]: Start difference. First operand 690 states and 1010 transitions. Second operand has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-05 15:47:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:14,988 INFO L93 Difference]: Finished difference Result 1310 states and 1935 transitions. [2025-02-05 15:47:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:47:14,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 204 [2025-02-05 15:47:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:14,994 INFO L225 Difference]: With dead ends: 1310 [2025-02-05 15:47:14,995 INFO L226 Difference]: Without dead ends: 692 [2025-02-05 15:47:14,997 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:47:14,998 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 3 mSDsluCounter, 5046 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5890 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:14,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5890 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-02-05 15:47:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2025-02-05 15:47:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 525 states have (on average 1.4628571428571429) internal successors, (768), 539 states have internal predecessors, (768), 119 states have call successors, (119), 44 states have call predecessors, (119), 47 states have return successors, (126), 117 states have call predecessors, (126), 118 states have call successors, (126) [2025-02-05 15:47:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1013 transitions. [2025-02-05 15:47:15,035 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1013 transitions. Word has length 204 [2025-02-05 15:47:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:15,036 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1013 transitions. [2025-02-05 15:47:15,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 19.5) internal successors, (117), 8 states have internal predecessors, (117), 4 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-05 15:47:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1013 transitions. [2025-02-05 15:47:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 15:47:15,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:15,039 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:15,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:47:15,040 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:15,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:15,040 INFO L85 PathProgramCache]: Analyzing trace with hash -159482153, now seen corresponding path program 1 times [2025-02-05 15:47:15,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:15,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578953255] [2025-02-05 15:47:15,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:15,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:15,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 15:47:15,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 15:47:15,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:15,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 15:47:15,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:15,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578953255] [2025-02-05 15:47:15,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578953255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:15,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:15,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:47:15,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326053139] [2025-02-05 15:47:15,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:15,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:47:15,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:15,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:47:15,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:47:15,224 INFO L87 Difference]: Start difference. First operand 692 states and 1013 transitions. Second operand has 9 states, 7 states have (on average 17.285714285714285) internal successors, (121), 8 states have internal predecessors, (121), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-05 15:47:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:15,361 INFO L93 Difference]: Finished difference Result 1307 states and 1929 transitions. [2025-02-05 15:47:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:47:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 17.285714285714285) internal successors, (121), 8 states have internal predecessors, (121), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 205 [2025-02-05 15:47:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:15,366 INFO L225 Difference]: With dead ends: 1307 [2025-02-05 15:47:15,366 INFO L226 Difference]: Without dead ends: 692 [2025-02-05 15:47:15,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:47:15,368 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 7 mSDsluCounter, 5822 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6658 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:15,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6658 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:47:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-02-05 15:47:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2025-02-05 15:47:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 525 states have (on average 1.4628571428571429) internal successors, (768), 539 states have internal predecessors, (768), 119 states have call successors, (119), 44 states have call predecessors, (119), 47 states have return successors, (125), 117 states have call predecessors, (125), 118 states have call successors, (125) [2025-02-05 15:47:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1012 transitions. [2025-02-05 15:47:15,395 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1012 transitions. Word has length 205 [2025-02-05 15:47:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:15,395 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1012 transitions. [2025-02-05 15:47:15,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 17.285714285714285) internal successors, (121), 8 states have internal predecessors, (121), 4 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-02-05 15:47:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1012 transitions. [2025-02-05 15:47:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 15:47:15,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:15,399 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:15,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:47:15,399 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:15,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1910259815, now seen corresponding path program 1 times [2025-02-05 15:47:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:15,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510884449] [2025-02-05 15:47:15,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:15,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:15,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 15:47:15,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 15:47:15,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:15,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 15:47:15,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:15,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510884449] [2025-02-05 15:47:15,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510884449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:15,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:15,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:47:15,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269330928] [2025-02-05 15:47:15,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:15,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:47:15,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:15,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:47:15,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:47:15,586 INFO L87 Difference]: Start difference. First operand 692 states and 1012 transitions. Second operand has 9 states, 7 states have (on average 18.142857142857142) internal successors, (127), 8 states have internal predecessors, (127), 4 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 15:47:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:15,731 INFO L93 Difference]: Finished difference Result 1309 states and 1935 transitions. [2025-02-05 15:47:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:47:15,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 18.142857142857142) internal successors, (127), 8 states have internal predecessors, (127), 4 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 213 [2025-02-05 15:47:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:15,735 INFO L225 Difference]: With dead ends: 1309 [2025-02-05 15:47:15,735 INFO L226 Difference]: Without dead ends: 694 [2025-02-05 15:47:15,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:47:15,738 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 4 mSDsluCounter, 5836 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6674 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:15,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6674 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:47:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-02-05 15:47:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2025-02-05 15:47:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 526 states have (on average 1.461977186311787) internal successors, (769), 541 states have internal predecessors, (769), 119 states have call successors, (119), 44 states have call predecessors, (119), 48 states have return successors, (130), 117 states have call predecessors, (130), 118 states have call successors, (130) [2025-02-05 15:47:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1018 transitions. [2025-02-05 15:47:15,768 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1018 transitions. Word has length 213 [2025-02-05 15:47:15,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:15,768 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1018 transitions. [2025-02-05 15:47:15,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 18.142857142857142) internal successors, (127), 8 states have internal predecessors, (127), 4 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-02-05 15:47:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1018 transitions. [2025-02-05 15:47:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 15:47:15,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:15,771 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:15,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:47:15,771 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:15,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1079330284, now seen corresponding path program 1 times [2025-02-05 15:47:15,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:15,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48936838] [2025-02-05 15:47:15,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:15,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:15,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 15:47:15,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 15:47:15,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:15,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48936838] [2025-02-05 15:47:15,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48936838] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:15,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172436876] [2025-02-05 15:47:15,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:15,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:15,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:15,879 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:47:15,880 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:47:16,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 15:47:16,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 15:47:16,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:16,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:16,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:47:16,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:16,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:47:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:16,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172436876] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:47:16,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:47:16,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:47:16,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017919955] [2025-02-05 15:47:16,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:47:16,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:47:16,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:16,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:47:16,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:47:16,405 INFO L87 Difference]: Start difference. First operand 694 states and 1018 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-02-05 15:47:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:16,546 INFO L93 Difference]: Finished difference Result 1580 states and 2391 transitions. [2025-02-05 15:47:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:47:16,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 207 [2025-02-05 15:47:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:16,553 INFO L225 Difference]: With dead ends: 1580 [2025-02-05 15:47:16,553 INFO L226 Difference]: Without dead ends: 1252 [2025-02-05 15:47:16,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 411 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:47:16,555 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 785 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:16,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 2437 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:47:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-02-05 15:47:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1228. [2025-02-05 15:47:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 981 states have (on average 1.5168195718654434) internal successors, (1488), 996 states have internal predecessors, (1488), 198 states have call successors, (198), 44 states have call predecessors, (198), 48 states have return successors, (219), 196 states have call predecessors, (219), 197 states have call successors, (219) [2025-02-05 15:47:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1905 transitions. [2025-02-05 15:47:16,593 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1905 transitions. Word has length 207 [2025-02-05 15:47:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:16,594 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1905 transitions. [2025-02-05 15:47:16,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-02-05 15:47:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1905 transitions. [2025-02-05 15:47:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-02-05 15:47:16,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:16,599 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:16,608 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:47:16,799 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,SelfDestructingSolverStorable13 [2025-02-05 15:47:16,800 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:16,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:16,801 INFO L85 PathProgramCache]: Analyzing trace with hash 968828031, now seen corresponding path program 1 times [2025-02-05 15:47:16,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:16,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418559768] [2025-02-05 15:47:16,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:16,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:16,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-05 15:47:16,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-05 15:47:16,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:16,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:16,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418559768] [2025-02-05 15:47:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418559768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:16,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:16,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818449893] [2025-02-05 15:47:16,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:16,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:16,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:16,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:16,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:16,867 INFO L87 Difference]: Start difference. First operand 1228 states and 1905 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:47:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:16,908 INFO L93 Difference]: Finished difference Result 2827 states and 4456 transitions. [2025-02-05 15:47:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:16,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 211 [2025-02-05 15:47:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:16,917 INFO L225 Difference]: With dead ends: 2827 [2025-02-05 15:47:16,917 INFO L226 Difference]: Without dead ends: 1732 [2025-02-05 15:47:16,920 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:47:16,920 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 163 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1714 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:47:16,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1714 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-02-05 15:47:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1724. [2025-02-05 15:47:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1398 states have (on average 1.5300429184549356) internal successors, (2139), 1413 states have internal predecessors, (2139), 277 states have call successors, (277), 44 states have call predecessors, (277), 48 states have return successors, (308), 275 states have call predecessors, (308), 276 states have call successors, (308) [2025-02-05 15:47:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2724 transitions. [2025-02-05 15:47:17,041 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2724 transitions. Word has length 211 [2025-02-05 15:47:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:17,042 INFO L471 AbstractCegarLoop]: Abstraction has 1724 states and 2724 transitions. [2025-02-05 15:47:17,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:47:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2724 transitions. [2025-02-05 15:47:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 15:47:17,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:17,050 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:17,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:47:17,051 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:17,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1249468094, now seen corresponding path program 1 times [2025-02-05 15:47:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:17,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53030592] [2025-02-05 15:47:17,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:17,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:17,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 15:47:17,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 15:47:17,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:17,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:17,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53030592] [2025-02-05 15:47:17,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53030592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:17,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:17,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:17,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749134745] [2025-02-05 15:47:17,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:17,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:17,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:17,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:17,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:17,119 INFO L87 Difference]: Start difference. First operand 1724 states and 2724 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:17,182 INFO L93 Difference]: Finished difference Result 4063 states and 6486 transitions. [2025-02-05 15:47:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:17,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 219 [2025-02-05 15:47:17,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:17,201 INFO L225 Difference]: With dead ends: 4063 [2025-02-05 15:47:17,201 INFO L226 Difference]: Without dead ends: 2533 [2025-02-05 15:47:17,207 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:47:17,208 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 161 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1696 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:47:17,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1696 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:17,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2533 states. [2025-02-05 15:47:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2533 to 2525. [2025-02-05 15:47:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2080 states have (on average 1.54375) internal successors, (3211), 2095 states have internal predecessors, (3211), 396 states have call successors, (396), 44 states have call predecessors, (396), 48 states have return successors, (427), 394 states have call predecessors, (427), 395 states have call successors, (427) [2025-02-05 15:47:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 4034 transitions. [2025-02-05 15:47:17,307 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 4034 transitions. Word has length 219 [2025-02-05 15:47:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:17,308 INFO L471 AbstractCegarLoop]: Abstraction has 2525 states and 4034 transitions. [2025-02-05 15:47:17,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 4034 transitions. [2025-02-05 15:47:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 15:47:17,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:17,319 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:17,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:47:17,319 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:17,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash -827147705, now seen corresponding path program 1 times [2025-02-05 15:47:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:17,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785140444] [2025-02-05 15:47:17,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:17,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:17,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 15:47:17,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 15:47:17,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:17,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:17,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:17,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785140444] [2025-02-05 15:47:17,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785140444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:17,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:17,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:17,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443395031] [2025-02-05 15:47:17,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:17,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:17,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:17,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:17,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:17,387 INFO L87 Difference]: Start difference. First operand 2525 states and 4034 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:17,517 INFO L93 Difference]: Finished difference Result 5944 states and 9591 transitions. [2025-02-05 15:47:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:17,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 220 [2025-02-05 15:47:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:17,543 INFO L225 Difference]: With dead ends: 5944 [2025-02-05 15:47:17,544 INFO L226 Difference]: Without dead ends: 3767 [2025-02-05 15:47:17,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:17,554 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 159 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 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:47:17,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 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:47:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2025-02-05 15:47:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3759. [2025-02-05 15:47:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3152 states have (on average 1.5552030456852792) internal successors, (4902), 3167 states have internal predecessors, (4902), 558 states have call successors, (558), 44 states have call predecessors, (558), 48 states have return successors, (605), 556 states have call predecessors, (605), 557 states have call successors, (605) [2025-02-05 15:47:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 6065 transitions. [2025-02-05 15:47:17,729 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 6065 transitions. Word has length 220 [2025-02-05 15:47:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:17,729 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 6065 transitions. [2025-02-05 15:47:17,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 6065 transitions. [2025-02-05 15:47:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 15:47:17,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:17,746 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:17,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:47:17,746 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:17,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1385205855, now seen corresponding path program 1 times [2025-02-05 15:47:17,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:17,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023331225] [2025-02-05 15:47:17,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:17,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 15:47:17,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 15:47:17,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:17,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:17,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:17,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023331225] [2025-02-05 15:47:17,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023331225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:17,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:17,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:17,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473242195] [2025-02-05 15:47:17,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:17,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:17,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:17,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:17,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:17,830 INFO L87 Difference]: Start difference. First operand 3759 states and 6065 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:17,971 INFO L93 Difference]: Finished difference Result 8915 states and 14512 transitions. [2025-02-05 15:47:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:17,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 221 [2025-02-05 15:47:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:17,996 INFO L225 Difference]: With dead ends: 8915 [2025-02-05 15:47:17,997 INFO L226 Difference]: Without dead ends: 5759 [2025-02-05 15:47:18,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:18,009 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 157 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 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:47:18,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 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:47:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5759 states. [2025-02-05 15:47:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5759 to 5751. [2025-02-05 15:47:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5751 states, 4899 states have (on average 1.564809144723413) internal successors, (7666), 4914 states have internal predecessors, (7666), 803 states have call successors, (803), 44 states have call predecessors, (803), 48 states have return successors, (876), 801 states have call predecessors, (876), 802 states have call successors, (876) [2025-02-05 15:47:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5751 states to 5751 states and 9345 transitions. [2025-02-05 15:47:18,248 INFO L78 Accepts]: Start accepts. Automaton has 5751 states and 9345 transitions. Word has length 221 [2025-02-05 15:47:18,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:18,249 INFO L471 AbstractCegarLoop]: Abstraction has 5751 states and 9345 transitions. [2025-02-05 15:47:18,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5751 states and 9345 transitions. [2025-02-05 15:47:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-02-05 15:47:18,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:18,271 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:18,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:47:18,271 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:18,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2012529699, now seen corresponding path program 1 times [2025-02-05 15:47:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952684099] [2025-02-05 15:47:18,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:18,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-02-05 15:47:18,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-02-05 15:47:18,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:18,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:18,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:18,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952684099] [2025-02-05 15:47:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952684099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:18,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635642557] [2025-02-05 15:47:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:18,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:18,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:18,336 INFO L87 Difference]: Start difference. First operand 5751 states and 9345 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:47:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:18,507 INFO L93 Difference]: Finished difference Result 13852 states and 22654 transitions. [2025-02-05 15:47:18,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:18,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 215 [2025-02-05 15:47:18,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:18,560 INFO L225 Difference]: With dead ends: 13852 [2025-02-05 15:47:18,560 INFO L226 Difference]: Without dead ends: 9095 [2025-02-05 15:47:18,579 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:47:18,580 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 155 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1701 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:47:18,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1701 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9095 states. [2025-02-05 15:47:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9095 to 9087. [2025-02-05 15:47:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9087 states, 7742 states have (on average 1.563032808059933) internal successors, (12101), 7757 states have internal predecessors, (12101), 1296 states have call successors, (1296), 44 states have call predecessors, (1296), 48 states have return successors, (1413), 1294 states have call predecessors, (1413), 1295 states have call successors, (1413) [2025-02-05 15:47:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9087 states to 9087 states and 14810 transitions. [2025-02-05 15:47:19,024 INFO L78 Accepts]: Start accepts. Automaton has 9087 states and 14810 transitions. Word has length 215 [2025-02-05 15:47:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:19,025 INFO L471 AbstractCegarLoop]: Abstraction has 9087 states and 14810 transitions. [2025-02-05 15:47:19,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:47:19,025 INFO L276 IsEmpty]: Start isEmpty. Operand 9087 states and 14810 transitions. [2025-02-05 15:47:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-02-05 15:47:19,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:19,053 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:19,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:47:19,054 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:19,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1912144443, now seen corresponding path program 1 times [2025-02-05 15:47:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:19,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390769007] [2025-02-05 15:47:19,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:19,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-05 15:47:19,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-05 15:47:19,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:19,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:19,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:19,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390769007] [2025-02-05 15:47:19,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390769007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:19,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:19,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440762492] [2025-02-05 15:47:19,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:19,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:19,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:19,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:19,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:19,120 INFO L87 Difference]: Start difference. First operand 9087 states and 14810 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:47:19,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:19,423 INFO L93 Difference]: Finished difference Result 22700 states and 37314 transitions. [2025-02-05 15:47:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:19,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 216 [2025-02-05 15:47:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:19,475 INFO L225 Difference]: With dead ends: 22700 [2025-02-05 15:47:19,475 INFO L226 Difference]: Without dead ends: 15097 [2025-02-05 15:47:19,500 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:47:19,500 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 153 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1698 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:47:19,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1698 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15097 states. [2025-02-05 15:47:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15097 to 15089. [2025-02-05 15:47:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15089 states, 12922 states have (on average 1.5694938863952947) internal successors, (20281), 12937 states have internal predecessors, (20281), 2118 states have call successors, (2118), 44 states have call predecessors, (2118), 48 states have return successors, (2313), 2116 states have call predecessors, (2313), 2117 states have call successors, (2313) [2025-02-05 15:47:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15089 states to 15089 states and 24712 transitions. [2025-02-05 15:47:20,215 INFO L78 Accepts]: Start accepts. Automaton has 15089 states and 24712 transitions. Word has length 216 [2025-02-05 15:47:20,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:20,215 INFO L471 AbstractCegarLoop]: Abstraction has 15089 states and 24712 transitions. [2025-02-05 15:47:20,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:47:20,216 INFO L276 IsEmpty]: Start isEmpty. Operand 15089 states and 24712 transitions. [2025-02-05 15:47:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 15:47:20,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:20,266 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:20,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:47:20,266 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:20,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1444172055, now seen corresponding path program 1 times [2025-02-05 15:47:20,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:20,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891506955] [2025-02-05 15:47:20,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:20,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 15:47:20,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 15:47:20,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:20,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:20,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:20,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891506955] [2025-02-05 15:47:20,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891506955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:20,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:20,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:20,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412793416] [2025-02-05 15:47:20,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:20,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:20,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:20,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:20,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:20,367 INFO L87 Difference]: Start difference. First operand 15089 states and 24712 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:21,110 INFO L93 Difference]: Finished difference Result 36307 states and 59215 transitions. [2025-02-05 15:47:21,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:21,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 224 [2025-02-05 15:47:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:21,179 INFO L225 Difference]: With dead ends: 36307 [2025-02-05 15:47:21,179 INFO L226 Difference]: Without dead ends: 23829 [2025-02-05 15:47:21,201 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:47:21,202 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 151 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1680 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:47:21,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1680 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23829 states. [2025-02-05 15:47:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23829 to 23821. [2025-02-05 15:47:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23821 states, 20451 states have (on average 1.5432986162045865) internal successors, (31562), 20466 states have internal predecessors, (31562), 3321 states have call successors, (3321), 44 states have call predecessors, (3321), 48 states have return successors, (3660), 3319 states have call predecessors, (3660), 3320 states have call successors, (3660) [2025-02-05 15:47:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23821 states to 23821 states and 38543 transitions. [2025-02-05 15:47:21,929 INFO L78 Accepts]: Start accepts. Automaton has 23821 states and 38543 transitions. Word has length 224 [2025-02-05 15:47:21,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:21,929 INFO L471 AbstractCegarLoop]: Abstraction has 23821 states and 38543 transitions. [2025-02-05 15:47:21,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 23821 states and 38543 transitions. [2025-02-05 15:47:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 15:47:21,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:21,963 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:21,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:47:21,963 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:21,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1975521631, now seen corresponding path program 1 times [2025-02-05 15:47:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:21,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231296153] [2025-02-05 15:47:21,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:21,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:21,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 15:47:21,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 15:47:21,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:21,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:22,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231296153] [2025-02-05 15:47:22,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231296153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:22,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:22,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:22,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454334036] [2025-02-05 15:47:22,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:22,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:22,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:22,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:22,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:22,023 INFO L87 Difference]: Start difference. First operand 23821 states and 38543 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:22,911 INFO L93 Difference]: Finished difference Result 62765 states and 101968 transitions. [2025-02-05 15:47:22,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:22,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 225 [2025-02-05 15:47:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:23,053 INFO L225 Difference]: With dead ends: 62765 [2025-02-05 15:47:23,053 INFO L226 Difference]: Without dead ends: 42359 [2025-02-05 15:47:23,098 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:47:23,101 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 149 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1697 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:47:23,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1697 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42359 states. [2025-02-05 15:47:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42359 to 42351. [2025-02-05 15:47:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42351 states, 36531 states have (on average 1.5437847307766006) internal successors, (56396), 36546 states have internal predecessors, (56396), 5771 states have call successors, (5771), 44 states have call predecessors, (5771), 48 states have return successors, (6384), 5769 states have call predecessors, (6384), 5770 states have call successors, (6384) [2025-02-05 15:47:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42351 states to 42351 states and 68551 transitions. [2025-02-05 15:47:25,157 INFO L78 Accepts]: Start accepts. Automaton has 42351 states and 68551 transitions. Word has length 225 [2025-02-05 15:47:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:25,158 INFO L471 AbstractCegarLoop]: Abstraction has 42351 states and 68551 transitions. [2025-02-05 15:47:25,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 42351 states and 68551 transitions. [2025-02-05 15:47:25,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-02-05 15:47:25,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:25,214 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:25,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:47:25,214 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:25,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:25,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1015999077, now seen corresponding path program 1 times [2025-02-05 15:47:25,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:25,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234192939] [2025-02-05 15:47:25,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:25,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:25,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-05 15:47:25,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-05 15:47:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:25,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:25,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234192939] [2025-02-05 15:47:25,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234192939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:25,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:25,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:25,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256727311] [2025-02-05 15:47:25,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:25,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:25,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:25,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:25,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:25,293 INFO L87 Difference]: Start difference. First operand 42351 states and 68551 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:47:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:27,066 INFO L93 Difference]: Finished difference Result 114647 states and 186610 transitions. [2025-02-05 15:47:27,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:27,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 219 [2025-02-05 15:47:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:27,523 INFO L225 Difference]: With dead ends: 114647 [2025-02-05 15:47:27,523 INFO L226 Difference]: Without dead ends: 76878 [2025-02-05 15:47:27,611 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:47:27,611 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 147 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1696 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:47:27,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1696 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76878 states. [2025-02-05 15:47:30,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76878 to 76870. [2025-02-05 15:47:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76870 states, 66537 states have (on average 1.547935735004584) internal successors, (102995), 66552 states have internal predecessors, (102995), 10284 states have call successors, (10284), 44 states have call predecessors, (10284), 48 states have return successors, (11429), 10282 states have call predecessors, (11429), 10283 states have call successors, (11429) [2025-02-05 15:47:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76870 states to 76870 states and 124708 transitions. [2025-02-05 15:47:30,366 INFO L78 Accepts]: Start accepts. Automaton has 76870 states and 124708 transitions. Word has length 219 [2025-02-05 15:47:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:30,366 INFO L471 AbstractCegarLoop]: Abstraction has 76870 states and 124708 transitions. [2025-02-05 15:47:30,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-05 15:47:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 76870 states and 124708 transitions. [2025-02-05 15:47:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 15:47:30,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:30,427 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:30,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:47:30,427 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:30,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:30,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1865075234, now seen corresponding path program 1 times [2025-02-05 15:47:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:30,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889119353] [2025-02-05 15:47:30,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:30,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 15:47:30,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 15:47:30,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:30,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 15:47:30,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:30,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889119353] [2025-02-05 15:47:30,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889119353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:30,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:47:30,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:47:30,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275492419] [2025-02-05 15:47:30,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:30,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:47:30,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:30,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:47:30,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:30,652 INFO L87 Difference]: Start difference. First operand 76870 states and 124708 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:33,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:47:33,158 INFO L93 Difference]: Finished difference Result 143598 states and 233792 transitions. [2025-02-05 15:47:33,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:47:33,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 227 [2025-02-05 15:47:33,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:47:33,644 INFO L225 Difference]: With dead ends: 143598 [2025-02-05 15:47:33,645 INFO L226 Difference]: Without dead ends: 143270 [2025-02-05 15:47:33,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:47:33,703 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 141 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:47:33,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1712 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:47:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143270 states. [2025-02-05 15:47:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143270 to 143262. [2025-02-05 15:47:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143262 states, 124561 states have (on average 1.5473783929159206) internal successors, (192743), 124576 states have internal predecessors, (192743), 18652 states have call successors, (18652), 44 states have call predecessors, (18652), 48 states have return successors, (20843), 18650 states have call predecessors, (20843), 18651 states have call successors, (20843) [2025-02-05 15:47:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143262 states to 143262 states and 232238 transitions. [2025-02-05 15:47:38,748 INFO L78 Accepts]: Start accepts. Automaton has 143262 states and 232238 transitions. Word has length 227 [2025-02-05 15:47:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:47:38,749 INFO L471 AbstractCegarLoop]: Abstraction has 143262 states and 232238 transitions. [2025-02-05 15:47:38,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 15:47:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 143262 states and 232238 transitions. [2025-02-05 15:47:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 15:47:38,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:47:38,832 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 15:47:38,832 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:47:38,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:47:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1788158443, now seen corresponding path program 1 times [2025-02-05 15:47:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:47:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785250632] [2025-02-05 15:47:38,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:47:38,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 15:47:38,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 15:47:38,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:38,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:47:39,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:47:39,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785250632] [2025-02-05 15:47:39,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785250632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:47:39,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480400193] [2025-02-05 15:47:39,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:47:39,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:47:39,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:47:39,147 INFO L229 MonitoredProcess]: Starting monitored process 7 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:47:39,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:47:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 15:47:39,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 15:47:39,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:47:39,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:47:39,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 1598 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 15:47:39,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:47:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-02-05 15:47:40,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:47:40,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480400193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:47:40,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:47:40,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 26 [2025-02-05 15:47:40,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84533567] [2025-02-05 15:47:40,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:47:40,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:47:40,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:47:40,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:47:40,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:47:40,343 INFO L87 Difference]: Start difference. First operand 143262 states and 232238 transitions. Second operand has 14 states, 12 states have (on average 12.25) internal successors, (147), 11 states have internal predecessors, (147), 6 states have call successors, (33), 5 states have call predecessors, (33), 7 states have return successors, (28), 6 states have call predecessors, (28), 6 states have call successors, (28)