./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product29.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9244be1607acf28cf3da39a66e263e3f7b227fe42ed993f89a6311649f8ded26 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:48:35,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:48:35,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:48:35,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:48:35,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:48:35,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:48:35,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:48:35,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:48:35,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:48:35,764 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:48:35,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:48:35,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:48:35,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:48:35,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:48:35,764 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:48:35,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:48:35,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:48:35,765 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:48:35,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:48:35,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:48:35,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:48:35,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:48:35,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:48:35,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:48:35,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:48:35,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:48:35,766 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:48:35,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:48:35,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:48:35,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:48:35,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:48:35,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:48:35,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:35,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:48:35,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:48:35,766 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:48:35,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:48:35,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:48:35,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:48:35,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:48:35,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:48:35,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:48:35,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:48:35,767 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9244be1607acf28cf3da39a66e263e3f7b227fe42ed993f89a6311649f8ded26 [2025-02-05 15:48:35,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:48:35,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:48:35,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:48:35,979 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:48:35,979 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:48:35,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product29.cil.c [2025-02-05 15:48:37,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe4e0e8f8/17e6569d4329487a97ad57f78f2ad8a1/FLAGdff856746 [2025-02-05 15:48:37,479 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:48:37,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product29.cil.c [2025-02-05 15:48:37,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe4e0e8f8/17e6569d4329487a97ad57f78f2ad8a1/FLAGdff856746 [2025-02-05 15:48:37,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fe4e0e8f8/17e6569d4329487a97ad57f78f2ad8a1 [2025-02-05 15:48:37,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:48:37,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:48:37,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:37,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:48:37,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:48:37,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:37" (1/1) ... [2025-02-05 15:48:37,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae569ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:37, skipping insertion in model container [2025-02-05 15:48:37,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:37" (1/1) ... [2025-02-05 15:48:37,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:48:37,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product29.cil.c[29472,29485] [2025-02-05 15:48:38,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:38,129 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:48:38,136 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-02-05 15:48:38,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [460] [2025-02-05 15:48:38,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [509] [2025-02-05 15:48:38,137 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [648] [2025-02-05 15:48:38,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [692] [2025-02-05 15:48:38,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1058] [2025-02-05 15:48:38,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1075] [2025-02-05 15:48:38,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1300] [2025-02-05 15:48:38,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1309] [2025-02-05 15:48:38,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1688] [2025-02-05 15:48:38,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1975] [2025-02-05 15:48:38,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product29.cil.c[29472,29485] [2025-02-05 15:48:38,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:38,283 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:48:38,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38 WrapperNode [2025-02-05 15:48:38,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:38,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:38,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:48:38,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:48:38,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,370 INFO L138 Inliner]: procedures = 132, calls = 214, calls flagged for inlining = 56, calls inlined = 48, statements flattened = 937 [2025-02-05 15:48:38,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:38,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:48:38,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:48:38,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:48:38,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,419 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:48:38,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:48:38,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:48:38,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:48:38,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:48:38,467 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (1/1) ... [2025-02-05 15:48:38,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:38,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:38,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:48:38,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:48:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:48:38,526 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:48:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:48:38,526 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:48:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:48:38,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:48:38,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:48:38,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:48:38,527 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:48:38,527 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:48:38,527 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:48:38,527 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:48:38,527 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:48:38,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:48:38,527 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:48:38,527 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:48:38,527 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:48:38,527 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:48:38,527 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:48:38,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:48:38,527 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:48:38,528 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:48:38,528 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:48:38,528 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:48:38,528 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:48:38,528 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:48:38,528 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:48:38,528 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:48:38,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:48:38,528 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:48:38,528 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:48:38,528 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:48:38,528 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:48:38,528 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:48:38,528 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:48:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:48:38,529 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:48:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:48:38,529 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:48:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:48:38,529 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:48:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:48:38,529 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:48:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-02-05 15:48:38,529 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-02-05 15:48:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:48:38,529 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:48:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:48:38,529 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:48:38,529 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:48:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:48:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:48:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:48:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:48:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:48:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:48:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:48:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:48:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:48:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:48:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:48:38,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:48:38,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:48:38,679 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:48:38,681 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:48:38,784 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: #res := ~retValue_acc~8; [2025-02-05 15:48:38,795 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1599: #res := ~retValue_acc~25; [2025-02-05 15:48:38,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2673: #res#1 := ~retValue_acc~38#1; [2025-02-05 15:48:38,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2628-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-02-05 15:48:38,863 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2897: #res := ~retValue_acc~41; [2025-02-05 15:48:38,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-02-05 15:48:38,962 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2581: #res := ~retValue_acc~36; [2025-02-05 15:48:38,969 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-1: createEmail_#res#1 := createEmail_~retValue_acc~16#1; [2025-02-05 15:48:38,975 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2125: #res := ~retValue_acc~30; [2025-02-05 15:48:38,994 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-02-05 15:48:39,020 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-02-05 15:48:39,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: #res := ~retValue_acc~9; [2025-02-05 15:48:39,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-02-05 15:48:39,105 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: #res := ~retValue_acc~34; [2025-02-05 15:48:39,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2843-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-02-05 15:48:39,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L506-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-02-05 15:48:39,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-02-05 15:48:39,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1556-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-02-05 15:48:39,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-02-05 15:48:39,312 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1574-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-02-05 15:48:39,317 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-02-05 15:48:39,324 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: #res#1 := ~retValue_acc~14#1; [2025-02-05 15:48:39,325 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L601-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~13#1; [2025-02-05 15:48:39,435 INFO L? ?]: Removed 505 outVars from TransFormulas that were not future-live. [2025-02-05 15:48:39,435 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:48:39,467 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:48:39,467 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:48:39,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:48:39 BoogieIcfgContainer [2025-02-05 15:48:39,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:48:39,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:48:39,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:48:39,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:48:39,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:48:37" (1/3) ... [2025-02-05 15:48:39,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2bfcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:48:39, skipping insertion in model container [2025-02-05 15:48:39,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:38" (2/3) ... [2025-02-05 15:48:39,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2bfcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:48:39, skipping insertion in model container [2025-02-05 15:48:39,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:48:39" (3/3) ... [2025-02-05 15:48:39,474 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product29.cil.c [2025-02-05 15:48:39,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:48:39,487 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product29.cil.c that has 29 procedures, 408 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:48:39,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:48:39,537 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;@4a80ae8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:48:39,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:48:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 408 states, 315 states have (on average 1.5523809523809524) internal successors, (489), 320 states have internal predecessors, (489), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-02-05 15:48:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:48:39,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:39,553 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:39,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:39,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1678365918, now seen corresponding path program 1 times [2025-02-05 15:48:39,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:39,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249802909] [2025-02-05 15:48:39,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:39,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:39,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:48:39,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:48:39,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:39,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:40,178 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:48:40,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:40,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249802909] [2025-02-05 15:48:40,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249802909] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:40,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371181435] [2025-02-05 15:48:40,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:40,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:40,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:40,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:40,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:48:40,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:48:40,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:48:40,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:40,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:40,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1067 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:48:40,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:40,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:40,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371181435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:40,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:40,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:48:40,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537776529] [2025-02-05 15:48:40,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:40,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:48:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:40,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:48:40,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:40,481 INFO L87 Difference]: Start difference. First operand has 408 states, 315 states have (on average 1.5523809523809524) internal successors, (489), 320 states have internal predecessors, (489), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:40,516 INFO L93 Difference]: Finished difference Result 629 states and 930 transitions. [2025-02-05 15:48:40,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:48:40,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-02-05 15:48:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:40,526 INFO L225 Difference]: With dead ends: 629 [2025-02-05 15:48:40,526 INFO L226 Difference]: Without dead ends: 401 [2025-02-05 15:48:40,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:40,531 INFO L435 NwaCegarLoop]: 612 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, 612 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:40,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-05 15:48:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-02-05 15:48:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 309 states have (on average 1.5501618122977345) internal successors, (479), 313 states have internal predecessors, (479), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 15:48:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 604 transitions. [2025-02-05 15:48:40,575 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 604 transitions. Word has length 110 [2025-02-05 15:48:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:40,576 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 604 transitions. [2025-02-05 15:48:40,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 604 transitions. [2025-02-05 15:48:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:48:40,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:40,598 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:40,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:48:40,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:48:40,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:40,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1125986160, now seen corresponding path program 1 times [2025-02-05 15:48:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:40,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820413879] [2025-02-05 15:48:40,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:40,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:48:40,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:48:40,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:40,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:48:41,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820413879] [2025-02-05 15:48:41,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820413879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037699563] [2025-02-05 15:48:41,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:41,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:41,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:41,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:41,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:48:41,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:48:41,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:48:41,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:41,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:41,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:48:41,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:41,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037699563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:41,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:41,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:48:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744448452] [2025-02-05 15:48:41,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:41,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:41,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:41,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:41,448 INFO L87 Difference]: Start difference. First operand 401 states and 604 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:41,503 INFO L93 Difference]: Finished difference Result 618 states and 908 transitions. [2025-02-05 15:48:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:41,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2025-02-05 15:48:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:41,510 INFO L225 Difference]: With dead ends: 618 [2025-02-05 15:48:41,511 INFO L226 Difference]: Without dead ends: 403 [2025-02-05 15:48:41,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:41,512 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 0 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:41,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1204 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-05 15:48:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-02-05 15:48:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 311 states have (on average 1.5466237942122187) internal successors, (481), 315 states have internal predecessors, (481), 63 states have call successors, (63), 28 states have call predecessors, (63), 28 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-05 15:48:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 606 transitions. [2025-02-05 15:48:41,554 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 606 transitions. Word has length 111 [2025-02-05 15:48:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:41,555 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 606 transitions. [2025-02-05 15:48:41,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 606 transitions. [2025-02-05 15:48:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:48:41,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:41,562 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:41,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:48:41,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:41,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash -711667533, now seen corresponding path program 1 times [2025-02-05 15:48:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:41,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28331656] [2025-02-05 15:48:41,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:41,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:41,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:48:41,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:48:41,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:41,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:41,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:41,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28331656] [2025-02-05 15:48:41,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28331656] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:41,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215530219] [2025-02-05 15:48:41,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:41,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:41,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:41,990 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:41,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:48:42,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:48:42,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:48:42,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:42,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:42,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:42,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:42,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:42,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215530219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:42,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:42,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:48:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724631427] [2025-02-05 15:48:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:42,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:42,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:42,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:42,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:42,278 INFO L87 Difference]: Start difference. First operand 403 states and 606 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:42,339 INFO L93 Difference]: Finished difference Result 848 states and 1295 transitions. [2025-02-05 15:48:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:42,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-02-05 15:48:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:42,343 INFO L225 Difference]: With dead ends: 848 [2025-02-05 15:48:42,346 INFO L226 Difference]: Without dead ends: 472 [2025-02-05 15:48:42,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:42,353 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 126 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:42,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1176 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-02-05 15:48:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 464. [2025-02-05 15:48:42,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 358 states have (on average 1.5670391061452513) internal successors, (561), 362 states have internal predecessors, (561), 77 states have call successors, (77), 28 states have call predecessors, (77), 28 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-05 15:48:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 714 transitions. [2025-02-05 15:48:42,397 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 714 transitions. Word has length 116 [2025-02-05 15:48:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:42,398 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 714 transitions. [2025-02-05 15:48:42,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 714 transitions. [2025-02-05 15:48:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:48:42,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:42,404 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:42,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:48:42,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:42,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:42,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1666778197, now seen corresponding path program 1 times [2025-02-05 15:48:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:42,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514391251] [2025-02-05 15:48:42,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:42,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:48:42,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:48:42,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:42,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:42,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:42,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514391251] [2025-02-05 15:48:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514391251] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:42,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441487954] [2025-02-05 15:48:42,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:42,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:42,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:42,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:42,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:48:43,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:48:43,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:48:43,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:43,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:43,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:48:43,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:48:43,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:43,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441487954] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:43,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:43,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:48:43,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480953755] [2025-02-05 15:48:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:43,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:43,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:43,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:48:43,259 INFO L87 Difference]: Start difference. First operand 464 states and 714 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:43,312 INFO L93 Difference]: Finished difference Result 919 states and 1418 transitions. [2025-02-05 15:48:43,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:43,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 117 [2025-02-05 15:48:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:43,316 INFO L225 Difference]: With dead ends: 919 [2025-02-05 15:48:43,316 INFO L226 Difference]: Without dead ends: 466 [2025-02-05 15:48:43,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:48:43,318 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 2 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2373 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:43,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2373 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-02-05 15:48:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-02-05 15:48:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 359 states have (on average 1.565459610027855) internal successors, (562), 364 states have internal predecessors, (562), 77 states have call successors, (77), 28 states have call predecessors, (77), 29 states have return successors, (78), 75 states have call predecessors, (78), 76 states have call successors, (78) [2025-02-05 15:48:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 717 transitions. [2025-02-05 15:48:43,330 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 717 transitions. Word has length 117 [2025-02-05 15:48:43,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:43,330 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 717 transitions. [2025-02-05 15:48:43,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 717 transitions. [2025-02-05 15:48:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:48:43,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:43,332 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:48:43,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:43,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:43,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:43,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:43,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1788049971, now seen corresponding path program 1 times [2025-02-05 15:48:43,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:43,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864260821] [2025-02-05 15:48:43,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:43,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:43,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:48:43,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:48:43,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:43,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:48:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864260821] [2025-02-05 15:48:43,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864260821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401223408] [2025-02-05 15:48:43,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:43,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:43,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:43,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:43,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:48:43,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:48:43,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:48:43,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:43,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:43,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:48:43,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:48:43,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:43,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401223408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:43,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:43,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:48:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233456895] [2025-02-05 15:48:43,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:43,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:43,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:43,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:43,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:43,937 INFO L87 Difference]: Start difference. First operand 466 states and 717 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:43,998 INFO L93 Difference]: Finished difference Result 921 states and 1423 transitions. [2025-02-05 15:48:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:43,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2025-02-05 15:48:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:44,001 INFO L225 Difference]: With dead ends: 921 [2025-02-05 15:48:44,001 INFO L226 Difference]: Without dead ends: 468 [2025-02-05 15:48:44,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:44,003 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:44,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2359 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-05 15:48:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-02-05 15:48:44,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 360 states have (on average 1.5638888888888889) internal successors, (563), 366 states have internal predecessors, (563), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (83), 75 states have call predecessors, (83), 76 states have call successors, (83) [2025-02-05 15:48:44,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 723 transitions. [2025-02-05 15:48:44,017 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 723 transitions. Word has length 118 [2025-02-05 15:48:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:44,017 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 723 transitions. [2025-02-05 15:48:44,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 723 transitions. [2025-02-05 15:48:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:48:44,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:44,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:44,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:48:44,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:44,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:44,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:44,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1889293408, now seen corresponding path program 1 times [2025-02-05 15:48:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:44,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183643816] [2025-02-05 15:48:44,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:44,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:44,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:48:44,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:48:44,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:44,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:44,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:44,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183643816] [2025-02-05 15:48:44,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183643816] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:44,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:44,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:44,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988656203] [2025-02-05 15:48:44,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:44,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:44,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:44,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:44,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:44,486 INFO L87 Difference]: Start difference. First operand 468 states and 723 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:44,524 INFO L93 Difference]: Finished difference Result 913 states and 1414 transitions. [2025-02-05 15:48:44,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:44,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2025-02-05 15:48:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:44,527 INFO L225 Difference]: With dead ends: 913 [2025-02-05 15:48:44,527 INFO L226 Difference]: Without dead ends: 468 [2025-02-05 15:48:44,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:44,529 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 2 mSDsluCounter, 1780 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:44,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2377 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-05 15:48:44,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-02-05 15:48:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 360 states have (on average 1.5638888888888889) internal successors, (563), 366 states have internal predecessors, (563), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (82), 75 states have call predecessors, (82), 76 states have call successors, (82) [2025-02-05 15:48:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 722 transitions. [2025-02-05 15:48:44,542 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 722 transitions. Word has length 119 [2025-02-05 15:48:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:44,542 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 722 transitions. [2025-02-05 15:48:44,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 722 transitions. [2025-02-05 15:48:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:48:44,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:44,544 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:44,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:48:44,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:44,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:44,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2019830172, now seen corresponding path program 2 times [2025-02-05 15:48:44,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:44,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387416800] [2025-02-05 15:48:44,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:48:44,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:44,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-02-05 15:48:44,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:48:44,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:48:44,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:44,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387416800] [2025-02-05 15:48:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387416800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:44,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139308997] [2025-02-05 15:48:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:44,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:44,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:44,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:44,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:44,646 INFO L87 Difference]: Start difference. First operand 468 states and 722 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:44,690 INFO L93 Difference]: Finished difference Result 911 states and 1409 transitions. [2025-02-05 15:48:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:44,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-02-05 15:48:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:44,694 INFO L225 Difference]: With dead ends: 911 [2025-02-05 15:48:44,694 INFO L226 Difference]: Without dead ends: 468 [2025-02-05 15:48:44,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:44,695 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 2 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:44,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2363 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:44,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-05 15:48:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-02-05 15:48:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 360 states have (on average 1.5638888888888889) internal successors, (563), 366 states have internal predecessors, (563), 77 states have call successors, (77), 28 states have call predecessors, (77), 30 states have return successors, (81), 75 states have call predecessors, (81), 76 states have call successors, (81) [2025-02-05 15:48:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 721 transitions. [2025-02-05 15:48:44,711 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 721 transitions. Word has length 120 [2025-02-05 15:48:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:44,711 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 721 transitions. [2025-02-05 15:48:44,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 721 transitions. [2025-02-05 15:48:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:48:44,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:44,713 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:44,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:48:44,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash -781478247, now seen corresponding path program 3 times [2025-02-05 15:48:44,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:44,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412112167] [2025-02-05 15:48:44,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:48:44,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:44,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 3 equivalence classes. [2025-02-05 15:48:44,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 109 of 121 statements. [2025-02-05 15:48:44,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:48:44,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:44,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:44,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412112167] [2025-02-05 15:48:44,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412112167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:44,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:44,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250942051] [2025-02-05 15:48:44,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:44,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:44,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:44,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:44,815 INFO L87 Difference]: Start difference. First operand 468 states and 721 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:44,861 INFO L93 Difference]: Finished difference Result 913 states and 1415 transitions. [2025-02-05 15:48:44,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:44,861 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), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-02-05 15:48:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:44,864 INFO L225 Difference]: With dead ends: 913 [2025-02-05 15:48:44,865 INFO L226 Difference]: Without dead ends: 470 [2025-02-05 15:48:44,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:44,866 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2374 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:44,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2374 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-05 15:48:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-02-05 15:48:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 361 states have (on average 1.5623268698060941) internal successors, (564), 368 states have internal predecessors, (564), 77 states have call successors, (77), 28 states have call predecessors, (77), 31 states have return successors, (86), 75 states have call predecessors, (86), 76 states have call successors, (86) [2025-02-05 15:48:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 727 transitions. [2025-02-05 15:48:44,882 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 727 transitions. Word has length 121 [2025-02-05 15:48:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:44,882 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 727 transitions. [2025-02-05 15:48:44,882 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), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 727 transitions. [2025-02-05 15:48:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:48:44,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:44,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:44,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:48:44,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash 215348103, now seen corresponding path program 1 times [2025-02-05 15:48:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620251524] [2025-02-05 15:48:44,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:44,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:48:44,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:48:44,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:44,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:44,986 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:44,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:44,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620251524] [2025-02-05 15:48:44,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620251524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:44,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:44,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494962779] [2025-02-05 15:48:44,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:44,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:44,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:44,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:44,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:44,988 INFO L87 Difference]: Start difference. First operand 470 states and 727 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:45,025 INFO L93 Difference]: Finished difference Result 919 states and 1425 transitions. [2025-02-05 15:48:45,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:45,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-02-05 15:48:45,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:45,029 INFO L225 Difference]: With dead ends: 919 [2025-02-05 15:48:45,029 INFO L226 Difference]: Without dead ends: 472 [2025-02-05 15:48:45,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:45,031 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:45,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2380 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:45,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-02-05 15:48:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-02-05 15:48:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 362 states have (on average 1.5607734806629834) internal successors, (565), 370 states have internal predecessors, (565), 77 states have call successors, (77), 28 states have call predecessors, (77), 32 states have return successors, (88), 75 states have call predecessors, (88), 76 states have call successors, (88) [2025-02-05 15:48:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 730 transitions. [2025-02-05 15:48:45,046 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 730 transitions. Word has length 122 [2025-02-05 15:48:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:45,047 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 730 transitions. [2025-02-05 15:48:45,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:48:45,047 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 730 transitions. [2025-02-05 15:48:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:48:45,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:45,048 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:45,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:48:45,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:45,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1189053894, now seen corresponding path program 1 times [2025-02-05 15:48:45,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:45,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887153263] [2025-02-05 15:48:45,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:45,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:48:45,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:48:45,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:45,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:45,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:45,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887153263] [2025-02-05 15:48:45,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887153263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:45,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529583844] [2025-02-05 15:48:45,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:45,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:45,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:45,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:45,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:48:45,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:48:45,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:48:45,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:45,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:45,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:45,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:45,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:48:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:45,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529583844] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:48:45,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:48:45,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:48:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643355074] [2025-02-05 15:48:45,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:48:45,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:48:45,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:45,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:48:45,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:48:45,481 INFO L87 Difference]: Start difference. First operand 472 states and 730 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:48:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:45,602 INFO L93 Difference]: Finished difference Result 1099 states and 1760 transitions. [2025-02-05 15:48:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:48:45,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 123 [2025-02-05 15:48:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:45,607 INFO L225 Difference]: With dead ends: 1099 [2025-02-05 15:48:45,607 INFO L226 Difference]: Without dead ends: 884 [2025-02-05 15:48:45,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:48:45,608 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 489 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:45,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 2164 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:48:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-02-05 15:48:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 860. [2025-02-05 15:48:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 671 states have (on average 1.6289120715350223) internal successors, (1093), 679 states have internal predecessors, (1093), 156 states have call successors, (156), 28 states have call predecessors, (156), 32 states have return successors, (177), 154 states have call predecessors, (177), 155 states have call successors, (177) [2025-02-05 15:48:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1426 transitions. [2025-02-05 15:48:45,636 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1426 transitions. Word has length 123 [2025-02-05 15:48:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:45,637 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1426 transitions. [2025-02-05 15:48:45,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:48:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1426 transitions. [2025-02-05 15:48:45,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:48:45,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:45,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:45,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:45,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:48:45,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:45,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash 252804070, now seen corresponding path program 1 times [2025-02-05 15:48:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:45,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768827228] [2025-02-05 15:48:45,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:45,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:45,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:48:45,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:48:45,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:45,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:45,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:45,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768827228] [2025-02-05 15:48:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768827228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:45,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263160729] [2025-02-05 15:48:45,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:45,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:45,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:45,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:45,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:45,907 INFO L87 Difference]: Start difference. First operand 860 states and 1426 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:45,943 INFO L93 Difference]: Finished difference Result 2047 states and 3446 transitions. [2025-02-05 15:48:45,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:45,943 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-02-05 15:48:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:45,950 INFO L225 Difference]: With dead ends: 2047 [2025-02-05 15:48:45,950 INFO L226 Difference]: Without dead ends: 1253 [2025-02-05 15:48:45,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:45,953 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 124 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:45,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-02-05 15:48:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1245. [2025-02-05 15:48:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 977 states have (on average 1.645854657113613) internal successors, (1608), 985 states have internal predecessors, (1608), 235 states have call successors, (235), 28 states have call predecessors, (235), 32 states have return successors, (266), 233 states have call predecessors, (266), 234 states have call successors, (266) [2025-02-05 15:48:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 2109 transitions. [2025-02-05 15:48:45,997 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 2109 transitions. Word has length 129 [2025-02-05 15:48:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:45,997 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 2109 transitions. [2025-02-05 15:48:45,997 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 2109 transitions. [2025-02-05 15:48:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:48:46,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:46,003 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:46,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:48:46,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:46,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash 513593049, now seen corresponding path program 1 times [2025-02-05 15:48:46,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:46,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974508998] [2025-02-05 15:48:46,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:46,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:46,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:48:46,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:48:46,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:46,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:46,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:46,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974508998] [2025-02-05 15:48:46,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974508998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:46,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:46,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959992061] [2025-02-05 15:48:46,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:46,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:46,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:46,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:46,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:46,052 INFO L87 Difference]: Start difference. First operand 1245 states and 2109 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:46,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:46,099 INFO L93 Difference]: Finished difference Result 2985 states and 5093 transitions. [2025-02-05 15:48:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:46,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-02-05 15:48:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:46,108 INFO L225 Difference]: With dead ends: 2985 [2025-02-05 15:48:46,108 INFO L226 Difference]: Without dead ends: 1857 [2025-02-05 15:48:46,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:46,112 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 122 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:46,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1202 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2025-02-05 15:48:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1849. [2025-02-05 15:48:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1462 states have (on average 1.6573187414500683) internal successors, (2423), 1470 states have internal predecessors, (2423), 354 states have call successors, (354), 28 states have call predecessors, (354), 32 states have return successors, (385), 352 states have call predecessors, (385), 353 states have call successors, (385) [2025-02-05 15:48:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 3162 transitions. [2025-02-05 15:48:46,240 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 3162 transitions. Word has length 130 [2025-02-05 15:48:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:46,240 INFO L471 AbstractCegarLoop]: Abstraction has 1849 states and 3162 transitions. [2025-02-05 15:48:46,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 3162 transitions. [2025-02-05 15:48:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:48:46,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:46,252 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:46,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:48:46,252 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:46,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash -803572091, now seen corresponding path program 1 times [2025-02-05 15:48:46,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:46,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600078226] [2025-02-05 15:48:46,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:46,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:46,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:48:46,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:48:46,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:46,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:46,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:46,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600078226] [2025-02-05 15:48:46,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600078226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:46,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:46,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489722707] [2025-02-05 15:48:46,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:46,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:46,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:46,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:46,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:46,343 INFO L87 Difference]: Start difference. First operand 1849 states and 3162 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:46,436 INFO L93 Difference]: Finished difference Result 4392 states and 7575 transitions. [2025-02-05 15:48:46,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:46,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-02-05 15:48:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:46,454 INFO L225 Difference]: With dead ends: 4392 [2025-02-05 15:48:46,455 INFO L226 Difference]: Without dead ends: 2782 [2025-02-05 15:48:46,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:46,463 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 120 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:46,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2025-02-05 15:48:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2774. [2025-02-05 15:48:46,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 2225 states have (on average 1.6665168539325843) internal successors, (3708), 2233 states have internal predecessors, (3708), 516 states have call successors, (516), 28 states have call predecessors, (516), 32 states have return successors, (563), 514 states have call predecessors, (563), 515 states have call successors, (563) [2025-02-05 15:48:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 4787 transitions. [2025-02-05 15:48:46,588 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 4787 transitions. Word has length 131 [2025-02-05 15:48:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:46,589 INFO L471 AbstractCegarLoop]: Abstraction has 2774 states and 4787 transitions. [2025-02-05 15:48:46,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 4787 transitions. [2025-02-05 15:48:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:48:46,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:46,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:46,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:48:46,603 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:46,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1837821402, now seen corresponding path program 1 times [2025-02-05 15:48:46,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:46,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390028348] [2025-02-05 15:48:46,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:46,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:46,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:48:46,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:48:46,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:46,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:46,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:46,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390028348] [2025-02-05 15:48:46,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390028348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:46,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:46,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:46,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449512232] [2025-02-05 15:48:46,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:46,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:46,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:46,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:46,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:46,675 INFO L87 Difference]: Start difference. First operand 2774 states and 4787 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:46,784 INFO L93 Difference]: Finished difference Result 6610 states and 11496 transitions. [2025-02-05 15:48:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:46,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-02-05 15:48:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:46,808 INFO L225 Difference]: With dead ends: 6610 [2025-02-05 15:48:46,808 INFO L226 Difference]: Without dead ends: 4275 [2025-02-05 15:48:46,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:46,818 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 118 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:46,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:46,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-02-05 15:48:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4267. [2025-02-05 15:48:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 3473 states have (on average 1.6731932047221423) internal successors, (5811), 3481 states have internal predecessors, (5811), 761 states have call successors, (761), 28 states have call predecessors, (761), 32 states have return successors, (834), 759 states have call predecessors, (834), 760 states have call successors, (834) [2025-02-05 15:48:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 7406 transitions. [2025-02-05 15:48:47,051 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 7406 transitions. Word has length 132 [2025-02-05 15:48:47,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:47,052 INFO L471 AbstractCegarLoop]: Abstraction has 4267 states and 7406 transitions. [2025-02-05 15:48:47,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 7406 transitions. [2025-02-05 15:48:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:48:47,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:47,069 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:47,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:48:47,069 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:47,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2036046404, now seen corresponding path program 1 times [2025-02-05 15:48:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:47,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578153244] [2025-02-05 15:48:47,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:47,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:48:47,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:48:47,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:47,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:47,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:47,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578153244] [2025-02-05 15:48:47,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578153244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:47,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:47,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:47,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915837446] [2025-02-05 15:48:47,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:47,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:47,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:47,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:47,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:47,132 INFO L87 Difference]: Start difference. First operand 4267 states and 7406 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:47,297 INFO L93 Difference]: Finished difference Result 10570 states and 18452 transitions. [2025-02-05 15:48:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:47,297 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-02-05 15:48:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:47,343 INFO L225 Difference]: With dead ends: 10570 [2025-02-05 15:48:47,344 INFO L226 Difference]: Without dead ends: 6969 [2025-02-05 15:48:47,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:47,360 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 116 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:47,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6969 states. [2025-02-05 15:48:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6969 to 6961. [2025-02-05 15:48:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6961 states, 5674 states have (on average 1.6702502643637644) internal successors, (9477), 5682 states have internal predecessors, (9477), 1254 states have call successors, (1254), 28 states have call predecessors, (1254), 32 states have return successors, (1371), 1252 states have call predecessors, (1371), 1253 states have call successors, (1371) [2025-02-05 15:48:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6961 states to 6961 states and 12102 transitions. [2025-02-05 15:48:47,716 INFO L78 Accepts]: Start accepts. Automaton has 6961 states and 12102 transitions. Word has length 133 [2025-02-05 15:48:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:47,717 INFO L471 AbstractCegarLoop]: Abstraction has 6961 states and 12102 transitions. [2025-02-05 15:48:47,717 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 6961 states and 12102 transitions. [2025-02-05 15:48:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:48:47,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:47,742 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:47,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:48:47,743 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:47,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash -820605925, now seen corresponding path program 1 times [2025-02-05 15:48:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:47,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531562912] [2025-02-05 15:48:47,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:47,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:48:47,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:48:47,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:47,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:47,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:47,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531562912] [2025-02-05 15:48:47,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531562912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:47,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:47,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620920560] [2025-02-05 15:48:47,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:47,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:47,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:47,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:47,811 INFO L87 Difference]: Start difference. First operand 6961 states and 12102 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:48,059 INFO L93 Difference]: Finished difference Result 17605 states and 30808 transitions. [2025-02-05 15:48:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:48,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2025-02-05 15:48:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:48,117 INFO L225 Difference]: With dead ends: 17605 [2025-02-05 15:48:48,117 INFO L226 Difference]: Without dead ends: 11681 [2025-02-05 15:48:48,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:48,236 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 114 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:48,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1210 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11681 states. [2025-02-05 15:48:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11681 to 11673. [2025-02-05 15:48:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11673 states, 9564 states have (on average 1.6711626934337098) internal successors, (15983), 9572 states have internal predecessors, (15983), 2076 states have call successors, (2076), 28 states have call predecessors, (2076), 32 states have return successors, (2271), 2074 states have call predecessors, (2271), 2075 states have call successors, (2271) [2025-02-05 15:48:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11673 states to 11673 states and 20330 transitions. [2025-02-05 15:48:48,703 INFO L78 Accepts]: Start accepts. Automaton has 11673 states and 20330 transitions. Word has length 134 [2025-02-05 15:48:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:48,703 INFO L471 AbstractCegarLoop]: Abstraction has 11673 states and 20330 transitions. [2025-02-05 15:48:48,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 11673 states and 20330 transitions. [2025-02-05 15:48:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:48:48,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:48,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:48,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:48:48,739 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:48,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:48,739 INFO L85 PathProgramCache]: Analyzing trace with hash -458271325, now seen corresponding path program 1 times [2025-02-05 15:48:48,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:48,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661278335] [2025-02-05 15:48:48,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:48,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:48,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:48:48,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:48:48,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:48,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:48,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:48,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661278335] [2025-02-05 15:48:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661278335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:48,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:48,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89150374] [2025-02-05 15:48:48,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:48,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:48,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:48,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:48,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:48,805 INFO L87 Difference]: Start difference. First operand 11673 states and 20330 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:49,290 INFO L93 Difference]: Finished difference Result 27836 states and 48450 transitions. [2025-02-05 15:48:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:49,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2025-02-05 15:48:49,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:49,365 INFO L225 Difference]: With dead ends: 27836 [2025-02-05 15:48:49,365 INFO L226 Difference]: Without dead ends: 18137 [2025-02-05 15:48:49,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:49,412 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 112 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:49,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1180 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18137 states. [2025-02-05 15:48:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18137 to 18129. [2025-02-05 15:48:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18129 states, 14817 states have (on average 1.6475669838698792) internal successors, (24412), 14825 states have internal predecessors, (24412), 3279 states have call successors, (3279), 28 states have call predecessors, (3279), 32 states have return successors, (3618), 3277 states have call predecessors, (3618), 3278 states have call successors, (3618) [2025-02-05 15:48:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18129 states to 18129 states and 31309 transitions. [2025-02-05 15:48:50,211 INFO L78 Accepts]: Start accepts. Automaton has 18129 states and 31309 transitions. Word has length 135 [2025-02-05 15:48:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:50,212 INFO L471 AbstractCegarLoop]: Abstraction has 18129 states and 31309 transitions. [2025-02-05 15:48:50,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 18129 states and 31309 transitions. [2025-02-05 15:48:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:48:50,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:50,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:50,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:48:50,241 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:50,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:50,243 INFO L85 PathProgramCache]: Analyzing trace with hash -714846436, now seen corresponding path program 1 times [2025-02-05 15:48:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:50,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3708080] [2025-02-05 15:48:50,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:50,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:50,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:48:50,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:48:50,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:50,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:50,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3708080] [2025-02-05 15:48:50,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3708080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:50,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:50,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:50,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241393523] [2025-02-05 15:48:50,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:50,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:50,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:50,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:50,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:50,301 INFO L87 Difference]: Start difference. First operand 18129 states and 31309 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:50,900 INFO L93 Difference]: Finished difference Result 47863 states and 83019 transitions. [2025-02-05 15:48:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:50,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-02-05 15:48:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:51,027 INFO L225 Difference]: With dead ends: 47863 [2025-02-05 15:48:51,028 INFO L226 Difference]: Without dead ends: 32307 [2025-02-05 15:48:51,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:51,076 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 110 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:51,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1200 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:51,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32307 states. [2025-02-05 15:48:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32307 to 32299. [2025-02-05 15:48:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32299 states, 26537 states have (on average 1.644986245619324) internal successors, (43653), 26545 states have internal predecessors, (43653), 5729 states have call successors, (5729), 28 states have call predecessors, (5729), 32 states have return successors, (6342), 5727 states have call predecessors, (6342), 5728 states have call successors, (6342) [2025-02-05 15:48:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32299 states to 32299 states and 55724 transitions. [2025-02-05 15:48:52,540 INFO L78 Accepts]: Start accepts. Automaton has 32299 states and 55724 transitions. Word has length 136 [2025-02-05 15:48:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:52,541 INFO L471 AbstractCegarLoop]: Abstraction has 32299 states and 55724 transitions. [2025-02-05 15:48:52,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 32299 states and 55724 transitions. [2025-02-05 15:48:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:48:52,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:52,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:52,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:48:52,585 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash -573710302, now seen corresponding path program 1 times [2025-02-05 15:48:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489048132] [2025-02-05 15:48:52,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:52,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:48:52,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:48:52,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:52,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:52,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:52,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489048132] [2025-02-05 15:48:52,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489048132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:52,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:52,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:52,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856561722] [2025-02-05 15:48:52,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:52,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:52,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:52,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:52,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:52,650 INFO L87 Difference]: Start difference. First operand 32299 states and 55724 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:53,848 INFO L93 Difference]: Finished difference Result 87980 states and 152341 transitions. [2025-02-05 15:48:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:53,849 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-02-05 15:48:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:54,087 INFO L225 Difference]: With dead ends: 87980 [2025-02-05 15:48:54,088 INFO L226 Difference]: Without dead ends: 59121 [2025-02-05 15:48:54,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:54,158 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 108 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:54,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1212 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59121 states. [2025-02-05 15:48:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59121 to 59113. [2025-02-05 15:48:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59113 states, 48838 states have (on average 1.6412015234039068) internal successors, (80153), 48846 states have internal predecessors, (80153), 10242 states have call successors, (10242), 28 states have call predecessors, (10242), 32 states have return successors, (11387), 10240 states have call predecessors, (11387), 10241 states have call successors, (11387) [2025-02-05 15:48:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59113 states to 59113 states and 101782 transitions. [2025-02-05 15:48:57,041 INFO L78 Accepts]: Start accepts. Automaton has 59113 states and 101782 transitions. Word has length 137 [2025-02-05 15:48:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:57,042 INFO L471 AbstractCegarLoop]: Abstraction has 59113 states and 101782 transitions. [2025-02-05 15:48:57,042 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 59113 states and 101782 transitions. [2025-02-05 15:48:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:48:57,082 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:57,082 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:57,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:48:57,082 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:57,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:57,083 INFO L85 PathProgramCache]: Analyzing trace with hash 398293693, now seen corresponding path program 1 times [2025-02-05 15:48:57,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:57,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823388656] [2025-02-05 15:48:57,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:57,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:57,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:48:57,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:48:57,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:57,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:57,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:57,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823388656] [2025-02-05 15:48:57,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823388656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:57,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:57,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:57,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963071418] [2025-02-05 15:48:57,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:57,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:57,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:57,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:57,137 INFO L87 Difference]: Start difference. First operand 59113 states and 101782 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:48:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:59,231 INFO L93 Difference]: Finished difference Result 110561 states and 190840 transitions. [2025-02-05 15:48:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:59,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-02-05 15:48:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:59,894 INFO L225 Difference]: With dead ends: 110561 [2025-02-05 15:48:59,895 INFO L226 Difference]: Without dead ends: 110346 [2025-02-05 15:48:59,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:59,938 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 103 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:59,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1214 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110346 states. [2025-02-05 15:49:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110346 to 110338. [2025-02-05 15:49:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110338 states, 91695 states have (on average 1.6361524619663013) internal successors, (150027), 91703 states have internal predecessors, (150027), 18610 states have call successors, (18610), 28 states have call predecessors, (18610), 32 states have return successors, (20801), 18608 states have call predecessors, (20801), 18609 states have call successors, (20801) [2025-02-05 15:49:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110338 states to 110338 states and 189438 transitions. [2025-02-05 15:49:03,567 INFO L78 Accepts]: Start accepts. Automaton has 110338 states and 189438 transitions. Word has length 138 [2025-02-05 15:49:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:03,567 INFO L471 AbstractCegarLoop]: Abstraction has 110338 states and 189438 transitions. [2025-02-05 15:49:03,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-05 15:49:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 110338 states and 189438 transitions. [2025-02-05 15:49:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:49:03,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:03,612 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:03,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:49:03,612 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:03,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1264366177, now seen corresponding path program 1 times [2025-02-05 15:49:03,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:03,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685232270] [2025-02-05 15:49:03,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:03,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:49:03,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:49:03,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:03,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:49:03,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:03,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685232270] [2025-02-05 15:49:03,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685232270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:03,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:03,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 15:49:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171726909] [2025-02-05 15:49:03,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:03,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 15:49:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:03,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 15:49:03,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:49:03,969 INFO L87 Difference]: Start difference. First operand 110338 states and 189438 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:49:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:49:09,720 INFO L93 Difference]: Finished difference Result 220021 states and 383167 transitions. [2025-02-05 15:49:09,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 15:49:09,721 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 139 [2025-02-05 15:49:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:49:10,684 INFO L225 Difference]: With dead ends: 220021 [2025-02-05 15:49:10,684 INFO L226 Difference]: Without dead ends: 219812 [2025-02-05 15:49:10,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2025-02-05 15:49:10,783 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 1740 mSDsluCounter, 7190 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1740 SdHoareTripleChecker+Valid, 7869 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:49:10,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1740 Valid, 7869 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 15:49:10,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219812 states. [2025-02-05 15:49:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219812 to 219709. [2025-02-05 15:49:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219709 states, 182650 states have (on average 1.6367533534081578) internal successors, (298953), 182557 states have internal predecessors, (298953), 36976 states have call successors, (36976), 75 states have call predecessors, (36976), 82 states have return successors, (44634), 37082 states have call predecessors, (44634), 36973 states have call successors, (44634) [2025-02-05 15:49:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219709 states to 219709 states and 380563 transitions. [2025-02-05 15:49:18,347 INFO L78 Accepts]: Start accepts. Automaton has 219709 states and 380563 transitions. Word has length 139 [2025-02-05 15:49:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:49:18,348 INFO L471 AbstractCegarLoop]: Abstraction has 219709 states and 380563 transitions. [2025-02-05 15:49:18,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-05 15:49:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 219709 states and 380563 transitions. [2025-02-05 15:49:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:49:18,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:49:18,442 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:49:18,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:49:18,442 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:49:18,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:49:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash -198202894, now seen corresponding path program 1 times [2025-02-05 15:49:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:49:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729191196] [2025-02-05 15:49:18,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:49:18,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:49:18,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:49:18,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:49:18,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:49:18,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:49:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:49:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:49:18,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729191196] [2025-02-05 15:49:18,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729191196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:49:18,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:49:18,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:49:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142174527] [2025-02-05 15:49:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:49:18,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:49:18,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:49:18,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:49:18,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:49:18,523 INFO L87 Difference]: Start difference. First operand 219709 states and 380563 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14)