./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 551b0097 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-?-551b009-m [2025-01-09 03:55:47,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:55:47,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:55:47,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:55:47,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:55:47,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:55:47,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:55:47,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:55:47,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:55:47,884 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:55:47,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:55:47,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:55:47,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:55:47,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:55:47,885 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:55:47,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:55:47,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:55:47,885 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:55:47,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:55:47,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:55:47,887 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:47,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:47,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:55:47,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:55:47,888 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:55:47,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:55:47,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:55:47,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:55:47,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:55:47,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:55:47,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:55:47,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:55:47,888 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-01-09 03:55:48,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:55:48,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:55:48,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:55:48,142 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:55:48,142 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:55:48,143 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-01-09 03:55:49,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7341cdc7a/05576460ceb54ef086e722befcbd732f/FLAGef270dc43 [2025-01-09 03:55:49,731 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:55:49,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_productSimulator.cil.c [2025-01-09 03:55:49,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7341cdc7a/05576460ceb54ef086e722befcbd732f/FLAGef270dc43 [2025-01-09 03:55:49,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7341cdc7a/05576460ceb54ef086e722befcbd732f [2025-01-09 03:55:49,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:55:49,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:55:49,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:55:49,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:55:49,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:55:49,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:49" (1/1) ... [2025-01-09 03:55:49,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d441a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:49, skipping insertion in model container [2025-01-09 03:55:49,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:49" (1/1) ... [2025-01-09 03:55:50,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:55:50,292 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-01-09 03:55:50,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:55:50,537 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:55:50,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [48] [2025-01-09 03:55:50,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [111] [2025-01-09 03:55:50,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [477] [2025-01-09 03:55:50,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [692] [2025-01-09 03:55:50,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [701] [2025-01-09 03:55:50,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [811] [2025-01-09 03:55:50,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1890] [2025-01-09 03:55:50,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1907] [2025-01-09 03:55:50,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2184] [2025-01-09 03:55:50,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2539] [2025-01-09 03:55:50,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2941] [2025-01-09 03:55:50,581 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-01-09 03:55:50,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:55:50,673 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:55:50,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50 WrapperNode [2025-01-09 03:55:50,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:55:50,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:55:50,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:55:50,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:55:50,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,760 INFO L138 Inliner]: procedures = 152, calls = 268, calls flagged for inlining = 68, calls inlined = 65, statements flattened = 1341 [2025-01-09 03:55:50,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:55:50,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:55:50,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:55:50,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:55:50,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,811 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-01-09 03:55:50,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,838 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:55:50,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:55:50,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:55:50,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:55:50,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:50,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:50,914 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-01-09 03:55:50,919 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-01-09 03:55:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:55:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:55:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-01-09 03:55:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-01-09 03:55:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-01-09 03:55:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-01-09 03:55:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:55:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:55:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:55:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:55:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:55:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:55:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:55:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:55:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-01-09 03:55:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-01-09 03:55:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:55:50,942 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:55:50,942 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-01-09 03:55:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-01-09 03:55:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:55:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:55:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:55:50,943 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:55:50,943 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:55:50,945 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:55:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:55:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:55:50,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:55:50,947 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:55:50,948 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:55:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:55:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:55:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:55:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:55:50,948 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:55:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:55:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-01-09 03:55:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-01-09 03:55:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-01-09 03:55:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-01-09 03:55:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:55:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:55:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:55:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:55:51,182 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:55:51,185 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:55:52,248 INFO L? ?]: Removed 631 outVars from TransFormulas that were not future-live. [2025-01-09 03:55:52,249 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:55:52,280 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:55:52,280 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:55:52,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:52 BoogieIcfgContainer [2025-01-09 03:55:52,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:55:52,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:55:52,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:55:52,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:55:52,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:55:49" (1/3) ... [2025-01-09 03:55:52,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fe5f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:52, skipping insertion in model container [2025-01-09 03:55:52,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (2/3) ... [2025-01-09 03:55:52,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fe5f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:52, skipping insertion in model container [2025-01-09 03:55:52,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:52" (3/3) ... [2025-01-09 03:55:52,288 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_productSimulator.cil.c [2025-01-09 03:55:52,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:55:52,300 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-01-09 03:55:52,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:55:52,385 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;@5ecfc367, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:55:52,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:55:52,391 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-01-09 03:55:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 03:55:52,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:52,420 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] [2025-01-09 03:55:52,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:52,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:52,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1095301683, now seen corresponding path program 1 times [2025-01-09 03:55:52,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:52,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711704045] [2025-01-09 03:55:52,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:52,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:55:52,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:55:52,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:52,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:55:53,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:53,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711704045] [2025-01-09 03:55:53,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711704045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:53,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:53,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777756483] [2025-01-09 03:55:53,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:53,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:53,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:53,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:53,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:53,119 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 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-01-09 03:55:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:53,284 INFO L93 Difference]: Finished difference Result 1177 states and 1762 transitions. [2025-01-09 03:55:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:53,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 152 [2025-01-09 03:55:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:53,303 INFO L225 Difference]: With dead ends: 1177 [2025-01-09 03:55:53,304 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 03:55:53,312 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-01-09 03:55:53,315 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 0 mSDsluCounter, 2681 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3579 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:53,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3579 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 03:55:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-01-09 03:55:53,387 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-01-09 03:55:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 886 transitions. [2025-01-09 03:55:53,404 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 886 transitions. Word has length 152 [2025-01-09 03:55:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:53,406 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 886 transitions. [2025-01-09 03:55:53,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-01-09 03:55:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 886 transitions. [2025-01-09 03:55:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:55:53,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:53,416 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:53,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:55:53,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:53,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:53,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1328541634, now seen corresponding path program 1 times [2025-01-09 03:55:53,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:53,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472309927] [2025-01-09 03:55:53,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:53,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:55:53,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:55:53,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:53,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 03:55:53,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:53,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472309927] [2025-01-09 03:55:53,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472309927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:53,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:53,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:53,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688595000] [2025-01-09 03:55:53,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:53,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:53,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:53,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:53,653 INFO L87 Difference]: Start difference. First operand 600 states and 886 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-01-09 03:55:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:53,732 INFO L93 Difference]: Finished difference Result 1174 states and 1754 transitions. [2025-01-09 03:55:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:53,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 157 [2025-01-09 03:55:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:53,741 INFO L225 Difference]: With dead ends: 1174 [2025-01-09 03:55:53,741 INFO L226 Difference]: Without dead ends: 599 [2025-01-09 03:55:53,747 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-01-09 03:55:53,747 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-01-09 03:55:53,747 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-01-09 03:55:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-01-09 03:55:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-01-09 03:55:53,780 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-01-09 03:55:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 876 transitions. [2025-01-09 03:55:53,785 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 876 transitions. Word has length 157 [2025-01-09 03:55:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:53,788 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 876 transitions. [2025-01-09 03:55:53,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-01-09 03:55:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 876 transitions. [2025-01-09 03:55:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 03:55:53,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:53,796 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] [2025-01-09 03:55:53,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:55:53,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:53,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:53,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1560820447, now seen corresponding path program 1 times [2025-01-09 03:55:53,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:53,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046973325] [2025-01-09 03:55:53,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:53,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 03:55:53,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 03:55:53,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:53,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-09 03:55:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046973325] [2025-01-09 03:55:53,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046973325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:53,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:53,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685958696] [2025-01-09 03:55:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:53,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:53,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:53,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:53,953 INFO L87 Difference]: Start difference. First operand 599 states and 876 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-01-09 03:55:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:54,027 INFO L93 Difference]: Finished difference Result 1167 states and 1722 transitions. [2025-01-09 03:55:54,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:54,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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 180 [2025-01-09 03:55:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:54,033 INFO L225 Difference]: With dead ends: 1167 [2025-01-09 03:55:54,033 INFO L226 Difference]: Without dead ends: 598 [2025-01-09 03:55:54,037 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-01-09 03:55:54,039 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-01-09 03:55:54,040 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-01-09 03:55:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-09 03:55:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2025-01-09 03:55:54,092 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-01-09 03:55:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 872 transitions. [2025-01-09 03:55:54,100 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 872 transitions. Word has length 180 [2025-01-09 03:55:54,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:54,101 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 872 transitions. [2025-01-09 03:55:54,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-01-09 03:55:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 872 transitions. [2025-01-09 03:55:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 03:55:54,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:54,105 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-01-09 03:55:54,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:55:54,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:54,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash 914284646, now seen corresponding path program 1 times [2025-01-09 03:55:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:54,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604630031] [2025-01-09 03:55:54,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:54,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:55:54,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:55:54,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:54,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-09 03:55:54,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:54,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604630031] [2025-01-09 03:55:54,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604630031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:54,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:54,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599188328] [2025-01-09 03:55:54,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:54,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:54,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:54,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:54,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:54,250 INFO L87 Difference]: Start difference. First operand 598 states and 872 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-01-09 03:55:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:54,313 INFO L93 Difference]: Finished difference Result 1147 states and 1680 transitions. [2025-01-09 03:55:54,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:54,314 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-01-09 03:55:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:54,320 INFO L225 Difference]: With dead ends: 1147 [2025-01-09 03:55:54,320 INFO L226 Difference]: Without dead ends: 595 [2025-01-09 03:55:54,321 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-01-09 03:55:54,322 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-01-09 03:55:54,322 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-01-09 03:55:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-01-09 03:55:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2025-01-09 03:55:54,375 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-01-09 03:55:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 855 transitions. [2025-01-09 03:55:54,379 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 855 transitions. Word has length 174 [2025-01-09 03:55:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:54,379 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 855 transitions. [2025-01-09 03:55:54,379 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-01-09 03:55:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 855 transitions. [2025-01-09 03:55:54,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 03:55:54,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:54,382 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] [2025-01-09 03:55:54,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:55:54,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:54,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:54,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1914876487, now seen corresponding path program 1 times [2025-01-09 03:55:54,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:54,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544508471] [2025-01-09 03:55:54,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:54,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:54,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 03:55:54,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 03:55:54,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:54,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-09 03:55:54,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544508471] [2025-01-09 03:55:54,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544508471] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207419376] [2025-01-09 03:55:54,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:54,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:54,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:54,649 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-01-09 03:55:54,650 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-01-09 03:55:54,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 03:55:55,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 03:55:55,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:55,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:55,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:55:55,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 03:55:55,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:55,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207419376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:55,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:55:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61273594] [2025-01-09 03:55:55,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:55,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:55,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:55,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:55:55,066 INFO L87 Difference]: Start difference. First operand 595 states and 855 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, (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-01-09 03:55:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:55,104 INFO L93 Difference]: Finished difference Result 925 states and 1311 transitions. [2025-01-09 03:55:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:55,105 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, (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 192 [2025-01-09 03:55:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:55,111 INFO L225 Difference]: With dead ends: 925 [2025-01-09 03:55:55,111 INFO L226 Difference]: Without dead ends: 597 [2025-01-09 03:55:55,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 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-01-09 03:55:55,113 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 1 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:55,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1700 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-01-09 03:55:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 596. [2025-01-09 03:55:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 446 states have (on average 1.4506726457399104) internal successors, (647), 457 states have internal predecessors, (647), 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-01-09 03:55:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 856 transitions. [2025-01-09 03:55:55,153 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 856 transitions. Word has length 192 [2025-01-09 03:55:55,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:55,154 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 856 transitions. [2025-01-09 03:55:55,154 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, (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-01-09 03:55:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 856 transitions. [2025-01-09 03:55:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 03:55:55,157 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:55,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:55,166 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-01-09 03:55:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:55,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:55,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2039488802, now seen corresponding path program 1 times [2025-01-09 03:55:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049942235] [2025-01-09 03:55:55,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:55,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 03:55:55,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 03:55:55,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:55,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-09 03:55:55,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:55,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049942235] [2025-01-09 03:55:55,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049942235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:55,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292225103] [2025-01-09 03:55:55,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:55,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:55,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:55,698 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-01-09 03:55:55,700 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-01-09 03:55:55,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 03:55:56,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 03:55:56,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:56,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:56,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1536 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:55:56,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 03:55:56,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:56,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292225103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:56,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:56,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-01-09 03:55:56,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993544169] [2025-01-09 03:55:56,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:56,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:56,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:56,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:56,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:55:56,060 INFO L87 Difference]: Start difference. First operand 596 states and 856 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (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-01-09 03:55:56,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:56,101 INFO L93 Difference]: Finished difference Result 1212 states and 1773 transitions. [2025-01-09 03:55:56,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:56,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (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 206 [2025-01-09 03:55:56,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:56,106 INFO L225 Difference]: With dead ends: 1212 [2025-01-09 03:55:56,106 INFO L226 Difference]: Without dead ends: 693 [2025-01-09 03:55:56,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 206 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-01-09 03:55:56,108 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 165 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1687 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-01-09 03:55:56,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1687 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-01-09 03:55:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 685. [2025-01-09 03:55:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 532 states have internal predecessors, (764), 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-01-09 03:55:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1001 transitions. [2025-01-09 03:55:56,144 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1001 transitions. Word has length 206 [2025-01-09 03:55:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:56,144 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1001 transitions. [2025-01-09 03:55:56,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (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-01-09 03:55:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1001 transitions. [2025-01-09 03:55:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 03:55:56,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:56,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:56,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:56,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:56,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:56,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1717633978, now seen corresponding path program 1 times [2025-01-09 03:55:56,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:56,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097158313] [2025-01-09 03:55:56,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:56,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:56,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 03:55:56,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 03:55:56,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-09 03:55:56,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:56,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097158313] [2025-01-09 03:55:56,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097158313] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:56,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911336974] [2025-01-09 03:55:56,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:56,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:56,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:56,646 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-01-09 03:55:56,648 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-01-09 03:55:56,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 03:55:57,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 03:55:57,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:57,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:57,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 03:55:57,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 03:55:57,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:57,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911336974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:57,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:57,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-01-09 03:55:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208271140] [2025-01-09 03:55:57,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:57,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:55:57,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:57,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:55:57,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:55:57,111 INFO L87 Difference]: Start difference. First operand 685 states and 1001 transitions. Second operand has 8 states, 6 states have (on average 20.5) internal successors, (123), 8 states have internal predecessors, (123), 4 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 03:55:57,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:57,239 INFO L93 Difference]: Finished difference Result 1317 states and 1939 transitions. [2025-01-09 03:55:57,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:55:57,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 20.5) internal successors, (123), 8 states have internal predecessors, (123), 4 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 207 [2025-01-09 03:55:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:57,245 INFO L225 Difference]: With dead ends: 1317 [2025-01-09 03:55:57,245 INFO L226 Difference]: Without dead ends: 687 [2025-01-09 03:55:57,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 202 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-01-09 03:55:57,248 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-01-09 03:55:57,248 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-01-09 03:55:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-01-09 03:55:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2025-01-09 03:55:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 522 states have (on average 1.4655172413793103) internal successors, (765), 534 states have internal predecessors, (765), 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-01-09 03:55:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1004 transitions. [2025-01-09 03:55:57,283 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1004 transitions. Word has length 207 [2025-01-09 03:55:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:57,284 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1004 transitions. [2025-01-09 03:55:57,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 20.5) internal successors, (123), 8 states have internal predecessors, (123), 4 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 03:55:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1004 transitions. [2025-01-09 03:55:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 03:55:57,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:57,287 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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] [2025-01-09 03:55:57,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:55:57,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:57,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:57,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 543129485, now seen corresponding path program 1 times [2025-01-09 03:55:57,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:57,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139925018] [2025-01-09 03:55:57,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:57,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 03:55:57,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 03:55:57,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:57,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 03:55:57,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:57,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139925018] [2025-01-09 03:55:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139925018] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:57,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017775803] [2025-01-09 03:55:57,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:57,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:57,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:57,719 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-01-09 03:55:57,719 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-01-09 03:55:57,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 03:55:58,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 03:55:58,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:58,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:58,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:55:58,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 03:55:58,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:58,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017775803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:58,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:58,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-01-09 03:55:58,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190696796] [2025-01-09 03:55:58,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:58,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:55:58,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:58,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:55:58,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:55:58,122 INFO L87 Difference]: Start difference. First operand 687 states and 1004 transitions. Second operand has 6 states, 5 states have (on average 24.0) internal successors, (120), 6 states have internal predecessors, (120), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 03:55:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:58,205 INFO L93 Difference]: Finished difference Result 1318 states and 1943 transitions. [2025-01-09 03:55:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:55:58,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.0) internal successors, (120), 6 states have internal predecessors, (120), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 201 [2025-01-09 03:55:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:58,210 INFO L225 Difference]: With dead ends: 1318 [2025-01-09 03:55:58,211 INFO L226 Difference]: Without dead ends: 689 [2025-01-09 03:55:58,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 198 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-01-09 03:55:58,213 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-01-09 03:55:58,214 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-01-09 03:55:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-01-09 03:55:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-01-09 03:55:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 523 states have (on average 1.4646271510516253) internal successors, (766), 536 states have internal predecessors, (766), 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-01-09 03:55:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1010 transitions. [2025-01-09 03:55:58,246 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1010 transitions. Word has length 201 [2025-01-09 03:55:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:58,247 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1010 transitions. [2025-01-09 03:55:58,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.0) internal successors, (120), 6 states have internal predecessors, (120), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 03:55:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1010 transitions. [2025-01-09 03:55:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 03:55:58,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:58,251 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] [2025-01-09 03:55:58,259 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-01-09 03:55:58,455 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,SelfDestructingSolverStorable7 [2025-01-09 03:55:58,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:58,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2046760363, now seen corresponding path program 1 times [2025-01-09 03:55:58,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:58,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066690081] [2025-01-09 03:55:58,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:58,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:58,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 03:55:58,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 03:55:58,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:58,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-09 03:55:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066690081] [2025-01-09 03:55:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066690081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:58,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:55:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552791209] [2025-01-09 03:55:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:58,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:55:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:58,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:55:58,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:58,707 INFO L87 Difference]: Start difference. First operand 689 states and 1010 transitions. Second operand has 8 states, 6 states have (on average 19.333333333333332) internal successors, (116), 8 states have internal predecessors, (116), 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-01-09 03:55:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:58,805 INFO L93 Difference]: Finished difference Result 1306 states and 1930 transitions. [2025-01-09 03:55:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:55:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 19.333333333333332) internal successors, (116), 8 states have internal predecessors, (116), 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 202 [2025-01-09 03:55:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:58,810 INFO L225 Difference]: With dead ends: 1306 [2025-01-09 03:55:58,810 INFO L226 Difference]: Without dead ends: 689 [2025-01-09 03:55:58,812 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-01-09 03:55:58,812 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-01-09 03:55:58,813 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-01-09 03:55:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-01-09 03:55:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-01-09 03:55:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 523 states have (on average 1.4646271510516253) internal successors, (766), 536 states have internal predecessors, (766), 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-01-09 03:55:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1009 transitions. [2025-01-09 03:55:58,842 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1009 transitions. Word has length 202 [2025-01-09 03:55:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:58,842 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1009 transitions. [2025-01-09 03:55:58,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 19.333333333333332) internal successors, (116), 8 states have internal predecessors, (116), 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-01-09 03:55:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1009 transitions. [2025-01-09 03:55:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 03:55:58,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:58,845 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] [2025-01-09 03:55:58,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:55:58,846 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:58,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1543124375, now seen corresponding path program 2 times [2025-01-09 03:55:58,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:58,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827262819] [2025-01-09 03:55:58,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:55:58,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:58,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 203 statements into 2 equivalence classes. [2025-01-09 03:55:58,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 03:55:58,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:55:58,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:55:59,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:59,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827262819] [2025-01-09 03:55:59,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827262819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:59,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:59,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:55:59,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388928504] [2025-01-09 03:55:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:59,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:55:59,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:59,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:55:59,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:59,029 INFO L87 Difference]: Start difference. First operand 689 states and 1009 transitions. Second operand has 6 states, 5 states have (on average 23.2) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 03:55:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:59,102 INFO L93 Difference]: Finished difference Result 1303 states and 1924 transitions. [2025-01-09 03:55:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:55:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.2) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 203 [2025-01-09 03:55:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:59,108 INFO L225 Difference]: With dead ends: 1303 [2025-01-09 03:55:59,108 INFO L226 Difference]: Without dead ends: 689 [2025-01-09 03:55:59,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:59,111 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 2 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4198 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:59,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4198 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-01-09 03:55:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-01-09 03:55:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 523 states have (on average 1.4646271510516253) internal successors, (766), 536 states have internal predecessors, (766), 119 states have call successors, (119), 44 states have call predecessors, (119), 46 states have return successors, (123), 117 states have call predecessors, (123), 118 states have call successors, (123) [2025-01-09 03:55:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1008 transitions. [2025-01-09 03:55:59,141 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1008 transitions. Word has length 203 [2025-01-09 03:55:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:59,141 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1008 transitions. [2025-01-09 03:55:59,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.2) internal successors, (116), 6 states have internal predecessors, (116), 3 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-01-09 03:55:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1008 transitions. [2025-01-09 03:55:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 03:55:59,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:59,146 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] [2025-01-09 03:55:59,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:55:59,146 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:59,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash 777169208, now seen corresponding path program 1 times [2025-01-09 03:55:59,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:59,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942344124] [2025-01-09 03:55:59,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:59,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:59,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 03:55:59,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 03:55:59,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:59,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:55:59,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:59,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942344124] [2025-01-09 03:55:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942344124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:59,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:59,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:55:59,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326394430] [2025-01-09 03:55:59,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:59,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:55:59,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:59,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:55:59,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:59,360 INFO L87 Difference]: Start difference. First operand 689 states and 1008 transitions. Second operand has 8 states, 6 states have (on average 20.333333333333332) internal successors, (122), 8 states have internal predecessors, (122), 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-01-09 03:55:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:59,451 INFO L93 Difference]: Finished difference Result 1308 states and 1931 transitions. [2025-01-09 03:55:59,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:55:59,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 20.333333333333332) internal successors, (122), 8 states have internal predecessors, (122), 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 211 [2025-01-09 03:55:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:59,456 INFO L225 Difference]: With dead ends: 1308 [2025-01-09 03:55:59,457 INFO L226 Difference]: Without dead ends: 691 [2025-01-09 03:55:59,459 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-01-09 03:55:59,459 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-01-09 03:55:59,459 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-01-09 03:55:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-01-09 03:55:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2025-01-09 03:55:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 524 states have (on average 1.463740458015267) internal successors, (767), 538 states have internal predecessors, (767), 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-01-09 03:55:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1011 transitions. [2025-01-09 03:55:59,488 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1011 transitions. Word has length 211 [2025-01-09 03:55:59,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:59,489 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1011 transitions. [2025-01-09 03:55:59,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 20.333333333333332) internal successors, (122), 8 states have internal predecessors, (122), 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-01-09 03:55:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1011 transitions. [2025-01-09 03:55:59,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 03:55:59,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:59,492 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-01-09 03:55:59,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:55:59,493 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:59,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:59,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1927302024, now seen corresponding path program 1 times [2025-01-09 03:55:59,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:59,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881525979] [2025-01-09 03:55:59,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:59,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 03:55:59,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 03:55:59,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:59,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 03:55:59,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881525979] [2025-01-09 03:55:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881525979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:59,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:59,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:55:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881990132] [2025-01-09 03:55:59,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:59,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:55:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:59,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:55:59,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:59,706 INFO L87 Difference]: Start difference. First operand 691 states and 1011 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), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-01-09 03:55:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:59,823 INFO L93 Difference]: Finished difference Result 1310 states and 1934 transitions. [2025-01-09 03:55:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:55:59,824 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), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 205 [2025-01-09 03:55:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:59,831 INFO L225 Difference]: With dead ends: 1310 [2025-01-09 03:55:59,831 INFO L226 Difference]: Without dead ends: 693 [2025-01-09 03:55:59,835 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-01-09 03:55:59,835 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 2 mSDsluCounter, 5035 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5877 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:59,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5877 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-01-09 03:55:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2025-01-09 03:55:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 524 states have (on average 1.463740458015267) internal successors, (767), 538 states have internal predecessors, (767), 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-01-09 03:55:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1011 transitions. [2025-01-09 03:55:59,874 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1011 transitions. Word has length 205 [2025-01-09 03:55:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:59,875 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1011 transitions. [2025-01-09 03:55:59,875 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), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-01-09 03:55:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1011 transitions. [2025-01-09 03:55:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 03:55:59,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:59,879 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, 1, 1] [2025-01-09 03:55:59,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:55:59,879 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:59,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash 868446463, now seen corresponding path program 1 times [2025-01-09 03:55:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331140333] [2025-01-09 03:55:59,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:59,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 03:55:59,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 03:55:59,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:59,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:00,067 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 03:56:00,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:00,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331140333] [2025-01-09 03:56:00,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331140333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:00,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:00,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 03:56:00,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542388534] [2025-01-09 03:56:00,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:00,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 03:56:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:00,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 03:56:00,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:56:00,069 INFO L87 Difference]: Start difference. First operand 691 states and 1011 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-01-09 03:56:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:00,216 INFO L93 Difference]: Finished difference Result 1309 states and 1936 transitions. [2025-01-09 03:56:00,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 03:56:00,217 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 212 [2025-01-09 03:56:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:00,222 INFO L225 Difference]: With dead ends: 1309 [2025-01-09 03:56:00,222 INFO L226 Difference]: Without dead ends: 695 [2025-01-09 03:56:00,224 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-01-09 03:56:00,226 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-01-09 03:56:00,226 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-01-09 03:56:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-01-09 03:56:00,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2025-01-09 03:56:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 525 states have (on average 1.4628571428571429) internal successors, (768), 540 states have internal predecessors, (768), 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-01-09 03:56:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1017 transitions. [2025-01-09 03:56:00,264 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1017 transitions. Word has length 212 [2025-01-09 03:56:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:00,265 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1017 transitions. [2025-01-09 03:56:00,265 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-01-09 03:56:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1017 transitions. [2025-01-09 03:56:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 03:56:00,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:00,268 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] [2025-01-09 03:56:00,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:56:00,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:00,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:00,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1534645168, now seen corresponding path program 1 times [2025-01-09 03:56:00,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:00,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769698716] [2025-01-09 03:56:00,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:00,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:00,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 03:56:00,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 03:56:00,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:00,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:00,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:00,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769698716] [2025-01-09 03:56:00,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769698716] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:00,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713911209] [2025-01-09 03:56:00,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:00,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:00,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:00,405 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-01-09 03:56:00,407 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-01-09 03:56:00,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 03:56:00,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 03:56:00,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:00,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:00,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:56:00,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:00,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:56:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:00,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713911209] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:56:00,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:56:00,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:56:00,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947623479] [2025-01-09 03:56:00,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:56:00,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:56:00,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:00,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:56:00,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:56:00,921 INFO L87 Difference]: Start difference. First operand 693 states and 1017 transitions. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 03:56:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:01,090 INFO L93 Difference]: Finished difference Result 1578 states and 2389 transitions. [2025-01-09 03:56:01,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:56:01,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 213 [2025-01-09 03:56:01,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:01,097 INFO L225 Difference]: With dead ends: 1578 [2025-01-09 03:56:01,097 INFO L226 Difference]: Without dead ends: 1250 [2025-01-09 03:56:01,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 423 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-01-09 03:56:01,099 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 629 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:01,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 3151 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:56:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-01-09 03:56:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1226. [2025-01-09 03:56:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 979 states have (on average 1.5178753830439224) internal successors, (1486), 994 states have internal predecessors, (1486), 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-01-09 03:56:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1903 transitions. [2025-01-09 03:56:01,148 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1903 transitions. Word has length 213 [2025-01-09 03:56:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:01,148 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1903 transitions. [2025-01-09 03:56:01,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-01-09 03:56:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1903 transitions. [2025-01-09 03:56:01,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 03:56:01,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:01,154 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-01-09 03:56:01,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:56:01,355 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-01-09 03:56:01,355 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:01,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1040935981, now seen corresponding path program 1 times [2025-01-09 03:56:01,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:01,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336355189] [2025-01-09 03:56:01,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:01,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:01,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 03:56:01,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 03:56:01,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:01,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:01,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336355189] [2025-01-09 03:56:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336355189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:01,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:01,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489980780] [2025-01-09 03:56:01,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:01,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:01,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:01,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:01,424 INFO L87 Difference]: Start difference. First operand 1226 states and 1903 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-01-09 03:56:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:01,474 INFO L93 Difference]: Finished difference Result 2821 states and 4450 transitions. [2025-01-09 03:56:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:01,475 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-01-09 03:56:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:01,484 INFO L225 Difference]: With dead ends: 2821 [2025-01-09 03:56:01,484 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 03:56:01,488 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-01-09 03:56:01,489 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 163 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1719 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-01-09 03:56:01,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1719 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:01,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 03:56:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1720. [2025-01-09 03:56:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1394 states have (on average 1.5315638450502151) internal successors, (2135), 1409 states have internal predecessors, (2135), 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-01-09 03:56:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2720 transitions. [2025-01-09 03:56:01,545 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2720 transitions. Word has length 211 [2025-01-09 03:56:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:01,546 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2720 transitions. [2025-01-09 03:56:01,546 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-01-09 03:56:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2720 transitions. [2025-01-09 03:56:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 03:56:01,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:01,553 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] [2025-01-09 03:56:01,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:56:01,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:01,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1065232551, now seen corresponding path program 1 times [2025-01-09 03:56:01,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:01,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517140658] [2025-01-09 03:56:01,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:01,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:01,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 03:56:01,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 03:56:01,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:01,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:01,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:01,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517140658] [2025-01-09 03:56:01,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517140658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:01,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:01,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:01,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839549738] [2025-01-09 03:56:01,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:01,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:01,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:01,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:01,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:01,640 INFO L87 Difference]: Start difference. First operand 1720 states and 2720 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-01-09 03:56:01,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:01,695 INFO L93 Difference]: Finished difference Result 4051 states and 6474 transitions. [2025-01-09 03:56:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:01,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 212 [2025-01-09 03:56:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:01,708 INFO L225 Difference]: With dead ends: 4051 [2025-01-09 03:56:01,708 INFO L226 Difference]: Without dead ends: 2525 [2025-01-09 03:56:01,714 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-01-09 03:56:01,714 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-01-09 03:56:01,714 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-01-09 03:56:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2525 states. [2025-01-09 03:56:01,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2525 to 2517. [2025-01-09 03:56:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2072 states have (on average 1.545849420849421) internal successors, (3203), 2087 states have internal predecessors, (3203), 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-01-09 03:56:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 4026 transitions. [2025-01-09 03:56:01,795 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 4026 transitions. Word has length 212 [2025-01-09 03:56:01,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:01,795 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 4026 transitions. [2025-01-09 03:56:01,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-01-09 03:56:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 4026 transitions. [2025-01-09 03:56:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 03:56:01,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:01,806 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-01-09 03:56:01,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:56:01,806 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:01,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:01,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1761916897, now seen corresponding path program 1 times [2025-01-09 03:56:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:01,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806207497] [2025-01-09 03:56:01,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:01,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 03:56:01,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 03:56:01,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:01,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:01,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:01,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806207497] [2025-01-09 03:56:01,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806207497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:01,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:01,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:01,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107842106] [2025-01-09 03:56:01,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:01,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:01,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:01,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:01,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:01,876 INFO L87 Difference]: Start difference. First operand 2517 states and 4026 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-01-09 03:56:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:01,955 INFO L93 Difference]: Finished difference Result 5922 states and 9569 transitions. [2025-01-09 03:56:01,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:01,955 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-01-09 03:56:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:01,975 INFO L225 Difference]: With dead ends: 5922 [2025-01-09 03:56:01,976 INFO L226 Difference]: Without dead ends: 3752 [2025-01-09 03:56:01,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:01,984 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-01-09 03:56:01,985 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-01-09 03:56:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2025-01-09 03:56:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3744. [2025-01-09 03:56:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3137 states have (on average 1.5578578259483582) internal successors, (4887), 3152 states have internal predecessors, (4887), 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-01-09 03:56:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 6050 transitions. [2025-01-09 03:56:02,157 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 6050 transitions. Word has length 220 [2025-01-09 03:56:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:02,157 INFO L471 AbstractCegarLoop]: Abstraction has 3744 states and 6050 transitions. [2025-01-09 03:56:02,157 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-01-09 03:56:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 6050 transitions. [2025-01-09 03:56:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 03:56:02,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:02,173 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-01-09 03:56:02,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:56:02,173 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:02,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:02,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1481590598, now seen corresponding path program 1 times [2025-01-09 03:56:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:02,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333097913] [2025-01-09 03:56:02,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:02,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:02,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 03:56:02,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 03:56:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:02,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:02,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333097913] [2025-01-09 03:56:02,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333097913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:02,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:02,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847351785] [2025-01-09 03:56:02,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:02,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:02,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:02,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:02,243 INFO L87 Difference]: Start difference. First operand 3744 states and 6050 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-01-09 03:56:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:02,355 INFO L93 Difference]: Finished difference Result 8878 states and 14475 transitions. [2025-01-09 03:56:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:02,355 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-01-09 03:56:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:02,385 INFO L225 Difference]: With dead ends: 8878 [2025-01-09 03:56:02,385 INFO L226 Difference]: Without dead ends: 5733 [2025-01-09 03:56:02,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:02,396 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-01-09 03:56:02,396 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-01-09 03:56:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2025-01-09 03:56:02,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 5725. [2025-01-09 03:56:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5725 states, 4873 states have (on average 1.5678226964908681) internal successors, (7640), 4888 states have internal predecessors, (7640), 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-01-09 03:56:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5725 states to 5725 states and 9319 transitions. [2025-01-09 03:56:02,707 INFO L78 Accepts]: Start accepts. Automaton has 5725 states and 9319 transitions. Word has length 221 [2025-01-09 03:56:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:02,707 INFO L471 AbstractCegarLoop]: Abstraction has 5725 states and 9319 transitions. [2025-01-09 03:56:02,708 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-01-09 03:56:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 5725 states and 9319 transitions. [2025-01-09 03:56:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 03:56:02,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:02,728 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] [2025-01-09 03:56:02,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:56:02,728 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:02,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:02,729 INFO L85 PathProgramCache]: Analyzing trace with hash -992378892, now seen corresponding path program 1 times [2025-01-09 03:56:02,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:02,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066116260] [2025-01-09 03:56:02,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:02,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:02,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 03:56:02,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 03:56:02,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:02,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066116260] [2025-01-09 03:56:02,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066116260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:02,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:02,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:02,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113870753] [2025-01-09 03:56:02,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:02,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:02,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:02,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:02,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:02,802 INFO L87 Difference]: Start difference. First operand 5725 states and 9319 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-01-09 03:56:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:02,983 INFO L93 Difference]: Finished difference Result 13794 states and 22596 transitions. [2025-01-09 03:56:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:02,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 222 [2025-01-09 03:56:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:03,020 INFO L225 Difference]: With dead ends: 13794 [2025-01-09 03:56:03,021 INFO L226 Difference]: Without dead ends: 9053 [2025-01-09 03:56:03,036 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-01-09 03:56:03,037 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 155 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1691 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-01-09 03:56:03,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1691 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9053 states. [2025-01-09 03:56:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9053 to 9045. [2025-01-09 03:56:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9045 states, 7700 states have (on average 1.566103896103896) internal successors, (12059), 7715 states have internal predecessors, (12059), 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-01-09 03:56:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 14768 transitions. [2025-01-09 03:56:03,444 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 14768 transitions. Word has length 222 [2025-01-09 03:56:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:03,445 INFO L471 AbstractCegarLoop]: Abstraction has 9045 states and 14768 transitions. [2025-01-09 03:56:03,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-01-09 03:56:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 14768 transitions. [2025-01-09 03:56:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 03:56:03,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:03,475 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] [2025-01-09 03:56:03,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:56:03,476 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:03,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:03,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2119653233, now seen corresponding path program 1 times [2025-01-09 03:56:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004435024] [2025-01-09 03:56:03,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:03,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 03:56:03,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 03:56:03,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:03,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:03,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:03,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004435024] [2025-01-09 03:56:03,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004435024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:03,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:03,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:03,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060275998] [2025-01-09 03:56:03,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:03,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:03,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:03,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:03,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:03,536 INFO L87 Difference]: Start difference. First operand 9045 states and 14768 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-01-09 03:56:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:03,825 INFO L93 Difference]: Finished difference Result 22614 states and 37228 transitions. [2025-01-09 03:56:03,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:03,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 223 [2025-01-09 03:56:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:03,884 INFO L225 Difference]: With dead ends: 22614 [2025-01-09 03:56:03,884 INFO L226 Difference]: Without dead ends: 15033 [2025-01-09 03:56:03,908 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-01-09 03:56:03,911 INFO L435 NwaCegarLoop]: 852 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, 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-01-09 03:56:03,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1696 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15033 states. [2025-01-09 03:56:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15033 to 15025. [2025-01-09 03:56:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15025 states, 12858 states have (on average 1.5723285114325711) internal successors, (20217), 12873 states have internal predecessors, (20217), 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-01-09 03:56:04,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15025 states to 15025 states and 24648 transitions. [2025-01-09 03:56:04,428 INFO L78 Accepts]: Start accepts. Automaton has 15025 states and 24648 transitions. Word has length 223 [2025-01-09 03:56:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:04,429 INFO L471 AbstractCegarLoop]: Abstraction has 15025 states and 24648 transitions. [2025-01-09 03:56:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-01-09 03:56:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 15025 states and 24648 transitions. [2025-01-09 03:56:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 03:56:04,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:04,465 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-01-09 03:56:04,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:56:04,466 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:04,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:04,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1358817787, now seen corresponding path program 1 times [2025-01-09 03:56:04,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:04,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764019456] [2025-01-09 03:56:04,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:04,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 03:56:04,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 03:56:04,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:04,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764019456] [2025-01-09 03:56:04,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764019456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:04,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:04,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:04,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544815674] [2025-01-09 03:56:04,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:04,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:04,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:04,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:04,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:04,532 INFO L87 Difference]: Start difference. First operand 15025 states and 24648 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-01-09 03:56:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:05,148 INFO L93 Difference]: Finished difference Result 36185 states and 59093 transitions. [2025-01-09 03:56:05,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:05,148 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-01-09 03:56:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:05,251 INFO L225 Difference]: With dead ends: 36185 [2025-01-09 03:56:05,251 INFO L226 Difference]: Without dead ends: 23736 [2025-01-09 03:56:05,297 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-01-09 03:56:05,298 INFO L435 NwaCegarLoop]: 867 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, 1683 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-01-09 03:56:05,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1683 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23736 states. [2025-01-09 03:56:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23736 to 23728. [2025-01-09 03:56:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23728 states, 20358 states have (on average 1.5457805285391493) internal successors, (31469), 20373 states have internal predecessors, (31469), 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-01-09 03:56:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23728 states to 23728 states and 38450 transitions. [2025-01-09 03:56:06,276 INFO L78 Accepts]: Start accepts. Automaton has 23728 states and 38450 transitions. Word has length 224 [2025-01-09 03:56:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:06,276 INFO L471 AbstractCegarLoop]: Abstraction has 23728 states and 38450 transitions. [2025-01-09 03:56:06,276 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-01-09 03:56:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 23728 states and 38450 transitions. [2025-01-09 03:56:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 03:56:06,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:06,316 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-01-09 03:56:06,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:56:06,316 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:06,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1520860903, now seen corresponding path program 1 times [2025-01-09 03:56:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391108267] [2025-01-09 03:56:06,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:06,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 03:56:06,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 03:56:06,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:06,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:06,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:06,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391108267] [2025-01-09 03:56:06,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391108267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:06,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:06,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:06,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666078958] [2025-01-09 03:56:06,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:06,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:06,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:06,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:06,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:06,380 INFO L87 Difference]: Start difference. First operand 23728 states and 38450 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-01-09 03:56:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:07,118 INFO L93 Difference]: Finished difference Result 62598 states and 101801 transitions. [2025-01-09 03:56:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:07,119 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-01-09 03:56:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:07,291 INFO L225 Difference]: With dead ends: 62598 [2025-01-09 03:56:07,292 INFO L226 Difference]: Without dead ends: 42229 [2025-01-09 03:56:07,350 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-01-09 03:56:07,352 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-01-09 03:56:07,352 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-01-09 03:56:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42229 states. [2025-01-09 03:56:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42229 to 42221. [2025-01-09 03:56:08,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42221 states, 36401 states have (on average 1.5457267657481937) internal successors, (56266), 36416 states have internal predecessors, (56266), 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-01-09 03:56:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42221 states to 42221 states and 68421 transitions. [2025-01-09 03:56:08,728 INFO L78 Accepts]: Start accepts. Automaton has 42221 states and 68421 transitions. Word has length 225 [2025-01-09 03:56:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 42221 states and 68421 transitions. [2025-01-09 03:56:08,729 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-01-09 03:56:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 42221 states and 68421 transitions. [2025-01-09 03:56:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 03:56:08,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:08,790 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-01-09 03:56:08,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:56:08,791 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:08,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:08,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1206736073, now seen corresponding path program 1 times [2025-01-09 03:56:08,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:08,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135840434] [2025-01-09 03:56:08,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:08,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:08,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 03:56:08,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 03:56:08,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:08,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:08,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:08,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135840434] [2025-01-09 03:56:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135840434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:08,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:08,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329707157] [2025-01-09 03:56:08,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:08,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:08,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:08,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:08,870 INFO L87 Difference]: Start difference. First operand 42221 states and 68421 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-01-09 03:56:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:10,789 INFO L93 Difference]: Finished difference Result 114425 states and 186388 transitions. [2025-01-09 03:56:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:10,790 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-01-09 03:56:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:11,059 INFO L225 Difference]: With dead ends: 114425 [2025-01-09 03:56:11,059 INFO L226 Difference]: Without dead ends: 76702 [2025-01-09 03:56:11,130 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-01-09 03:56:11,131 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-01-09 03:56:11,131 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-01-09 03:56:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76702 states. [2025-01-09 03:56:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76702 to 76694. [2025-01-09 03:56:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76694 states, 66361 states have (on average 1.5493889483280843) internal successors, (102819), 66376 states have internal predecessors, (102819), 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-01-09 03:56:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76694 states to 76694 states and 124532 transitions. [2025-01-09 03:56:13,621 INFO L78 Accepts]: Start accepts. Automaton has 76694 states and 124532 transitions. Word has length 219 [2025-01-09 03:56:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:13,622 INFO L471 AbstractCegarLoop]: Abstraction has 76694 states and 124532 transitions. [2025-01-09 03:56:13,622 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-01-09 03:56:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 76694 states and 124532 transitions. [2025-01-09 03:56:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-01-09 03:56:13,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:13,703 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-01-09 03:56:13,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:56:13,703 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:13,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash 473152799, now seen corresponding path program 1 times [2025-01-09 03:56:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:13,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13231227] [2025-01-09 03:56:13,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:13,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 03:56:13,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 03:56:13,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:13,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-09 03:56:13,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:13,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13231227] [2025-01-09 03:56:13,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13231227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:13,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:13,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544401648] [2025-01-09 03:56:13,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:13,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:13,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:13,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:13,785 INFO L87 Difference]: Start difference. First operand 76694 states and 124532 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-01-09 03:56:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:16,704 INFO L93 Difference]: Finished difference Result 143367 states and 233561 transitions. [2025-01-09 03:56:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:16,704 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-01-09 03:56:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:17,176 INFO L225 Difference]: With dead ends: 143367 [2025-01-09 03:56:17,176 INFO L226 Difference]: Without dead ends: 143039 [2025-01-09 03:56:17,249 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-01-09 03:56:17,250 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-01-09 03:56:17,250 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-01-09 03:56:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143039 states. [2025-01-09 03:56:20,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143039 to 143031. [2025-01-09 03:56:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143031 states, 124330 states have (on average 1.5483953993404649) internal successors, (192512), 124345 states have internal predecessors, (192512), 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-01-09 03:56:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143031 states to 143031 states and 232007 transitions. [2025-01-09 03:56:21,562 INFO L78 Accepts]: Start accepts. Automaton has 143031 states and 232007 transitions. Word has length 227 [2025-01-09 03:56:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:21,563 INFO L471 AbstractCegarLoop]: Abstraction has 143031 states and 232007 transitions. [2025-01-09 03:56:21,563 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-01-09 03:56:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 143031 states and 232007 transitions. [2025-01-09 03:56:21,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-01-09 03:56:21,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:21,654 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-01-09 03:56:21,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 03:56:21,655 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__before__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:21,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2011736959, now seen corresponding path program 1 times [2025-01-09 03:56:21,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:21,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034186148] [2025-01-09 03:56:21,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:21,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 03:56:21,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 03:56:21,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:21,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-01-09 03:56:21,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034186148] [2025-01-09 03:56:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034186148] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347605630] [2025-01-09 03:56:21,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:21,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:21,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:21,976 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-01-09 03:56:21,978 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-01-09 03:56:22,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 03:56:22,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 03:56:22,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:22,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:22,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 03:56:22,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 03:56:22,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:22,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347605630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:22,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:22,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 26 [2025-01-09 03:56:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000455559] [2025-01-09 03:56:22,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:22,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 03:56:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:22,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 03:56:22,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2025-01-09 03:56:22,842 INFO L87 Difference]: Start difference. First operand 143031 states and 232007 transitions. Second operand has 14 states, 12 states have (on average 11.833333333333334) internal successors, (142), 11 states have internal predecessors, (142), 6 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) [2025-01-09 03:56:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:29,844 INFO L93 Difference]: Finished difference Result 285070 states and 467875 transitions. [2025-01-09 03:56:29,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 03:56:29,845 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 11.833333333333334) internal successors, (142), 11 states have internal predecessors, (142), 6 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (27), 6 states have call predecessors, (27), 6 states have call successors, (27) Word has length 221 [2025-01-09 03:56:29,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:31,035 INFO L225 Difference]: With dead ends: 285070 [2025-01-09 03:56:31,035 INFO L226 Difference]: Without dead ends: 284748 [2025-01-09 03:56:31,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=1512, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 03:56:31,134 INFO L435 NwaCegarLoop]: 1013 mSDtfsCounter, 1374 mSDsluCounter, 8560 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 9573 SdHoareTripleChecker+Invalid, 3156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:31,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 9573 Invalid, 3156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 03:56:31,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284748 states.