./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product34.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 39fe77adb61a1e466f06fcf9920e7f42d562f22740249d3a797ea504e0f3c31a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:52:27,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:52:27,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:52:27,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:52:27,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:52:27,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:52:27,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:52:27,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:52:27,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:52:27,637 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:52:27,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:52:27,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:52:27,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:52:27,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:52:27,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:52:27,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:52:27,639 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:52:27,639 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:52:27,639 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:52:27,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:27,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:27,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:27,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:27,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:52:27,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:27,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:27,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:27,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:27,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:52:27,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:52:27,640 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:52:27,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:52:27,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:52:27,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:52:27,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:52:27,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:52:27,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:52:27,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:52:27,640 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 -> 39fe77adb61a1e466f06fcf9920e7f42d562f22740249d3a797ea504e0f3c31a [2025-01-09 03:52:27,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:52:27,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:52:27,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:52:27,892 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:52:27,892 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:52:27,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product34.cil.c [2025-01-09 03:52:29,046 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5aeb753a/29383019d2d1471a855324ca95508922/FLAGa80828175 [2025-01-09 03:52:29,418 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:52:29,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product34.cil.c [2025-01-09 03:52:29,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5aeb753a/29383019d2d1471a855324ca95508922/FLAGa80828175 [2025-01-09 03:52:29,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a5aeb753a/29383019d2d1471a855324ca95508922 [2025-01-09 03:52:29,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:52:29,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:52:29,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:29,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:52:29,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:52:29,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:29" (1/1) ... [2025-01-09 03:52:29,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d65918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:29, skipping insertion in model container [2025-01-09 03:52:29,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:29" (1/1) ... [2025-01-09 03:52:29,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:52:30,074 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_spec27_product34.cil.c[51595,51608] [2025-01-09 03:52:30,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:30,188 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:52:30,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-01-09 03:52:30,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1128] [2025-01-09 03:52:30,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1288] [2025-01-09 03:52:30,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1517] [2025-01-09 03:52:30,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1534] [2025-01-09 03:52:30,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1936] [2025-01-09 03:52:30,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1974] [2025-01-09 03:52:30,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2380] [2025-01-09 03:52:30,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2412] [2025-01-09 03:52:30,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2421] [2025-01-09 03:52:30,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2787] [2025-01-09 03:52:30,294 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_spec27_product34.cil.c[51595,51608] [2025-01-09 03:52:30,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:30,341 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:52:30,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30 WrapperNode [2025-01-09 03:52:30,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:30,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:30,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:52:30,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:52:30,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,407 INFO L138 Inliner]: procedures = 134, calls = 220, calls flagged for inlining = 61, calls inlined = 58, statements flattened = 1092 [2025-01-09 03:52:30,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:30,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:52:30,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:52:30,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:52:30,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,465 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:52:30,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:52:30,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:52:30,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:52:30,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:52:30,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (1/1) ... [2025-01-09 03:52:30,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:30,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:30,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:52:30,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:52:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:52:30,611 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:52:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:52:30,611 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:52:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:52:30,611 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:52:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:52:30,612 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:52:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:52:30,612 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:52:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:52:30,612 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:52:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:52:30,612 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:52:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:52:30,613 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:52:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:52:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:52:30,615 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:52:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:52:30,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:52:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:52:30,616 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:52:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:52:30,616 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:52:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:52:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:52:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:52:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:52:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:52:30,616 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:52:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:52:30,616 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:52:30,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:52:30,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:52:30,831 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:52:30,836 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:52:31,806 INFO L? ?]: Removed 582 outVars from TransFormulas that were not future-live. [2025-01-09 03:52:31,807 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:52:31,818 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:52:31,819 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:52:31,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:31 BoogieIcfgContainer [2025-01-09 03:52:31,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:52:31,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:52:31,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:52:31,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:52:31,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:52:29" (1/3) ... [2025-01-09 03:52:31,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548c5dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:31, skipping insertion in model container [2025-01-09 03:52:31,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:30" (2/3) ... [2025-01-09 03:52:31,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@548c5dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:31, skipping insertion in model container [2025-01-09 03:52:31,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:31" (3/3) ... [2025-01-09 03:52:31,825 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product34.cil.c [2025-01-09 03:52:31,835 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:52:31,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product34.cil.c that has 30 procedures, 452 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:52:31,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:52:31,937 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;@6a7b1bdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:52:31,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:52:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 452 states, 348 states have (on average 1.5316091954022988) internal successors, (533), 353 states have internal predecessors, (533), 73 states have call successors, (73), 29 states have call predecessors, (73), 29 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 03:52:31,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 03:52:31,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:31,975 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:31,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:31,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1798830968, now seen corresponding path program 1 times [2025-01-09 03:52:31,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:31,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365844119] [2025-01-09 03:52:31,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:32,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 03:52:32,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 03:52:32,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:32,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 03:52:32,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:32,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365844119] [2025-01-09 03:52:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365844119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:32,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42553205] [2025-01-09 03:52:32,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:32,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:32,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:32,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:32,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:52:32,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 03:52:32,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 03:52:32,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:32,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:32,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:52:32,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 03:52:32,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:32,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42553205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:32,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:32,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:52:32,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313359035] [2025-01-09 03:52:32,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:32,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:32,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:33,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:33,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:33,015 INFO L87 Difference]: Start difference. First operand has 452 states, 348 states have (on average 1.5316091954022988) internal successors, (533), 353 states have internal predecessors, (533), 73 states have call successors, (73), 29 states have call predecessors, (73), 29 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:33,092 INFO L93 Difference]: Finished difference Result 714 states and 1054 transitions. [2025-01-09 03:52:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:33,094 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 170 [2025-01-09 03:52:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:33,104 INFO L225 Difference]: With dead ends: 714 [2025-01-09 03:52:33,108 INFO L226 Difference]: Without dead ends: 447 [2025-01-09 03:52:33,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:33,117 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:33,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1345 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-09 03:52:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 446. [2025-01-09 03:52:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 343 states have (on average 1.5276967930029155) internal successors, (524), 347 states have internal predecessors, (524), 73 states have call successors, (73), 29 states have call predecessors, (73), 29 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 03:52:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 669 transitions. [2025-01-09 03:52:33,180 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 669 transitions. Word has length 170 [2025-01-09 03:52:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:33,182 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 669 transitions. [2025-01-09 03:52:33,182 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 669 transitions. [2025-01-09 03:52:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:52:33,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:33,185 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:33,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:33,392 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-01-09 03:52:33,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:33,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1346114146, now seen corresponding path program 1 times [2025-01-09 03:52:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:33,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831036321] [2025-01-09 03:52:33,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:33,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:52:33,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:52:33,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:33,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:33,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:33,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831036321] [2025-01-09 03:52:33,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831036321] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:33,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484376255] [2025-01-09 03:52:33,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:33,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:33,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:33,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:33,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:52:33,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:52:33,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:52:33,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:33,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:33,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:33,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:52:33,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484376255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:33,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:33,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:52:33,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056241818] [2025-01-09 03:52:33,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:33,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:33,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:33,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:33,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:33,986 INFO L87 Difference]: Start difference. First operand 446 states and 669 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:34,027 INFO L93 Difference]: Finished difference Result 940 states and 1430 transitions. [2025-01-09 03:52:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:34,028 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 156 [2025-01-09 03:52:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:34,036 INFO L225 Difference]: With dead ends: 940 [2025-01-09 03:52:34,036 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 03:52:34,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:34,039 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 134 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:34,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1300 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 03:52:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 512. [2025-01-09 03:52:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 395 states have (on average 1.549367088607595) internal successors, (612), 399 states have internal predecessors, (612), 87 states have call successors, (87), 29 states have call predecessors, (87), 29 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 03:52:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 785 transitions. [2025-01-09 03:52:34,073 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 785 transitions. Word has length 156 [2025-01-09 03:52:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:34,074 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 785 transitions. [2025-01-09 03:52:34,074 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 785 transitions. [2025-01-09 03:52:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:52:34,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:34,077 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:34,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:34,277 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-01-09 03:52:34,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:34,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:34,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1006346604, now seen corresponding path program 1 times [2025-01-09 03:52:34,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:34,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970584815] [2025-01-09 03:52:34,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:34,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:34,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:52:34,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:52:34,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:34,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:34,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:34,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970584815] [2025-01-09 03:52:34,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970584815] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:34,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405660690] [2025-01-09 03:52:34,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:34,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:34,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:34,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:34,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:52:34,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:52:34,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:52:34,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:34,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:34,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:52:34,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:52:34,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:34,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405660690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:34,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:34,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:52:34,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856802200] [2025-01-09 03:52:34,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:34,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:34,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:34,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:34,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:34,882 INFO L87 Difference]: Start difference. First operand 512 states and 785 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:34,940 INFO L93 Difference]: Finished difference Result 1015 states and 1560 transitions. [2025-01-09 03:52:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2025-01-09 03:52:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:34,945 INFO L225 Difference]: With dead ends: 1015 [2025-01-09 03:52:34,946 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 03:52:34,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 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-01-09 03:52:34,948 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 2 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2629 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-01-09 03:52:34,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2629 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 03:52:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2025-01-09 03:52:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 396 states have (on average 1.547979797979798) internal successors, (613), 401 states have internal predecessors, (613), 87 states have call successors, (87), 29 states have call predecessors, (87), 30 states have return successors, (88), 85 states have call predecessors, (88), 86 states have call successors, (88) [2025-01-09 03:52:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 788 transitions. [2025-01-09 03:52:34,973 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 788 transitions. Word has length 157 [2025-01-09 03:52:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:34,974 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 788 transitions. [2025-01-09 03:52:34,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 788 transitions. [2025-01-09 03:52:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 03:52:34,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:34,977 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:34,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:52:35,178 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-01-09 03:52:35,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:35,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash 958908825, now seen corresponding path program 1 times [2025-01-09 03:52:35,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:35,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822845637] [2025-01-09 03:52:35,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:35,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:35,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 03:52:35,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 03:52:35,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:35,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 03:52:35,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822845637] [2025-01-09 03:52:35,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822845637] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258139681] [2025-01-09 03:52:35,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:35,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:35,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:35,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:35,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:52:35,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 03:52:35,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 03:52:35,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:35,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:35,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:52:35,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:52:35,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:35,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258139681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:35,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:52:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031146970] [2025-01-09 03:52:35,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:35,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:35,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:35,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:35,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:52:35,800 INFO L87 Difference]: Start difference. First operand 514 states and 788 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:52:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:35,871 INFO L93 Difference]: Finished difference Result 1017 states and 1565 transitions. [2025-01-09 03:52:35,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:35,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 177 [2025-01-09 03:52:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:35,874 INFO L225 Difference]: With dead ends: 1017 [2025-01-09 03:52:35,875 INFO L226 Difference]: Without dead ends: 516 [2025-01-09 03:52:35,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 175 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-01-09 03:52:35,877 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 2 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2615 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-01-09 03:52:35,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2615 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-01-09 03:52:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-01-09 03:52:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 397 states have (on average 1.5465994962216625) internal successors, (614), 403 states have internal predecessors, (614), 87 states have call successors, (87), 29 states have call predecessors, (87), 31 states have return successors, (93), 85 states have call predecessors, (93), 86 states have call successors, (93) [2025-01-09 03:52:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 794 transitions. [2025-01-09 03:52:35,893 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 794 transitions. Word has length 177 [2025-01-09 03:52:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:35,894 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 794 transitions. [2025-01-09 03:52:35,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:52:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 794 transitions. [2025-01-09 03:52:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 03:52:35,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:35,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:35,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:52:36,101 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-01-09 03:52:36,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:36,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:36,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1588379933, now seen corresponding path program 1 times [2025-01-09 03:52:36,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:36,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034415021] [2025-01-09 03:52:36,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:36,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:36,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 03:52:36,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 03:52:36,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:36,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:52:36,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:36,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034415021] [2025-01-09 03:52:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034415021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:36,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:36,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996822291] [2025-01-09 03:52:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:36,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:36,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:36,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:36,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:36,256 INFO L87 Difference]: Start difference. First operand 516 states and 794 transitions. Second operand has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:36,294 INFO L93 Difference]: Finished difference Result 1009 states and 1556 transitions. [2025-01-09 03:52:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:36,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 159 [2025-01-09 03:52:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:36,298 INFO L225 Difference]: With dead ends: 1009 [2025-01-09 03:52:36,298 INFO L226 Difference]: Without dead ends: 516 [2025-01-09 03:52:36,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:36,300 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 2 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2633 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-01-09 03:52:36,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2633 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-01-09 03:52:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-01-09 03:52:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 397 states have (on average 1.5465994962216625) internal successors, (614), 403 states have internal predecessors, (614), 87 states have call successors, (87), 29 states have call predecessors, (87), 31 states have return successors, (92), 85 states have call predecessors, (92), 86 states have call successors, (92) [2025-01-09 03:52:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 793 transitions. [2025-01-09 03:52:36,324 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 793 transitions. Word has length 159 [2025-01-09 03:52:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:36,324 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 793 transitions. [2025-01-09 03:52:36,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.0) internal successors, (96), 5 states have internal predecessors, (96), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 793 transitions. [2025-01-09 03:52:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 03:52:36,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:36,331 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:36,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:52:36,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash 940414511, now seen corresponding path program 2 times [2025-01-09 03:52:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:36,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019201546] [2025-01-09 03:52:36,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:52:36,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:36,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-01-09 03:52:36,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 80 of 160 statements. [2025-01-09 03:52:36,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:52:36,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:52:36,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:36,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019201546] [2025-01-09 03:52:36,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019201546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:36,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:36,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693976862] [2025-01-09 03:52:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:36,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:36,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:36,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:36,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:36,585 INFO L87 Difference]: Start difference. First operand 516 states and 793 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:37,074 INFO L93 Difference]: Finished difference Result 1348 states and 2050 transitions. [2025-01-09 03:52:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:52:37,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2025-01-09 03:52:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:37,080 INFO L225 Difference]: With dead ends: 1348 [2025-01-09 03:52:37,080 INFO L226 Difference]: Without dead ends: 1102 [2025-01-09 03:52:37,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 03:52:37,082 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 746 mSDsluCounter, 3814 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 4501 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:37,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 4501 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:52:37,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-01-09 03:52:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1013. [2025-01-09 03:52:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 783 states have (on average 1.554278416347382) internal successors, (1217), 792 states have internal predecessors, (1217), 168 states have call successors, (168), 58 states have call predecessors, (168), 61 states have return successors, (181), 166 states have call predecessors, (181), 166 states have call successors, (181) [2025-01-09 03:52:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1566 transitions. [2025-01-09 03:52:37,149 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1566 transitions. Word has length 160 [2025-01-09 03:52:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:37,149 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1566 transitions. [2025-01-09 03:52:37,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 03:52:37,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1566 transitions. [2025-01-09 03:52:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 03:52:37,153 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:37,154 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:37,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:52:37,154 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:37,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:37,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2044292011, now seen corresponding path program 1 times [2025-01-09 03:52:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207284290] [2025-01-09 03:52:37,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:37,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 03:52:37,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 03:52:37,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:37,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:52:37,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:37,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207284290] [2025-01-09 03:52:37,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207284290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:37,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:37,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:37,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098510870] [2025-01-09 03:52:37,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:37,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:37,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:37,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:37,301 INFO L87 Difference]: Start difference. First operand 1013 states and 1566 transitions. Second operand has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:52:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:37,362 INFO L93 Difference]: Finished difference Result 2005 states and 3105 transitions. [2025-01-09 03:52:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:37,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 180 [2025-01-09 03:52:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:37,369 INFO L225 Difference]: With dead ends: 2005 [2025-01-09 03:52:37,369 INFO L226 Difference]: Without dead ends: 1015 [2025-01-09 03:52:37,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:37,373 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 1 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2636 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-01-09 03:52:37,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2636 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-01-09 03:52:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2025-01-09 03:52:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 784 states have (on average 1.5535714285714286) internal successors, (1218), 794 states have internal predecessors, (1218), 168 states have call successors, (168), 58 states have call predecessors, (168), 62 states have return successors, (183), 166 states have call predecessors, (183), 166 states have call successors, (183) [2025-01-09 03:52:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1569 transitions. [2025-01-09 03:52:37,413 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1569 transitions. Word has length 180 [2025-01-09 03:52:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:37,413 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1569 transitions. [2025-01-09 03:52:37,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.5) internal successors, (106), 5 states have internal predecessors, (106), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:52:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1569 transitions. [2025-01-09 03:52:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 03:52:37,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:37,442 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:37,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:52:37,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:37,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash -120802865, now seen corresponding path program 1 times [2025-01-09 03:52:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:37,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683984763] [2025-01-09 03:52:37,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:37,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:37,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:52:37,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:52:37,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:37,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:37,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:37,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683984763] [2025-01-09 03:52:37,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683984763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:37,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:37,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601718307] [2025-01-09 03:52:37,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:37,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:37,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:37,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:37,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:37,605 INFO L87 Difference]: Start difference. First operand 1015 states and 1569 transitions. Second operand has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 8 states have internal predecessors, (103), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:52:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:37,718 INFO L93 Difference]: Finished difference Result 1507 states and 2328 transitions. [2025-01-09 03:52:37,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:52:37,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 8 states have internal predecessors, (103), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2025-01-09 03:52:37,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:37,722 INFO L225 Difference]: With dead ends: 1507 [2025-01-09 03:52:37,722 INFO L226 Difference]: Without dead ends: 520 [2025-01-09 03:52:37,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:52:37,726 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 7 mSDsluCounter, 3883 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4535 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:37,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4535 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-01-09 03:52:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-01-09 03:52:37,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 400 states have (on average 1.5425) internal successors, (617), 406 states have internal predecessors, (617), 87 states have call successors, (87), 30 states have call predecessors, (87), 32 states have return successors, (93), 85 states have call predecessors, (93), 86 states have call successors, (93) [2025-01-09 03:52:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 797 transitions. [2025-01-09 03:52:37,742 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 797 transitions. Word has length 162 [2025-01-09 03:52:37,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:37,742 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 797 transitions. [2025-01-09 03:52:37,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.714285714285714) internal successors, (103), 8 states have internal predecessors, (103), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:52:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 797 transitions. [2025-01-09 03:52:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 03:52:37,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:37,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:37,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:52:37,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:37,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash -974212971, now seen corresponding path program 1 times [2025-01-09 03:52:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:37,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855784075] [2025-01-09 03:52:37,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:37,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:37,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:52:37,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:52:37,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:37,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:37,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:37,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855784075] [2025-01-09 03:52:37,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855784075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:37,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:37,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:37,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119865366] [2025-01-09 03:52:37,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:37,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:37,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:37,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:37,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:37,912 INFO L87 Difference]: Start difference. First operand 520 states and 797 transitions. Second operand has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:52:38,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:38,027 INFO L93 Difference]: Finished difference Result 1016 states and 1565 transitions. [2025-01-09 03:52:38,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:52:38,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2025-01-09 03:52:38,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:38,031 INFO L225 Difference]: With dead ends: 1016 [2025-01-09 03:52:38,031 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 03:52:38,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:52:38,033 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 5 mSDsluCounter, 3895 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4549 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:38,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4549 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 03:52:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-01-09 03:52:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 402 states have (on average 1.5398009950248757) internal successors, (619), 409 states have internal predecessors, (619), 87 states have call successors, (87), 30 states have call predecessors, (87), 33 states have return successors, (98), 85 states have call predecessors, (98), 86 states have call successors, (98) [2025-01-09 03:52:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 804 transitions. [2025-01-09 03:52:38,050 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 804 transitions. Word has length 162 [2025-01-09 03:52:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:38,051 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 804 transitions. [2025-01-09 03:52:38,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 03:52:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 804 transitions. [2025-01-09 03:52:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 03:52:38,053 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:38,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:38,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:52:38,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:38,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash -494581714, now seen corresponding path program 1 times [2025-01-09 03:52:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:38,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211235130] [2025-01-09 03:52:38,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:38,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 03:52:38,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 03:52:38,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:38,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:38,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:38,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211235130] [2025-01-09 03:52:38,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211235130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:38,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510480384] [2025-01-09 03:52:38,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:38,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:38,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:38,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:38,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:52:38,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 03:52:38,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 03:52:38,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:38,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:38,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 1365 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:38,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:38,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:52:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:38,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510480384] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:52:38,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:52:38,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:52:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753558566] [2025-01-09 03:52:38,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:52:38,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:52:38,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:38,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:52:38,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:52:38,630 INFO L87 Difference]: Start difference. First operand 523 states and 804 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-01-09 03:52:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:38,797 INFO L93 Difference]: Finished difference Result 1213 states and 1929 transitions. [2025-01-09 03:52:38,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:52:38,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 182 [2025-01-09 03:52:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:38,803 INFO L225 Difference]: With dead ends: 1213 [2025-01-09 03:52:38,803 INFO L226 Difference]: Without dead ends: 959 [2025-01-09 03:52:38,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:52:38,804 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 518 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:38,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 3048 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-01-09 03:52:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 935. [2025-01-09 03:52:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 735 states have (on average 1.6136054421768709) internal successors, (1186), 742 states have internal predecessors, (1186), 166 states have call successors, (166), 30 states have call predecessors, (166), 33 states have return successors, (187), 164 states have call predecessors, (187), 165 states have call successors, (187) [2025-01-09 03:52:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1539 transitions. [2025-01-09 03:52:38,832 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1539 transitions. Word has length 182 [2025-01-09 03:52:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:38,832 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1539 transitions. [2025-01-09 03:52:38,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 2 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2025-01-09 03:52:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1539 transitions. [2025-01-09 03:52:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 03:52:38,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:38,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:38,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:39,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:52:39,040 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:39,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1197969314, now seen corresponding path program 1 times [2025-01-09 03:52:39,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:39,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605293906] [2025-01-09 03:52:39,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:39,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 03:52:39,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 03:52:39,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:39,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605293906] [2025-01-09 03:52:39,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605293906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:39,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:39,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:39,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020202016] [2025-01-09 03:52:39,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:39,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:39,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:39,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:39,092 INFO L87 Difference]: Start difference. First operand 935 states and 1539 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:39,124 INFO L93 Difference]: Finished difference Result 2217 states and 3707 transitions. [2025-01-09 03:52:39,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:39,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 170 [2025-01-09 03:52:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:39,132 INFO L225 Difference]: With dead ends: 2217 [2025-01-09 03:52:39,132 INFO L226 Difference]: Without dead ends: 1351 [2025-01-09 03:52:39,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:39,135 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 132 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:39,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1349 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-01-09 03:52:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1343. [2025-01-09 03:52:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1064 states have (on average 1.6343984962406015) internal successors, (1739), 1071 states have internal predecessors, (1739), 245 states have call successors, (245), 30 states have call predecessors, (245), 33 states have return successors, (276), 243 states have call predecessors, (276), 244 states have call successors, (276) [2025-01-09 03:52:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 2260 transitions. [2025-01-09 03:52:39,184 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 2260 transitions. Word has length 170 [2025-01-09 03:52:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:39,184 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 2260 transitions. [2025-01-09 03:52:39,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2260 transitions. [2025-01-09 03:52:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 03:52:39,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:39,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:39,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:52:39,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:39,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:39,193 INFO L85 PathProgramCache]: Analyzing trace with hash -875908443, now seen corresponding path program 1 times [2025-01-09 03:52:39,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:39,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373567066] [2025-01-09 03:52:39,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:39,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 03:52:39,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 03:52:39,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:39,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:39,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:39,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373567066] [2025-01-09 03:52:39,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373567066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:39,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:39,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:39,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305868805] [2025-01-09 03:52:39,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:39,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:39,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:39,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:39,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:39,250 INFO L87 Difference]: Start difference. First operand 1343 states and 2260 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:39,292 INFO L93 Difference]: Finished difference Result 3214 states and 5452 transitions. [2025-01-09 03:52:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:39,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 171 [2025-01-09 03:52:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:39,301 INFO L225 Difference]: With dead ends: 3214 [2025-01-09 03:52:39,301 INFO L226 Difference]: Without dead ends: 1991 [2025-01-09 03:52:39,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:39,305 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 130 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:39,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1336 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2025-01-09 03:52:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1983. [2025-01-09 03:52:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1983 states, 1585 states have (on average 1.6492113564668769) internal successors, (2614), 1592 states have internal predecessors, (2614), 364 states have call successors, (364), 30 states have call predecessors, (364), 33 states have return successors, (395), 362 states have call predecessors, (395), 363 states have call successors, (395) [2025-01-09 03:52:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 3373 transitions. [2025-01-09 03:52:39,406 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 3373 transitions. Word has length 171 [2025-01-09 03:52:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:39,407 INFO L471 AbstractCegarLoop]: Abstraction has 1983 states and 3373 transitions. [2025-01-09 03:52:39,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 3373 transitions. [2025-01-09 03:52:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 03:52:39,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:39,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:39,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:52:39,416 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:39,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash 504998304, now seen corresponding path program 1 times [2025-01-09 03:52:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:39,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228410277] [2025-01-09 03:52:39,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:39,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 03:52:39,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 03:52:39,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:39,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:39,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:39,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228410277] [2025-01-09 03:52:39,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228410277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:39,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524193135] [2025-01-09 03:52:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:39,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:39,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:39,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:39,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:39,465 INFO L87 Difference]: Start difference. First operand 1983 states and 3373 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:39,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:39,530 INFO L93 Difference]: Finished difference Result 4716 states and 8092 transitions. [2025-01-09 03:52:39,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:39,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 172 [2025-01-09 03:52:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:39,544 INFO L225 Difference]: With dead ends: 4716 [2025-01-09 03:52:39,544 INFO L226 Difference]: Without dead ends: 2974 [2025-01-09 03:52:39,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:39,550 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 128 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:39,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1325 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2025-01-09 03:52:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2966. [2025-01-09 03:52:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2406 states have (on average 1.660847880299252) internal successors, (3996), 2413 states have internal predecessors, (3996), 526 states have call successors, (526), 30 states have call predecessors, (526), 33 states have return successors, (573), 524 states have call predecessors, (573), 525 states have call successors, (573) [2025-01-09 03:52:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 5095 transitions. [2025-01-09 03:52:39,657 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 5095 transitions. Word has length 172 [2025-01-09 03:52:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:39,658 INFO L471 AbstractCegarLoop]: Abstraction has 2966 states and 5095 transitions. [2025-01-09 03:52:39,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 5095 transitions. [2025-01-09 03:52:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-09 03:52:39,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:39,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:39,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:52:39,669 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:39,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1867155942, now seen corresponding path program 1 times [2025-01-09 03:52:39,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:39,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898373479] [2025-01-09 03:52:39,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:39,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 03:52:39,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 03:52:39,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:39,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898373479] [2025-01-09 03:52:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898373479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268977016] [2025-01-09 03:52:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:39,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:39,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:39,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:39,716 INFO L87 Difference]: Start difference. First operand 2966 states and 5095 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:39,830 INFO L93 Difference]: Finished difference Result 7094 states and 12278 transitions. [2025-01-09 03:52:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:39,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 173 [2025-01-09 03:52:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:39,852 INFO L225 Difference]: With dead ends: 7094 [2025-01-09 03:52:39,852 INFO L226 Difference]: Without dead ends: 4566 [2025-01-09 03:52:39,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:39,861 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 126 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:39,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1325 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4566 states. [2025-01-09 03:52:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4566 to 4558. [2025-01-09 03:52:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4558 states, 3753 states have (on average 1.669064748201439) internal successors, (6264), 3760 states have internal predecessors, (6264), 771 states have call successors, (771), 30 states have call predecessors, (771), 33 states have return successors, (844), 769 states have call predecessors, (844), 770 states have call successors, (844) [2025-01-09 03:52:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4558 states to 4558 states and 7879 transitions. [2025-01-09 03:52:40,029 INFO L78 Accepts]: Start accepts. Automaton has 4558 states and 7879 transitions. Word has length 173 [2025-01-09 03:52:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:40,029 INFO L471 AbstractCegarLoop]: Abstraction has 4558 states and 7879 transitions. [2025-01-09 03:52:40,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4558 states and 7879 transitions. [2025-01-09 03:52:40,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 03:52:40,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:40,048 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:40,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:52:40,048 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:40,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1730666116, now seen corresponding path program 1 times [2025-01-09 03:52:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:40,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375372645] [2025-01-09 03:52:40,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:40,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:40,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:52:40,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:52:40,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:40,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:40,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:40,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375372645] [2025-01-09 03:52:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375372645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:40,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:40,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491152082] [2025-01-09 03:52:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:40,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:40,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:40,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:40,132 INFO L87 Difference]: Start difference. First operand 4558 states and 7879 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:40,311 INFO L93 Difference]: Finished difference Result 11063 states and 19261 transitions. [2025-01-09 03:52:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:40,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 174 [2025-01-09 03:52:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:40,350 INFO L225 Difference]: With dead ends: 11063 [2025-01-09 03:52:40,353 INFO L226 Difference]: Without dead ends: 7244 [2025-01-09 03:52:40,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:40,368 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 124 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:40,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7244 states. [2025-01-09 03:52:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7244 to 7236. [2025-01-09 03:52:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7236 states, 5938 states have (on average 1.669585719097339) internal successors, (9914), 5945 states have internal predecessors, (9914), 1264 states have call successors, (1264), 30 states have call predecessors, (1264), 33 states have return successors, (1381), 1262 states have call predecessors, (1381), 1263 states have call successors, (1381) [2025-01-09 03:52:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7236 states to 7236 states and 12559 transitions. [2025-01-09 03:52:40,637 INFO L78 Accepts]: Start accepts. Automaton has 7236 states and 12559 transitions. Word has length 174 [2025-01-09 03:52:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:40,637 INFO L471 AbstractCegarLoop]: Abstraction has 7236 states and 12559 transitions. [2025-01-09 03:52:40,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7236 states and 12559 transitions. [2025-01-09 03:52:40,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 03:52:40,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:40,663 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:40,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:52:40,664 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:40,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash -855459318, now seen corresponding path program 1 times [2025-01-09 03:52:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070375225] [2025-01-09 03:52:40,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:40,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 03:52:40,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 03:52:40,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:40,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:40,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:40,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070375225] [2025-01-09 03:52:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070375225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:40,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:40,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:40,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005185425] [2025-01-09 03:52:40,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:40,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:40,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:40,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:40,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:40,784 INFO L87 Difference]: Start difference. First operand 7236 states and 12559 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:40,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:40,954 INFO L93 Difference]: Finished difference Result 18265 states and 31901 transitions. [2025-01-09 03:52:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:40,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 175 [2025-01-09 03:52:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:40,997 INFO L225 Difference]: With dead ends: 18265 [2025-01-09 03:52:40,997 INFO L226 Difference]: Without dead ends: 12129 [2025-01-09 03:52:41,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:41,022 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 122 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:41,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1328 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12129 states. [2025-01-09 03:52:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12129 to 12121. [2025-01-09 03:52:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12121 states, 10001 states have (on average 1.6708329167083291) internal successors, (16710), 10008 states have internal predecessors, (16710), 2086 states have call successors, (2086), 30 states have call predecessors, (2086), 33 states have return successors, (2281), 2084 states have call predecessors, (2281), 2085 states have call successors, (2281) [2025-01-09 03:52:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12121 states to 12121 states and 21077 transitions. [2025-01-09 03:52:41,487 INFO L78 Accepts]: Start accepts. Automaton has 12121 states and 21077 transitions. Word has length 175 [2025-01-09 03:52:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:41,487 INFO L471 AbstractCegarLoop]: Abstraction has 12121 states and 21077 transitions. [2025-01-09 03:52:41,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 12121 states and 21077 transitions. [2025-01-09 03:52:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 03:52:41,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:41,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:41,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:52:41,529 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:41,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1238497489, now seen corresponding path program 1 times [2025-01-09 03:52:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:41,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810689677] [2025-01-09 03:52:41,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:41,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:41,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 03:52:41,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 03:52:41,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:41,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:41,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:41,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810689677] [2025-01-09 03:52:41,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810689677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:41,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:41,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213559429] [2025-01-09 03:52:41,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:41,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:41,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:41,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:41,590 INFO L87 Difference]: Start difference. First operand 12121 states and 21077 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:42,004 INFO L93 Difference]: Finished difference Result 28985 states and 50347 transitions. [2025-01-09 03:52:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:42,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 195 [2025-01-09 03:52:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:42,063 INFO L225 Difference]: With dead ends: 28985 [2025-01-09 03:52:42,063 INFO L226 Difference]: Without dead ends: 18916 [2025-01-09 03:52:42,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:42,091 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 120 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:42,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1308 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18916 states. [2025-01-09 03:52:42,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18916 to 18908. [2025-01-09 03:52:42,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18908 states, 15585 states have (on average 1.6481231953801732) internal successors, (25686), 15592 states have internal predecessors, (25686), 3289 states have call successors, (3289), 30 states have call predecessors, (3289), 33 states have return successors, (3628), 3287 states have call predecessors, (3628), 3288 states have call successors, (3628) [2025-01-09 03:52:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18908 states to 18908 states and 32603 transitions. [2025-01-09 03:52:42,974 INFO L78 Accepts]: Start accepts. Automaton has 18908 states and 32603 transitions. Word has length 195 [2025-01-09 03:52:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:42,975 INFO L471 AbstractCegarLoop]: Abstraction has 18908 states and 32603 transitions. [2025-01-09 03:52:42,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 18908 states and 32603 transitions. [2025-01-09 03:52:43,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 03:52:43,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:43,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:43,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:52:43,031 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:43,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash 862284395, now seen corresponding path program 1 times [2025-01-09 03:52:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:43,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121952065] [2025-01-09 03:52:43,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:43,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:43,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 03:52:43,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 03:52:43,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:43,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:52:43,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:43,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121952065] [2025-01-09 03:52:43,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121952065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:43,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:43,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:43,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445388485] [2025-01-09 03:52:43,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:43,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:43,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:43,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:43,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:43,102 INFO L87 Difference]: Start difference. First operand 18908 states and 32603 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:43,636 INFO L93 Difference]: Finished difference Result 49977 states and 86487 transitions. [2025-01-09 03:52:43,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:43,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 177 [2025-01-09 03:52:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:43,764 INFO L225 Difference]: With dead ends: 49977 [2025-01-09 03:52:43,764 INFO L226 Difference]: Without dead ends: 33734 [2025-01-09 03:52:43,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:43,968 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 118 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:43,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1328 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33734 states. [2025-01-09 03:52:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33734 to 33726. [2025-01-09 03:52:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33726 states, 27953 states have (on average 1.6451185919221551) internal successors, (45986), 27960 states have internal predecessors, (45986), 5739 states have call successors, (5739), 30 states have call predecessors, (5739), 33 states have return successors, (6352), 5737 states have call predecessors, (6352), 5738 states have call successors, (6352) [2025-01-09 03:52:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33726 states to 33726 states and 58077 transitions. [2025-01-09 03:52:44,966 INFO L78 Accepts]: Start accepts. Automaton has 33726 states and 58077 transitions. Word has length 177 [2025-01-09 03:52:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:44,966 INFO L471 AbstractCegarLoop]: Abstraction has 33726 states and 58077 transitions. [2025-01-09 03:52:44,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:52:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 33726 states and 58077 transitions. [2025-01-09 03:52:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 03:52:45,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:45,037 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:45,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:52:45,037 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:45,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:45,038 INFO L85 PathProgramCache]: Analyzing trace with hash 421570007, now seen corresponding path program 1 times [2025-01-09 03:52:45,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:45,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919090583] [2025-01-09 03:52:45,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:45,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:45,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 03:52:45,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 03:52:45,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:45,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:45,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919090583] [2025-01-09 03:52:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919090583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:45,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:45,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:45,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132722918] [2025-01-09 03:52:45,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:45,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:45,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:45,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:45,098 INFO L87 Difference]: Start difference. First operand 33726 states and 58077 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:46,521 INFO L93 Difference]: Finished difference Result 92014 states and 158914 transitions. [2025-01-09 03:52:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:46,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 197 [2025-01-09 03:52:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:46,757 INFO L225 Difference]: With dead ends: 92014 [2025-01-09 03:52:46,757 INFO L226 Difference]: Without dead ends: 61832 [2025-01-09 03:52:46,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:46,842 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 116 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:46,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1331 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61832 states. [2025-01-09 03:52:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61832 to 61824. [2025-01-09 03:52:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61824 states, 51538 states have (on average 1.6408863362955488) internal successors, (84568), 51545 states have internal predecessors, (84568), 10252 states have call successors, (10252), 30 states have call predecessors, (10252), 33 states have return successors, (11397), 10250 states have call predecessors, (11397), 10251 states have call successors, (11397) [2025-01-09 03:52:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61824 states to 61824 states and 106217 transitions. [2025-01-09 03:52:48,985 INFO L78 Accepts]: Start accepts. Automaton has 61824 states and 106217 transitions. Word has length 197 [2025-01-09 03:52:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:48,986 INFO L471 AbstractCegarLoop]: Abstraction has 61824 states and 106217 transitions. [2025-01-09 03:52:48,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 61824 states and 106217 transitions. [2025-01-09 03:52:49,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 03:52:49,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:49,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:49,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:52:49,478 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:49,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash -157321648, now seen corresponding path program 1 times [2025-01-09 03:52:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:49,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475245374] [2025-01-09 03:52:49,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:49,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:49,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 03:52:49,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 03:52:49,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:49,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:49,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475245374] [2025-01-09 03:52:49,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475245374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:49,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:49,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:49,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348814668] [2025-01-09 03:52:49,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:49,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:49,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:49,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:49,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:49,536 INFO L87 Difference]: Start difference. First operand 61824 states and 106217 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:51,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:51,810 INFO L93 Difference]: Finished difference Result 115871 states and 199460 transitions. [2025-01-09 03:52:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:51,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 198 [2025-01-09 03:52:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:52,242 INFO L225 Difference]: With dead ends: 115871 [2025-01-09 03:52:52,243 INFO L226 Difference]: Without dead ends: 115617 [2025-01-09 03:52:52,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:52,309 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 111 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:52,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1342 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115617 states. [2025-01-09 03:52:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115617 to 115609. [2025-01-09 03:52:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115609 states, 96955 states have (on average 1.6355113196843896) internal successors, (158571), 96962 states have internal predecessors, (158571), 18620 states have call successors, (18620), 30 states have call predecessors, (18620), 33 states have return successors, (20811), 18618 states have call predecessors, (20811), 18619 states have call successors, (20811) [2025-01-09 03:52:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115609 states to 115609 states and 198002 transitions. [2025-01-09 03:52:56,778 INFO L78 Accepts]: Start accepts. Automaton has 115609 states and 198002 transitions. Word has length 198 [2025-01-09 03:52:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:56,779 INFO L471 AbstractCegarLoop]: Abstraction has 115609 states and 198002 transitions. [2025-01-09 03:52:56,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 03:52:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 115609 states and 198002 transitions. [2025-01-09 03:52:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 03:52:56,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:56,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:56,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:52:56,915 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:56,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:56,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1089871016, now seen corresponding path program 1 times [2025-01-09 03:52:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:56,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330732445] [2025-01-09 03:52:56,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:56,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:56,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 03:52:56,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 03:52:56,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:56,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 03:52:57,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:57,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330732445] [2025-01-09 03:52:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330732445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:57,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:57,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:52:57,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657419045] [2025-01-09 03:52:57,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:57,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:52:57,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:57,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:52:57,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:57,079 INFO L87 Difference]: Start difference. First operand 115609 states and 198002 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 3 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 03:53:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:01,082 INFO L93 Difference]: Finished difference Result 222539 states and 382599 transitions. [2025-01-09 03:53:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:53:01,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 3 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 199 [2025-01-09 03:53:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:02,132 INFO L225 Difference]: With dead ends: 222539 [2025-01-09 03:53:02,133 INFO L226 Difference]: Without dead ends: 222293 [2025-01-09 03:53:02,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:02,207 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 614 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:02,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 3377 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:53:02,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222293 states. [2025-01-09 03:53:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222293 to 222285. [2025-01-09 03:53:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222285 states, 186480 states have (on average 1.6384009009009008) internal successors, (305529), 186435 states have internal predecessors, (305529), 35742 states have call successors, (35742), 58 states have call predecessors, (35742), 62 states have return successors, (39025), 35795 states have call predecessors, (39025), 35740 states have call successors, (39025)