./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec7_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec7_productSimulator.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d8908adfa5a1758f016a2fa64af2c05db2b3cc5d1fb9ac5b8aa70e5689b8434 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:26:11,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:26:11,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:26:11,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:26:11,447 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:26:11,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:26:11,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:26:11,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:26:11,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:26:11,466 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:26:11,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:26:11,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:26:11,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:26:11,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:26:11,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:26:11,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:26:11,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:26:11,466 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:26:11,467 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:26:11,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:11,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:26:11,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:26:11,468 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:26:11,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:26:11,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:26:11,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:26:11,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:26:11,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:26:11,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:26:11,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:26:11,468 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1d8908adfa5a1758f016a2fa64af2c05db2b3cc5d1fb9ac5b8aa70e5689b8434 [2025-03-03 14:26:11,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:26:11,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:26:11,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:26:11,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:26:11,712 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:26:11,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec7_productSimulator.cil.c [2025-03-03 14:26:12,873 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1532df17/39c6d89ccbce4417b09c3ed030254c34/FLAG8ded3e62e [2025-03-03 14:26:13,215 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:26:13,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_productSimulator.cil.c [2025-03-03 14:26:13,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1532df17/39c6d89ccbce4417b09c3ed030254c34/FLAG8ded3e62e [2025-03-03 14:26:13,463 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1532df17/39c6d89ccbce4417b09c3ed030254c34 [2025-03-03 14:26:13,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:26:13,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:26:13,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:13,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:26:13,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:26:13,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:13" (1/1) ... [2025-03-03 14:26:13,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c50513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:13, skipping insertion in model container [2025-03-03 14:26:13,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:13" (1/1) ... [2025-03-03 14:26:13,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:26:13,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_productSimulator.cil.c[72622,72635] [2025-03-03 14:26:13,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:13,879 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:26:13,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2025-03-03 14:26:13,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [642] [2025-03-03 14:26:13,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1041] [2025-03-03 14:26:13,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [1416] [2025-03-03 14:26:13,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1435] [2025-03-03 14:26:13,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1639] [2025-03-03 14:26:13,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2699] [2025-03-03 14:26:13,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2965] [2025-03-03 14:26:13,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [3072] [2025-03-03 14:26:13,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3089] [2025-03-03 14:26:13,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3455] [2025-03-03 14:26:13,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_productSimulator.cil.c[72622,72635] [2025-03-03 14:26:13,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:14,002 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:26:14,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14 WrapperNode [2025-03-03 14:26:14,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:14,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:14,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:26:14,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:26:14,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,089 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1303 [2025-03-03 14:26:14,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:14,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:26:14,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:26:14,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:26:14,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,134 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:26:14,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:26:14,186 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:26:14,186 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:26:14,186 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:26:14,187 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (1/1) ... [2025-03-03 14:26:14,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:14,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:14,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:26:14,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:26:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:26:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:26:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-03 14:26:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-03 14:26:14,240 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-03 14:26:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-03 14:26:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:26:14,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:26:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:26:14,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:26:14,241 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:26:14,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:26:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:26:14,242 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:26:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-03 14:26:14,242 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-03 14:26:14,242 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:26:14,243 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:26:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-03 14:26:14,243 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-03 14:26:14,243 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:26:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:26:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:26:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:26:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:26:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:26:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-03 14:26:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-03 14:26:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-03 14:26:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-03 14:26:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:26:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:26:14,244 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:26:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:26:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:26:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:26:14,245 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-03 14:26:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:26:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:26:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:26:14,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:26:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:26:14,429 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:26:14,432 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:26:14,459 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1574: #res := ~retValue_acc~17; [2025-03-03 14:26:14,476 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L948: #res := ~retValue_acc~13; [2025-03-03 14:26:14,485 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L522: #res := ~retValue_acc~4; [2025-03-03 14:26:14,498 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2241: #res := ~retValue_acc~31; [2025-03-03 14:26:14,558 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1785: #res := ~retValue_acc~25; [2025-03-03 14:26:14,594 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L685-1: getEmailId_#res#1 := getEmailId_~retValue_acc~6#1; [2025-03-03 14:26:14,631 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L911: #res := ~retValue_acc~12; [2025-03-03 14:26:14,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L759: #res := ~retValue_acc~8; [2025-03-03 14:26:14,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1594-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~18#1; [2025-03-03 14:26:14,705 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1612: #res#1 := ~retValue_acc~19#1; [2025-03-03 14:26:14,777 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2333: #res#1 := ~retValue_acc~33#1; [2025-03-03 14:26:14,777 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~32#1; [2025-03-03 14:26:14,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2557: #res := ~retValue_acc~36; [2025-03-03 14:26:14,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636-1: createEmail_#res#1 := createEmail_~retValue_acc~21#1; [2025-03-03 14:26:14,839 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L874: #res := ~retValue_acc~11; [2025-03-03 14:26:14,872 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676-1: getClientId_#res#1 := getClientId_~retValue_acc~38#1; [2025-03-03 14:26:14,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1022-1: isVerified_#res#1 := isVerified_~retValue_acc~15#1; [2025-03-03 14:26:14,903 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2629-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~37#1; [2025-03-03 14:26:14,907 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L985: #res := ~retValue_acc~14; [2025-03-03 14:26:14,933 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: #res := ~retValue_acc~39; [2025-03-03 14:26:14,952 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2111: #res := ~retValue_acc~29; [2025-03-03 14:26:14,969 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2194-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~30#1; [2025-03-03 14:26:15,205 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L488-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~2#1; [2025-03-03 14:26:15,206 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2503-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~35#1; [2025-03-03 14:26:15,206 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3069-1: valid_product_#res#1 := valid_product_~retValue_acc~40#1; [2025-03-03 14:26:15,206 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L479-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~1#1; [2025-03-03 14:26:15,206 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2396-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~34#1; [2025-03-03 14:26:15,206 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L497-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~3#1; [2025-03-03 14:26:15,212 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: #res := ~retValue_acc~7; [2025-03-03 14:26:15,394 INFO L? ?]: Removed 623 outVars from TransFormulas that were not future-live. [2025-03-03 14:26:15,394 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:26:15,413 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:26:15,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:26:15,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:15 BoogieIcfgContainer [2025-03-03 14:26:15,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:26:15,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:26:15,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:26:15,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:26:15,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:26:13" (1/3) ... [2025-03-03 14:26:15,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5657d9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:15, skipping insertion in model container [2025-03-03 14:26:15,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:14" (2/3) ... [2025-03-03 14:26:15,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5657d9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:15, skipping insertion in model container [2025-03-03 14:26:15,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:15" (3/3) ... [2025-03-03 14:26:15,423 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec7_productSimulator.cil.c [2025-03-03 14:26:15,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:26:15,437 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec7_productSimulator.cil.c that has 44 procedures, 599 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:26:15,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:26:15,497 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;@789f6b7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:26:15,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:26:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-03 14:26:15,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:26:15,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:15,517 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] [2025-03-03 14:26:15,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:15,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:15,523 INFO L85 PathProgramCache]: Analyzing trace with hash -615627010, now seen corresponding path program 1 times [2025-03-03 14:26:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:15,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005459041] [2025-03-03 14:26:15,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:15,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:26:15,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:26:15,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:15,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:26:15,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:15,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005459041] [2025-03-03 14:26:15,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005459041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:15,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:15,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:26:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728036971] [2025-03-03 14:26:15,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:15,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:26:15,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:15,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:26:15,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:26:15,851 INFO L87 Difference]: Start difference. First operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:26:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:15,940 INFO L93 Difference]: Finished difference Result 930 states and 1367 transitions. [2025-03-03 14:26:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:26:15,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 148 [2025-03-03 14:26:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:15,959 INFO L225 Difference]: With dead ends: 930 [2025-03-03 14:26:15,960 INFO L226 Difference]: Without dead ends: 592 [2025-03-03 14:26:15,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:26:15,969 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:15,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-03 14:26:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-03-03 14:26:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.5125284738041003) internal successors, (664), 458 states have internal predecessors, (664), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 14:26:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 881 transitions. [2025-03-03 14:26:16,054 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 881 transitions. Word has length 148 [2025-03-03 14:26:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:16,055 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 881 transitions. [2025-03-03 14:26:16,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:26:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 881 transitions. [2025-03-03 14:26:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:26:16,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:16,060 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:16,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:26:16,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:16,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:16,061 INFO L85 PathProgramCache]: Analyzing trace with hash -183618343, now seen corresponding path program 1 times [2025-03-03 14:26:16,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:16,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202625583] [2025-03-03 14:26:16,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:16,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:16,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:26:16,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:26:16,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:16,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:26:16,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:16,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202625583] [2025-03-03 14:26:16,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202625583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:16,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:16,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:16,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88550473] [2025-03-03 14:26:16,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:16,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:16,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:16,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:16,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:16,429 INFO L87 Difference]: Start difference. First operand 592 states and 881 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:26:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:16,525 INFO L93 Difference]: Finished difference Result 1148 states and 1706 transitions. [2025-03-03 14:26:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:16,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 149 [2025-03-03 14:26:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:16,535 INFO L225 Difference]: With dead ends: 1148 [2025-03-03 14:26:16,535 INFO L226 Difference]: Without dead ends: 592 [2025-03-03 14:26:16,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:16,538 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 0 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:16,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-03 14:26:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-03-03 14:26:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.4965831435079726) internal successors, (657), 458 states have internal predecessors, (657), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 14:26:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 874 transitions. [2025-03-03 14:26:16,593 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 874 transitions. Word has length 149 [2025-03-03 14:26:16,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:16,593 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 874 transitions. [2025-03-03 14:26:16,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:26:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 874 transitions. [2025-03-03 14:26:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 14:26:16,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:16,596 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] [2025-03-03 14:26:16,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:26:16,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:16,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1054715547, now seen corresponding path program 1 times [2025-03-03 14:26:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:16,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296067588] [2025-03-03 14:26:16,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:16,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 14:26:16,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 14:26:16,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:16,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:26:16,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:16,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296067588] [2025-03-03 14:26:16,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296067588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:16,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:16,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456384534] [2025-03-03 14:26:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:16,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:16,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:16,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:16,750 INFO L87 Difference]: Start difference. First operand 592 states and 874 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-03 14:26:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:16,800 INFO L93 Difference]: Finished difference Result 1152 states and 1714 transitions. [2025-03-03 14:26:16,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:16,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 154 [2025-03-03 14:26:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:16,808 INFO L225 Difference]: With dead ends: 1152 [2025-03-03 14:26:16,808 INFO L226 Difference]: Without dead ends: 593 [2025-03-03 14:26:16,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:16,810 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 836 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:16,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 889 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-03 14:26:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-03-03 14:26:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 441 states have (on average 1.4875283446712018) internal successors, (656), 458 states have internal predecessors, (656), 107 states have call successors, (107), 44 states have call predecessors, (107), 44 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-03 14:26:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 869 transitions. [2025-03-03 14:26:16,834 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 869 transitions. Word has length 154 [2025-03-03 14:26:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:16,834 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 869 transitions. [2025-03-03 14:26:16,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-03 14:26:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 869 transitions. [2025-03-03 14:26:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 14:26:16,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:16,837 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] [2025-03-03 14:26:16,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:26:16,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:16,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:16,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1842814812, now seen corresponding path program 1 times [2025-03-03 14:26:16,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:16,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184943033] [2025-03-03 14:26:16,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:16,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 14:26:16,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:26:16,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:16,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:26:16,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:16,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184943033] [2025-03-03 14:26:16,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184943033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:16,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:16,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:16,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793026252] [2025-03-03 14:26:16,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:16,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:16,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:16,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:16,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:16,964 INFO L87 Difference]: Start difference. First operand 593 states and 869 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:26:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:17,057 INFO L93 Difference]: Finished difference Result 1691 states and 2514 transitions. [2025-03-03 14:26:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 155 [2025-03-03 14:26:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:17,068 INFO L225 Difference]: With dead ends: 1691 [2025-03-03 14:26:17,068 INFO L226 Difference]: Without dead ends: 1132 [2025-03-03 14:26:17,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:17,071 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 824 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:17,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1709 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2025-03-03 14:26:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1130. [2025-03-03 14:26:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 843 states have (on average 1.4946619217081851) internal successors, (1260), 873 states have internal predecessors, (1260), 199 states have call successors, (199), 87 states have call predecessors, (199), 87 states have return successors, (210), 196 states have call predecessors, (210), 197 states have call successors, (210) [2025-03-03 14:26:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1669 transitions. [2025-03-03 14:26:17,158 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1669 transitions. Word has length 155 [2025-03-03 14:26:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:17,159 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1669 transitions. [2025-03-03 14:26:17,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:26:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1669 transitions. [2025-03-03 14:26:17,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 14:26:17,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:17,166 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] [2025-03-03 14:26:17,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:26:17,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:17,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1407120315, now seen corresponding path program 1 times [2025-03-03 14:26:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:17,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294106972] [2025-03-03 14:26:17,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:17,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:17,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 14:26:17,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 14:26:17,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:17,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:26:17,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:17,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294106972] [2025-03-03 14:26:17,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294106972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:17,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:17,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982454546] [2025-03-03 14:26:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:17,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:17,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:17,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:17,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:17,281 INFO L87 Difference]: Start difference. First operand 1130 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:26:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:17,335 INFO L93 Difference]: Finished difference Result 1132 states and 1670 transitions. [2025-03-03 14:26:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:17,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 156 [2025-03-03 14:26:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:17,340 INFO L225 Difference]: With dead ends: 1132 [2025-03-03 14:26:17,341 INFO L226 Difference]: Without dead ends: 594 [2025-03-03 14:26:17,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:17,343 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 816 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:17,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 892 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-03 14:26:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-03 14:26:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 443 states have (on average 1.4762979683972912) internal successors, (654), 458 states have internal predecessors, (654), 105 states have call successors, (105), 45 states have call predecessors, (105), 45 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-03 14:26:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 863 transitions. [2025-03-03 14:26:17,382 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 863 transitions. Word has length 156 [2025-03-03 14:26:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:17,383 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 863 transitions. [2025-03-03 14:26:17,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:26:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 863 transitions. [2025-03-03 14:26:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 14:26:17,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:17,386 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] [2025-03-03 14:26:17,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:26:17,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:17,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash 139293321, now seen corresponding path program 1 times [2025-03-03 14:26:17,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:17,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038226452] [2025-03-03 14:26:17,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:17,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 14:26:17,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 14:26:17,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:17,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 14:26:17,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:17,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038226452] [2025-03-03 14:26:17,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038226452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:17,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:17,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389738788] [2025-03-03 14:26:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:17,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:17,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:17,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:17,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:17,484 INFO L87 Difference]: Start difference. First operand 594 states and 863 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 14:26:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:17,550 INFO L93 Difference]: Finished difference Result 1142 states and 1666 transitions. [2025-03-03 14:26:17,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 165 [2025-03-03 14:26:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:17,554 INFO L225 Difference]: With dead ends: 1142 [2025-03-03 14:26:17,555 INFO L226 Difference]: Without dead ends: 597 [2025-03-03 14:26:17,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:17,557 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 798 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:17,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 877 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-03 14:26:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 591. [2025-03-03 14:26:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 443 states have (on average 1.4514672686230248) internal successors, (643), 453 states have internal predecessors, (643), 102 states have call successors, (102), 45 states have call predecessors, (102), 45 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-03 14:26:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 846 transitions. [2025-03-03 14:26:17,592 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 846 transitions. Word has length 165 [2025-03-03 14:26:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:17,593 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 846 transitions. [2025-03-03 14:26:17,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-03 14:26:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 846 transitions. [2025-03-03 14:26:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 14:26:17,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:17,596 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:17,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:26:17,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:17,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:17,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1012825353, now seen corresponding path program 1 times [2025-03-03 14:26:17,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:17,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937845728] [2025-03-03 14:26:17,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:17,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:17,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 14:26:17,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 14:26:17,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:17,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 14:26:17,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937845728] [2025-03-03 14:26:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937845728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:17,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990821143] [2025-03-03 14:26:17,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:17,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:17,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:17,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:17,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:26:18,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 14:26:18,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 14:26:18,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:18,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:18,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:26:18,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:26:18,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:18,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990821143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:18,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:18,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:26:18,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242067751] [2025-03-03 14:26:18,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:18,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:18,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:18,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:18,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:26:18,249 INFO L87 Difference]: Start difference. First operand 591 states and 846 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:26:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:18,285 INFO L93 Difference]: Finished difference Result 914 states and 1291 transitions. [2025-03-03 14:26:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:18,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 176 [2025-03-03 14:26:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:18,288 INFO L225 Difference]: With dead ends: 914 [2025-03-03 14:26:18,289 INFO L226 Difference]: Without dead ends: 593 [2025-03-03 14:26:18,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 176 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-03-03 14:26:18,290 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 0 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:18,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1680 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-03 14:26:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2025-03-03 14:26:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 445 states have (on average 1.449438202247191) internal successors, (645), 455 states have internal predecessors, (645), 102 states have call successors, (102), 45 states have call predecessors, (102), 45 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-03 14:26:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 848 transitions. [2025-03-03 14:26:18,316 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 848 transitions. Word has length 176 [2025-03-03 14:26:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:18,316 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 848 transitions. [2025-03-03 14:26:18,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:26:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 848 transitions. [2025-03-03 14:26:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 14:26:18,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:18,319 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:18,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:26:18,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:18,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:18,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1121417824, now seen corresponding path program 1 times [2025-03-03 14:26:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:18,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812451150] [2025-03-03 14:26:18,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:18,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:18,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 14:26:18,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 14:26:18,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:18,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:26:18,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:18,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812451150] [2025-03-03 14:26:18,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812451150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:18,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600199863] [2025-03-03 14:26:18,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:18,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:18,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:18,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:18,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:26:18,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 14:26:19,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 14:26:19,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:19,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:19,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:19,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:26:19,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:19,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600199863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:19,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:19,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:26:19,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701044552] [2025-03-03 14:26:19,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:19,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:19,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:19,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:19,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:26:19,144 INFO L87 Difference]: Start difference. First operand 593 states and 848 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:26:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:19,184 INFO L93 Difference]: Finished difference Result 1202 states and 1754 transitions. [2025-03-03 14:26:19,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:19,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 183 [2025-03-03 14:26:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:19,188 INFO L225 Difference]: With dead ends: 1202 [2025-03-03 14:26:19,188 INFO L226 Difference]: Without dead ends: 690 [2025-03-03 14:26:19,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 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-03-03 14:26:19,190 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 165 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:19,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1653 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-03 14:26:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 682. [2025-03-03 14:26:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 520 states have (on average 1.4653846153846153) internal successors, (762), 530 states have internal predecessors, (762), 116 states have call successors, (116), 45 states have call predecessors, (116), 45 states have return successors, (115), 114 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-03 14:26:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 993 transitions. [2025-03-03 14:26:19,222 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 993 transitions. Word has length 183 [2025-03-03 14:26:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:19,222 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 993 transitions. [2025-03-03 14:26:19,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:26:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 993 transitions. [2025-03-03 14:26:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 14:26:19,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:19,225 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:19,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:19,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 14:26:19,425 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:19,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash -809336047, now seen corresponding path program 1 times [2025-03-03 14:26:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:19,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615609184] [2025-03-03 14:26:19,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:19,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 14:26:19,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 14:26:19,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:19,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:26:19,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:19,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615609184] [2025-03-03 14:26:19,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615609184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:19,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124491836] [2025-03-03 14:26:19,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:19,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:19,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:19,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:19,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:26:19,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 14:26:20,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 14:26:20,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:20,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:20,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1477 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:20,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:26:20,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:20,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124491836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:20,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:20,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:26:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81692866] [2025-03-03 14:26:20,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:20,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:20,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:20,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:20,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:26:20,180 INFO L87 Difference]: Start difference. First operand 682 states and 993 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-03 14:26:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:20,257 INFO L93 Difference]: Finished difference Result 1628 states and 2370 transitions. [2025-03-03 14:26:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 191 [2025-03-03 14:26:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:20,267 INFO L225 Difference]: With dead ends: 1628 [2025-03-03 14:26:20,267 INFO L226 Difference]: Without dead ends: 1315 [2025-03-03 14:26:20,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 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-03-03 14:26:20,270 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 709 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:20,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1661 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2025-03-03 14:26:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1313. [2025-03-03 14:26:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1009 states have (on average 1.4737363726461843) internal successors, (1487), 1026 states have internal predecessors, (1487), 216 states have call successors, (216), 87 states have call predecessors, (216), 87 states have return successors, (223), 212 states have call predecessors, (223), 214 states have call successors, (223) [2025-03-03 14:26:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1926 transitions. [2025-03-03 14:26:20,341 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1926 transitions. Word has length 191 [2025-03-03 14:26:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:20,342 INFO L471 AbstractCegarLoop]: Abstraction has 1313 states and 1926 transitions. [2025-03-03 14:26:20,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2025-03-03 14:26:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1926 transitions. [2025-03-03 14:26:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 14:26:20,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:20,347 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:20,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:26:20,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:20,551 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:20,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1986031801, now seen corresponding path program 1 times [2025-03-03 14:26:20,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786638500] [2025-03-03 14:26:20,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:20,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 14:26:20,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 14:26:20,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:20,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:26:20,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:20,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786638500] [2025-03-03 14:26:20,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786638500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:20,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412699516] [2025-03-03 14:26:20,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:20,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:20,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:20,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:20,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:26:20,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 14:26:21,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 14:26:21,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:21,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:21,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:26:21,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 14:26:21,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:21,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412699516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:21,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:21,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-03 14:26:21,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509384371] [2025-03-03 14:26:21,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:21,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:26:21,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:21,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:26:21,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:26:21,220 INFO L87 Difference]: Start difference. First operand 1313 states and 1926 transitions. Second operand has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:26:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:21,377 INFO L93 Difference]: Finished difference Result 2547 states and 3762 transitions. [2025-03-03 14:26:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:26:21,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 184 [2025-03-03 14:26:21,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:21,386 INFO L225 Difference]: With dead ends: 2547 [2025-03-03 14:26:21,386 INFO L226 Difference]: Without dead ends: 1317 [2025-03-03 14:26:21,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 179 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-03-03 14:26:21,391 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 4 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5800 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-03-03 14:26:21,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5800 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2025-03-03 14:26:21,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1317. [2025-03-03 14:26:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1011 states have (on average 1.4727992087042532) internal successors, (1489), 1030 states have internal predecessors, (1489), 216 states have call successors, (216), 87 states have call predecessors, (216), 89 states have return successors, (227), 212 states have call predecessors, (227), 214 states have call successors, (227) [2025-03-03 14:26:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1932 transitions. [2025-03-03 14:26:21,461 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1932 transitions. Word has length 184 [2025-03-03 14:26:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:21,461 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1932 transitions. [2025-03-03 14:26:21,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 18.166666666666668) internal successors, (109), 8 states have internal predecessors, (109), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:26:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1932 transitions. [2025-03-03 14:26:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 14:26:21,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:21,465 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:21,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:21,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:21,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:21,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1877715948, now seen corresponding path program 1 times [2025-03-03 14:26:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944428639] [2025-03-03 14:26:21,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:21,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 14:26:21,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 14:26:21,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:21,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:26:21,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:21,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944428639] [2025-03-03 14:26:21,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944428639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:21,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683877026] [2025-03-03 14:26:21,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:21,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:21,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:21,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:21,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:26:21,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 14:26:22,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 14:26:22,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:22,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:22,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:26:22,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 14:26:22,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:22,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683877026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:22,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:22,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 14:26:22,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610637036] [2025-03-03 14:26:22,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:22,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:26:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:22,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:26:22,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:26:22,175 INFO L87 Difference]: Start difference. First operand 1317 states and 1932 transitions. Second operand has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:26:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:22,262 INFO L93 Difference]: Finished difference Result 2549 states and 3770 transitions. [2025-03-03 14:26:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:26:22,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 185 [2025-03-03 14:26:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:22,289 INFO L225 Difference]: With dead ends: 2549 [2025-03-03 14:26:22,289 INFO L226 Difference]: Without dead ends: 1321 [2025-03-03 14:26:22,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 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-03-03 14:26:22,292 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 2 mSDsluCounter, 3307 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4138 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-03-03 14:26:22,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4138 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-03-03 14:26:22,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2025-03-03 14:26:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1013 states have (on average 1.4718657453109576) internal successors, (1491), 1034 states have internal predecessors, (1491), 216 states have call successors, (216), 87 states have call predecessors, (216), 91 states have return successors, (237), 212 states have call predecessors, (237), 214 states have call successors, (237) [2025-03-03 14:26:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1944 transitions. [2025-03-03 14:26:22,338 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1944 transitions. Word has length 185 [2025-03-03 14:26:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:22,338 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1944 transitions. [2025-03-03 14:26:22,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 6 states have internal predecessors, (111), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:26:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1944 transitions. [2025-03-03 14:26:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-03 14:26:22,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:22,343 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:22,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:22,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:26:22,544 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:22,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash -232624853, now seen corresponding path program 1 times [2025-03-03 14:26:22,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:22,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219830869] [2025-03-03 14:26:22,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:22,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-03 14:26:22,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-03 14:26:22,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:22,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:22,723 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:26:22,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:22,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219830869] [2025-03-03 14:26:22,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219830869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:22,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:22,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:26:22,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408254778] [2025-03-03 14:26:22,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:22,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:26:22,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:22,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:26:22,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:26:22,726 INFO L87 Difference]: Start difference. First operand 1321 states and 1944 transitions. Second operand has 8 states, 6 states have (on average 17.833333333333332) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:26:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:22,826 INFO L93 Difference]: Finished difference Result 2525 states and 3744 transitions. [2025-03-03 14:26:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:26:22,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 17.833333333333332) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 186 [2025-03-03 14:26:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:22,834 INFO L225 Difference]: With dead ends: 2525 [2025-03-03 14:26:22,835 INFO L226 Difference]: Without dead ends: 1321 [2025-03-03 14:26:22,838 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-03-03 14:26:22,839 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 4 mSDsluCounter, 4975 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5807 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-03-03 14:26:22,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5807 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-03-03 14:26:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2025-03-03 14:26:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1013 states have (on average 1.4718657453109576) internal successors, (1491), 1034 states have internal predecessors, (1491), 216 states have call successors, (216), 87 states have call predecessors, (216), 91 states have return successors, (235), 212 states have call predecessors, (235), 214 states have call successors, (235) [2025-03-03 14:26:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1942 transitions. [2025-03-03 14:26:22,887 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1942 transitions. Word has length 186 [2025-03-03 14:26:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:22,888 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1942 transitions. [2025-03-03 14:26:22,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 17.833333333333332) internal successors, (107), 8 states have internal predecessors, (107), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:26:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1942 transitions. [2025-03-03 14:26:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 14:26:22,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:22,893 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:22,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:26:22,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:22,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash 594716004, now seen corresponding path program 2 times [2025-03-03 14:26:22,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:22,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704662842] [2025-03-03 14:26:22,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:26:22,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:22,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 187 statements into 2 equivalence classes. [2025-03-03 14:26:22,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 187 statements. [2025-03-03 14:26:22,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:26:22,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-03 14:26:23,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:23,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704662842] [2025-03-03 14:26:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704662842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:26:23,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121184579] [2025-03-03 14:26:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:23,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:26:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:23,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:26:23,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:26:23,042 INFO L87 Difference]: Start difference. First operand 1321 states and 1942 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 14:26:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:23,113 INFO L93 Difference]: Finished difference Result 1331 states and 1957 transitions. [2025-03-03 14:26:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:26:23,114 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 1 states have call successors, (24) Word has length 187 [2025-03-03 14:26:23,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:23,121 INFO L225 Difference]: With dead ends: 1331 [2025-03-03 14:26:23,121 INFO L226 Difference]: Without dead ends: 1329 [2025-03-03 14:26:23,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:26:23,122 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 0 mSDsluCounter, 6675 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7511 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:23,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7511 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-03-03 14:26:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2025-03-03 14:26:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1019 states have (on average 1.4690873405299314) internal successors, (1497), 1040 states have internal predecessors, (1497), 216 states have call successors, (216), 87 states have call predecessors, (216), 93 states have return successors, (241), 214 states have call predecessors, (241), 214 states have call successors, (241) [2025-03-03 14:26:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1954 transitions. [2025-03-03 14:26:23,169 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1954 transitions. Word has length 187 [2025-03-03 14:26:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:23,170 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1954 transitions. [2025-03-03 14:26:23,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 8 states have internal predecessors, (104), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 14:26:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1954 transitions. [2025-03-03 14:26:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 14:26:23,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:23,174 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:23,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:26:23,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:23,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:23,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1507548458, now seen corresponding path program 1 times [2025-03-03 14:26:23,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:23,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95390244] [2025-03-03 14:26:23,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:23,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:23,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 14:26:23,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 14:26:23,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:23,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:26:23,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:23,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95390244] [2025-03-03 14:26:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95390244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:23,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:23,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:26:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474667057] [2025-03-03 14:26:23,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:23,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:26:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:23,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:26:23,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:26:23,344 INFO L87 Difference]: Start difference. First operand 1329 states and 1954 transitions. Second operand has 8 states, 6 states have (on average 18.5) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:26:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:23,446 INFO L93 Difference]: Finished difference Result 2545 states and 3774 transitions. [2025-03-03 14:26:23,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:26:23,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 18.5) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 190 [2025-03-03 14:26:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:23,454 INFO L225 Difference]: With dead ends: 2545 [2025-03-03 14:26:23,454 INFO L226 Difference]: Without dead ends: 1333 [2025-03-03 14:26:23,457 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-03-03 14:26:23,458 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 3 mSDsluCounter, 4980 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5813 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-03-03 14:26:23,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5813 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:23,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-03-03 14:26:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2025-03-03 14:26:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1021 states have (on average 1.4681684622918707) internal successors, (1499), 1044 states have internal predecessors, (1499), 216 states have call successors, (216), 87 states have call predecessors, (216), 95 states have return successors, (245), 214 states have call predecessors, (245), 214 states have call successors, (245) [2025-03-03 14:26:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1960 transitions. [2025-03-03 14:26:23,508 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1960 transitions. Word has length 190 [2025-03-03 14:26:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:23,508 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1960 transitions. [2025-03-03 14:26:23,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 18.5) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:26:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1960 transitions. [2025-03-03 14:26:23,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 14:26:23,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:23,512 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:23,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:26:23,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:23,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1885765486, now seen corresponding path program 1 times [2025-03-03 14:26:23,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276574998] [2025-03-03 14:26:23,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:23,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 14:26:23,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 14:26:23,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:23,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:26:23,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276574998] [2025-03-03 14:26:23,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276574998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:23,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:26:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360326964] [2025-03-03 14:26:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:23,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:26:23,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:23,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:26:23,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:26:23,681 INFO L87 Difference]: Start difference. First operand 1333 states and 1960 transitions. Second operand has 9 states, 7 states have (on average 16.428571428571427) internal successors, (115), 8 states have internal predecessors, (115), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:26:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:23,831 INFO L93 Difference]: Finished difference Result 2539 states and 3762 transitions. [2025-03-03 14:26:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:26:23,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 16.428571428571427) internal successors, (115), 8 states have internal predecessors, (115), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 191 [2025-03-03 14:26:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:23,843 INFO L225 Difference]: With dead ends: 2539 [2025-03-03 14:26:23,843 INFO L226 Difference]: Without dead ends: 1333 [2025-03-03 14:26:23,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:26:23,848 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 7 mSDsluCounter, 5745 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6570 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:23,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6570 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:26:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2025-03-03 14:26:23,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2025-03-03 14:26:23,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1021 states have (on average 1.4681684622918707) internal successors, (1499), 1044 states have internal predecessors, (1499), 216 states have call successors, (216), 87 states have call predecessors, (216), 95 states have return successors, (243), 214 states have call predecessors, (243), 214 states have call successors, (243) [2025-03-03 14:26:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1958 transitions. [2025-03-03 14:26:23,905 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1958 transitions. Word has length 191 [2025-03-03 14:26:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:23,905 INFO L471 AbstractCegarLoop]: Abstraction has 1333 states and 1958 transitions. [2025-03-03 14:26:23,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 16.428571428571427) internal successors, (115), 8 states have internal predecessors, (115), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:26:23,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1958 transitions. [2025-03-03 14:26:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 14:26:23,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:23,909 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:23,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:26:23,910 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:23,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:23,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1941997779, now seen corresponding path program 2 times [2025-03-03 14:26:23,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:23,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195133278] [2025-03-03 14:26:23,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:26:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:23,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-03-03 14:26:23,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 192 statements. [2025-03-03 14:26:23,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:26:23,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 14:26:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:23,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195133278] [2025-03-03 14:26:23,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195133278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:23,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:23,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:26:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751875083] [2025-03-03 14:26:23,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:23,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:26:23,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:23,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:26:23,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:26:23,965 INFO L87 Difference]: Start difference. First operand 1333 states and 1958 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 3 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:26:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:24,497 INFO L93 Difference]: Finished difference Result 3217 states and 4785 transitions. [2025-03-03 14:26:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:26:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 3 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 192 [2025-03-03 14:26:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:24,504 INFO L225 Difference]: With dead ends: 3217 [2025-03-03 14:26:24,504 INFO L226 Difference]: Without dead ends: 1320 [2025-03-03 14:26:24,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:26:24,508 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1454 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 2754 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:24,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 2754 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:26:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-03 14:26:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-03 14:26:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1015 states have (on average 1.4620689655172414) internal successors, (1484), 1034 states have internal predecessors, (1484), 210 states have call successors, (210), 88 states have call predecessors, (210), 94 states have return successors, (230), 206 states have call predecessors, (230), 208 states have call successors, (230) [2025-03-03 14:26:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1924 transitions. [2025-03-03 14:26:24,573 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1924 transitions. Word has length 192 [2025-03-03 14:26:24,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:24,573 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1924 transitions. [2025-03-03 14:26:24,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 3 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:26:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1924 transitions. [2025-03-03 14:26:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 14:26:24,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:24,578 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] [2025-03-03 14:26:24,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:26:24,578 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:24,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:24,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2132428609, now seen corresponding path program 1 times [2025-03-03 14:26:24,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:24,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107725101] [2025-03-03 14:26:24,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:24,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:24,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 14:26:24,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 14:26:24,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:24,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-03 14:26:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107725101] [2025-03-03 14:26:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107725101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309408358] [2025-03-03 14:26:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:24,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:24,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:24,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:24,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:24,651 INFO L87 Difference]: Start difference. First operand 1320 states and 1924 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:26:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:24,697 INFO L93 Difference]: Finished difference Result 1322 states and 1925 transitions. [2025-03-03 14:26:24,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:24,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 208 [2025-03-03 14:26:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:24,702 INFO L225 Difference]: With dead ends: 1322 [2025-03-03 14:26:24,702 INFO L226 Difference]: Without dead ends: 686 [2025-03-03 14:26:24,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:24,704 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 794 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 853 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-03-03 14:26:24,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 853 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-03 14:26:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2025-03-03 14:26:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 524 states have (on average 1.4484732824427482) internal successors, (759), 534 states have internal predecessors, (759), 112 states have call successors, (112), 46 states have call predecessors, (112), 49 states have return successors, (118), 110 states have call predecessors, (118), 111 states have call successors, (118) [2025-03-03 14:26:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 989 transitions. [2025-03-03 14:26:24,742 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 989 transitions. Word has length 208 [2025-03-03 14:26:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:24,743 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 989 transitions. [2025-03-03 14:26:24,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-03 14:26:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 989 transitions. [2025-03-03 14:26:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 14:26:24,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:24,747 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:24,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:26:24,747 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:24,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1443415827, now seen corresponding path program 1 times [2025-03-03 14:26:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:24,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110668746] [2025-03-03 14:26:24,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:24,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 14:26:24,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 14:26:24,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:24,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-03 14:26:24,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:24,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110668746] [2025-03-03 14:26:24,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110668746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:24,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:24,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:26:24,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73554714] [2025-03-03 14:26:24,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:24,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:26:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:24,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:26:24,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:26:24,899 INFO L87 Difference]: Start difference. First operand 686 states and 989 transitions. Second operand has 9 states, 7 states have (on average 19.0) internal successors, (133), 8 states have internal predecessors, (133), 4 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 14:26:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:25,022 INFO L93 Difference]: Finished difference Result 1291 states and 1888 transitions. [2025-03-03 14:26:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:26:25,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 19.0) internal successors, (133), 8 states have internal predecessors, (133), 4 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 223 [2025-03-03 14:26:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:25,028 INFO L225 Difference]: With dead ends: 1291 [2025-03-03 14:26:25,029 INFO L226 Difference]: Without dead ends: 688 [2025-03-03 14:26:25,031 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-03-03 14:26:25,031 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 4 mSDsluCounter, 5647 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6458 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-03-03 14:26:25,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6458 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:26:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-03 14:26:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-03 14:26:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 525 states have (on average 1.4476190476190476) internal successors, (760), 536 states have internal predecessors, (760), 112 states have call successors, (112), 46 states have call predecessors, (112), 50 states have return successors, (123), 110 states have call predecessors, (123), 111 states have call successors, (123) [2025-03-03 14:26:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 995 transitions. [2025-03-03 14:26:25,057 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 995 transitions. Word has length 223 [2025-03-03 14:26:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:25,057 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 995 transitions. [2025-03-03 14:26:25,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 19.0) internal successors, (133), 8 states have internal predecessors, (133), 4 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 14:26:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 995 transitions. [2025-03-03 14:26:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 14:26:25,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:25,060 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:25,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:26:25,060 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:25,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:25,060 INFO L85 PathProgramCache]: Analyzing trace with hash 598805968, now seen corresponding path program 1 times [2025-03-03 14:26:25,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:25,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717404368] [2025-03-03 14:26:25,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:25,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 14:26:25,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 14:26:25,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:25,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:25,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:25,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717404368] [2025-03-03 14:26:25,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717404368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:25,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230997142] [2025-03-03 14:26:25,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:25,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:25,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:25,226 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:25,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:26:25,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 14:26:25,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 14:26:25,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:25,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:25,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1554 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:25,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:25,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:26:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:25,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230997142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:26:25,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:26:25,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:26:25,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031071395] [2025-03-03 14:26:25,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:26:25,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:26:25,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:25,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:26:25,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:26:25,706 INFO L87 Difference]: Start difference. First operand 688 states and 995 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, (43), 2 states have call predecessors, (43), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 14:26:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:25,849 INFO L93 Difference]: Finished difference Result 1562 states and 2344 transitions. [2025-03-03 14:26:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:26:25,849 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, (43), 2 states have call predecessors, (43), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 217 [2025-03-03 14:26:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:25,856 INFO L225 Difference]: With dead ends: 1562 [2025-03-03 14:26:25,857 INFO L226 Difference]: Without dead ends: 1246 [2025-03-03 14:26:25,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:26:25,859 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 633 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:25,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 3524 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:26:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-03-03 14:26:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1222. [2025-03-03 14:26:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 980 states have (on average 1.5091836734693878) internal successors, (1479), 991 states have internal predecessors, (1479), 191 states have call successors, (191), 46 states have call predecessors, (191), 50 states have return successors, (212), 189 states have call predecessors, (212), 190 states have call successors, (212) [2025-03-03 14:26:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1882 transitions. [2025-03-03 14:26:25,900 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1882 transitions. Word has length 217 [2025-03-03 14:26:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:25,901 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1882 transitions. [2025-03-03 14:26:25,901 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, (43), 2 states have call predecessors, (43), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 14:26:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1882 transitions. [2025-03-03 14:26:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 14:26:25,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:25,907 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:25,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:26,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:26,108 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:26,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:26,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1388775890, now seen corresponding path program 1 times [2025-03-03 14:26:26,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:26,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766796702] [2025-03-03 14:26:26,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:26,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:26,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 14:26:26,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 14:26:26,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:26,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:26,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766796702] [2025-03-03 14:26:26,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766796702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:26,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:26,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865412336] [2025-03-03 14:26:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:26,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:26,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:26,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:26,187 INFO L87 Difference]: Start difference. First operand 1222 states and 1882 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, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:26:26,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:26,228 INFO L93 Difference]: Finished difference Result 2809 states and 4409 transitions. [2025-03-03 14:26:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:26,229 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, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 228 [2025-03-03 14:26:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:26,236 INFO L225 Difference]: With dead ends: 2809 [2025-03-03 14:26:26,237 INFO L226 Difference]: Without dead ends: 1726 [2025-03-03 14:26:26,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:26,240 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 163 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:26,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1657 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2025-03-03 14:26:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1718. [2025-03-03 14:26:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1397 states have (on average 1.5246957766642806) internal successors, (2130), 1408 states have internal predecessors, (2130), 270 states have call successors, (270), 46 states have call predecessors, (270), 50 states have return successors, (301), 268 states have call predecessors, (301), 269 states have call successors, (301) [2025-03-03 14:26:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2701 transitions. [2025-03-03 14:26:26,293 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2701 transitions. Word has length 228 [2025-03-03 14:26:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:26,294 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2701 transitions. [2025-03-03 14:26:26,294 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, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:26:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2701 transitions. [2025-03-03 14:26:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 14:26:26,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:26,300 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:26,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:26:26,300 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:26,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1593348427, now seen corresponding path program 1 times [2025-03-03 14:26:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789939947] [2025-03-03 14:26:26,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:26,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 14:26:26,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 14:26:26,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:26,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:26,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:26,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789939947] [2025-03-03 14:26:26,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789939947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:26,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:26,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:26,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732266813] [2025-03-03 14:26:26,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:26,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:26,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:26,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:26,362 INFO L87 Difference]: Start difference. First operand 1718 states and 2701 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:26,457 INFO L93 Difference]: Finished difference Result 4045 states and 6439 transitions. [2025-03-03 14:26:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:26,458 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 222 [2025-03-03 14:26:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:26,473 INFO L225 Difference]: With dead ends: 4045 [2025-03-03 14:26:26,473 INFO L226 Difference]: Without dead ends: 2527 [2025-03-03 14:26:26,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:26,479 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 161 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:26,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1642 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2025-03-03 14:26:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 2519. [2025-03-03 14:26:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2079 states have (on average 1.54016354016354) internal successors, (3202), 2090 states have internal predecessors, (3202), 389 states have call successors, (389), 46 states have call predecessors, (389), 50 states have return successors, (420), 387 states have call predecessors, (420), 388 states have call successors, (420) [2025-03-03 14:26:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 4011 transitions. [2025-03-03 14:26:26,597 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 4011 transitions. Word has length 222 [2025-03-03 14:26:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:26,597 INFO L471 AbstractCegarLoop]: Abstraction has 2519 states and 4011 transitions. [2025-03-03 14:26:26,597 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 4011 transitions. [2025-03-03 14:26:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 14:26:26,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:26,612 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:26,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:26:26,612 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:26,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1901505210, now seen corresponding path program 1 times [2025-03-03 14:26:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085768904] [2025-03-03 14:26:26,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:26,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 14:26:26,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 14:26:26,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:26,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085768904] [2025-03-03 14:26:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085768904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:26,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:26,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981270325] [2025-03-03 14:26:26,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:26,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:26,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:26,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:26,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:26,699 INFO L87 Difference]: Start difference. First operand 2519 states and 4011 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:26,783 INFO L93 Difference]: Finished difference Result 5926 states and 9544 transitions. [2025-03-03 14:26:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:26,784 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 223 [2025-03-03 14:26:26,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:26,801 INFO L225 Difference]: With dead ends: 5926 [2025-03-03 14:26:26,801 INFO L226 Difference]: Without dead ends: 3761 [2025-03-03 14:26:26,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:26,809 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 159 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:26,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1639 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2025-03-03 14:26:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3753. [2025-03-03 14:26:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3151 states have (on average 1.5528403681370992) internal successors, (4893), 3162 states have internal predecessors, (4893), 551 states have call successors, (551), 46 states have call predecessors, (551), 50 states have return successors, (598), 549 states have call predecessors, (598), 550 states have call successors, (598) [2025-03-03 14:26:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 6042 transitions. [2025-03-03 14:26:26,983 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 6042 transitions. Word has length 223 [2025-03-03 14:26:26,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:26,984 INFO L471 AbstractCegarLoop]: Abstraction has 3753 states and 6042 transitions. [2025-03-03 14:26:26,984 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 6042 transitions. [2025-03-03 14:26:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 14:26:26,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:26,999 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:26,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:26:26,999 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:27,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash 665448084, now seen corresponding path program 1 times [2025-03-03 14:26:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:27,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478460424] [2025-03-03 14:26:27,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:27,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 14:26:27,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 14:26:27,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:27,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:27,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:27,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478460424] [2025-03-03 14:26:27,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478460424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:27,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:27,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261378322] [2025-03-03 14:26:27,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:27,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:27,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:27,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:27,063 INFO L87 Difference]: Start difference. First operand 3753 states and 6042 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:27,161 INFO L93 Difference]: Finished difference Result 8897 states and 14465 transitions. [2025-03-03 14:26:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:27,162 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 224 [2025-03-03 14:26:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:27,191 INFO L225 Difference]: With dead ends: 8897 [2025-03-03 14:26:27,191 INFO L226 Difference]: Without dead ends: 5753 [2025-03-03 14:26:27,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:27,201 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 157 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:27,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1639 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5753 states. [2025-03-03 14:26:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5753 to 5745. [2025-03-03 14:26:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5745 states, 4898 states have (on average 1.5632911392405062) internal successors, (7657), 4909 states have internal predecessors, (7657), 796 states have call successors, (796), 46 states have call predecessors, (796), 50 states have return successors, (869), 794 states have call predecessors, (869), 795 states have call successors, (869) [2025-03-03 14:26:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5745 states to 5745 states and 9322 transitions. [2025-03-03 14:26:27,431 INFO L78 Accepts]: Start accepts. Automaton has 5745 states and 9322 transitions. Word has length 224 [2025-03-03 14:26:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:27,431 INFO L471 AbstractCegarLoop]: Abstraction has 5745 states and 9322 transitions. [2025-03-03 14:26:27,432 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 5745 states and 9322 transitions. [2025-03-03 14:26:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 14:26:27,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:27,451 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:27,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:26:27,452 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:27,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1986040844, now seen corresponding path program 1 times [2025-03-03 14:26:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:27,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223930144] [2025-03-03 14:26:27,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:27,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:27,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 14:26:27,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 14:26:27,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:27,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:27,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:27,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223930144] [2025-03-03 14:26:27,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223930144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:27,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:27,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494492105] [2025-03-03 14:26:27,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:27,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:27,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:27,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:27,538 INFO L87 Difference]: Start difference. First operand 5745 states and 9322 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:26:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:27,794 INFO L93 Difference]: Finished difference Result 13834 states and 22607 transitions. [2025-03-03 14:26:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:27,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 232 [2025-03-03 14:26:27,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:27,826 INFO L225 Difference]: With dead ends: 13834 [2025-03-03 14:26:27,826 INFO L226 Difference]: Without dead ends: 9089 [2025-03-03 14:26:27,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:27,841 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 155 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:27,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1649 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9089 states. [2025-03-03 14:26:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9089 to 9081. [2025-03-03 14:26:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9081 states, 7741 states have (on average 1.562072083710115) internal successors, (12092), 7752 states have internal predecessors, (12092), 1289 states have call successors, (1289), 46 states have call predecessors, (1289), 50 states have return successors, (1406), 1287 states have call predecessors, (1406), 1288 states have call successors, (1406) [2025-03-03 14:26:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9081 states to 9081 states and 14787 transitions. [2025-03-03 14:26:28,207 INFO L78 Accepts]: Start accepts. Automaton has 9081 states and 14787 transitions. Word has length 232 [2025-03-03 14:26:28,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:28,208 INFO L471 AbstractCegarLoop]: Abstraction has 9081 states and 14787 transitions. [2025-03-03 14:26:28,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:26:28,208 INFO L276 IsEmpty]: Start isEmpty. Operand 9081 states and 14787 transitions. [2025-03-03 14:26:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 14:26:28,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:28,232 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:28,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:26:28,232 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash -469638669, now seen corresponding path program 1 times [2025-03-03 14:26:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:28,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446277642] [2025-03-03 14:26:28,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:28,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 14:26:28,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 14:26:28,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:28,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:28,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446277642] [2025-03-03 14:26:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446277642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034118158] [2025-03-03 14:26:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:28,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:28,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:28,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:28,298 INFO L87 Difference]: Start difference. First operand 9081 states and 14787 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:28,667 INFO L93 Difference]: Finished difference Result 22682 states and 37267 transitions. [2025-03-03 14:26:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:28,667 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 226 [2025-03-03 14:26:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:28,715 INFO L225 Difference]: With dead ends: 22682 [2025-03-03 14:26:28,715 INFO L226 Difference]: Without dead ends: 15091 [2025-03-03 14:26:28,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:28,732 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 153 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:28,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1650 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15091 states. [2025-03-03 14:26:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15091 to 15083. [2025-03-03 14:26:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15083 states, 12921 states have (on average 1.568918814333256) internal successors, (20272), 12932 states have internal predecessors, (20272), 2111 states have call successors, (2111), 46 states have call predecessors, (2111), 50 states have return successors, (2306), 2109 states have call predecessors, (2306), 2110 states have call successors, (2306) [2025-03-03 14:26:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15083 states to 15083 states and 24689 transitions. [2025-03-03 14:26:29,241 INFO L78 Accepts]: Start accepts. Automaton has 15083 states and 24689 transitions. Word has length 226 [2025-03-03 14:26:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:29,242 INFO L471 AbstractCegarLoop]: Abstraction has 15083 states and 24689 transitions. [2025-03-03 14:26:29,242 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 15083 states and 24689 transitions. [2025-03-03 14:26:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 14:26:29,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:29,270 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:29,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:26:29,271 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:29,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash -843733272, now seen corresponding path program 1 times [2025-03-03 14:26:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:29,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100110767] [2025-03-03 14:26:29,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:29,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 14:26:29,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 14:26:29,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:29,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:29,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:29,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100110767] [2025-03-03 14:26:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100110767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:29,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:29,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:29,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201334018] [2025-03-03 14:26:29,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:29,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:29,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:29,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:29,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:29,333 INFO L87 Difference]: Start difference. First operand 15083 states and 24689 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:29,878 INFO L93 Difference]: Finished difference Result 36289 states and 59168 transitions. [2025-03-03 14:26:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:29,879 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 227 [2025-03-03 14:26:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:29,965 INFO L225 Difference]: With dead ends: 36289 [2025-03-03 14:26:29,966 INFO L226 Difference]: Without dead ends: 23823 [2025-03-03 14:26:29,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:29,998 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 151 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:30,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1621 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23823 states. [2025-03-03 14:26:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23823 to 23815. [2025-03-03 14:26:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23815 states, 20450 states have (on average 1.5429339853300734) internal successors, (31553), 20461 states have internal predecessors, (31553), 3314 states have call successors, (3314), 46 states have call predecessors, (3314), 50 states have return successors, (3653), 3312 states have call predecessors, (3653), 3313 states have call successors, (3653) [2025-03-03 14:26:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23815 states to 23815 states and 38520 transitions. [2025-03-03 14:26:31,051 INFO L78 Accepts]: Start accepts. Automaton has 23815 states and 38520 transitions. Word has length 227 [2025-03-03 14:26:31,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:31,053 INFO L471 AbstractCegarLoop]: Abstraction has 23815 states and 38520 transitions. [2025-03-03 14:26:31,053 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, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand 23815 states and 38520 transitions. [2025-03-03 14:26:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 14:26:31,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:31,094 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:31,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 14:26:31,096 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:31,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash 110285650, now seen corresponding path program 1 times [2025-03-03 14:26:31,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:31,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78769811] [2025-03-03 14:26:31,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:31,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:31,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 14:26:31,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 14:26:31,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:31,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:31,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:31,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78769811] [2025-03-03 14:26:31,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78769811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:31,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:31,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:31,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177022387] [2025-03-03 14:26:31,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:31,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:31,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:31,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:31,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:31,159 INFO L87 Difference]: Start difference. First operand 23815 states and 38520 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:31,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:31,952 INFO L93 Difference]: Finished difference Result 62747 states and 101921 transitions. [2025-03-03 14:26:31,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:31,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 228 [2025-03-03 14:26:31,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:32,113 INFO L225 Difference]: With dead ends: 62747 [2025-03-03 14:26:32,113 INFO L226 Difference]: Without dead ends: 42353 [2025-03-03 14:26:32,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:32,166 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 149 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:32,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1643 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42353 states. [2025-03-03 14:26:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42353 to 42345. [2025-03-03 14:26:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42345 states, 36530 states have (on average 1.5435806186695866) internal successors, (56387), 36541 states have internal predecessors, (56387), 5764 states have call successors, (5764), 46 states have call predecessors, (5764), 50 states have return successors, (6377), 5762 states have call predecessors, (6377), 5763 states have call successors, (6377) [2025-03-03 14:26:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42345 states to 42345 states and 68528 transitions. [2025-03-03 14:26:33,790 INFO L78 Accepts]: Start accepts. Automaton has 42345 states and 68528 transitions. Word has length 228 [2025-03-03 14:26:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:33,790 INFO L471 AbstractCegarLoop]: Abstraction has 42345 states and 68528 transitions. [2025-03-03 14:26:33,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 42345 states and 68528 transitions. [2025-03-03 14:26:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 14:26:33,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:33,863 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:33,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 14:26:33,864 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:33,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash -225129398, now seen corresponding path program 1 times [2025-03-03 14:26:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754366795] [2025-03-03 14:26:33,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:33,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:33,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 14:26:33,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 14:26:33,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:33,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:33,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:33,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754366795] [2025-03-03 14:26:33,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754366795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:33,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:33,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337165418] [2025-03-03 14:26:33,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:33,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:33,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:33,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:33,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:33,948 INFO L87 Difference]: Start difference. First operand 42345 states and 68528 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:26:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:35,888 INFO L93 Difference]: Finished difference Result 114629 states and 186563 transitions. [2025-03-03 14:26:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:35,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 236 [2025-03-03 14:26:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:36,180 INFO L225 Difference]: With dead ends: 114629 [2025-03-03 14:26:36,181 INFO L226 Difference]: Without dead ends: 76872 [2025-03-03 14:26:36,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:36,262 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 147 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:36,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1655 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76872 states. [2025-03-03 14:26:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76872 to 76864. [2025-03-03 14:26:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76864 states, 66536 states have (on average 1.5478237345196586) internal successors, (102986), 66547 states have internal predecessors, (102986), 10277 states have call successors, (10277), 46 states have call predecessors, (10277), 50 states have return successors, (11422), 10275 states have call predecessors, (11422), 10276 states have call successors, (11422) [2025-03-03 14:26:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76864 states to 76864 states and 124685 transitions. [2025-03-03 14:26:39,636 INFO L78 Accepts]: Start accepts. Automaton has 76864 states and 124685 transitions. Word has length 236 [2025-03-03 14:26:39,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:39,637 INFO L471 AbstractCegarLoop]: Abstraction has 76864 states and 124685 transitions. [2025-03-03 14:26:39,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:26:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 76864 states and 124685 transitions. [2025-03-03 14:26:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 14:26:39,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:39,748 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:39,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 14:26:39,749 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:39,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:39,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1548318383, now seen corresponding path program 1 times [2025-03-03 14:26:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:39,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635954307] [2025-03-03 14:26:39,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:39,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:39,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 14:26:39,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 14:26:39,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:39,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-03 14:26:39,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:39,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635954307] [2025-03-03 14:26:39,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635954307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:39,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:39,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:39,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772883692] [2025-03-03 14:26:39,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:39,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:39,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:39,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:39,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:39,828 INFO L87 Difference]: Start difference. First operand 76864 states and 124685 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:43,124 INFO L93 Difference]: Finished difference Result 143580 states and 233745 transitions. [2025-03-03 14:26:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 230 [2025-03-03 14:26:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:43,727 INFO L225 Difference]: With dead ends: 143580 [2025-03-03 14:26:43,727 INFO L226 Difference]: Without dead ends: 143264 [2025-03-03 14:26:43,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:43,792 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 141 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:43,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1658 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143264 states. [2025-03-03 14:26:47,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143264 to 143256. [2025-03-03 14:26:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143256 states, 124560 states have (on average 1.5473185613359024) internal successors, (192734), 124571 states have internal predecessors, (192734), 18645 states have call successors, (18645), 46 states have call predecessors, (18645), 50 states have return successors, (20836), 18643 states have call predecessors, (20836), 18644 states have call successors, (20836) [2025-03-03 14:26:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143256 states to 143256 states and 232215 transitions. [2025-03-03 14:26:48,345 INFO L78 Accepts]: Start accepts. Automaton has 143256 states and 232215 transitions. Word has length 230 [2025-03-03 14:26:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:48,345 INFO L471 AbstractCegarLoop]: Abstraction has 143256 states and 232215 transitions. [2025-03-03 14:26:48,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:26:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 143256 states and 232215 transitions. [2025-03-03 14:26:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 14:26:48,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:48,460 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:48,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 14:26:48,460 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__DecryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:48,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash -281282838, now seen corresponding path program 1 times [2025-03-03 14:26:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:48,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957507336] [2025-03-03 14:26:48,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:48,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:48,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 14:26:48,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 14:26:48,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:48,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-03 14:26:48,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:48,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957507336] [2025-03-03 14:26:48,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957507336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:48,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938371975] [2025-03-03 14:26:48,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:48,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:48,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:48,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:48,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:26:49,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 14:26:49,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 14:26:49,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:49,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:49,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 1603 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:26:49,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-03 14:26:49,450 INFO L312 TraceCheckSpWp]: Computing backward predicates...