./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product21.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product21.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f4fee54ccb193d38705f292ec1df682c5f160e2b5ba09e341cb9a12b4e6b2606 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:55:37,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:55:37,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:55:37,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:55:37,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:55:37,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:55:37,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:55:37,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:55:37,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:55:37,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:55:37,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:55:37,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:55:37,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:55:37,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:55:37,744 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:55:37,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:55:37,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:55:37,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:55:37,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:55:37,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:55:37,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:55:37,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:55:37,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:55:37,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:55:37,747 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:55:37,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:55:37,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:55:37,748 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:55:37,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:55:37,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:55:37,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:55:37,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:55:37,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:55:37,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:55:37,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:55:37,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:55:37,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:55:37,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:55:37,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:55:37,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:55:37,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:55:37,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:55:37,754 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> f4fee54ccb193d38705f292ec1df682c5f160e2b5ba09e341cb9a12b4e6b2606 [2024-10-11 02:55:38,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:55:38,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:55:38,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:55:38,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:55:38,042 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:55:38,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product21.cil.c [2024-10-11 02:55:39,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:55:39,814 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:55:39,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product21.cil.c [2024-10-11 02:55:39,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d620d4f8/ce030d7af2f54edb9d84fb89325ca289/FLAG68069cb41 [2024-10-11 02:55:39,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9d620d4f8/ce030d7af2f54edb9d84fb89325ca289 [2024-10-11 02:55:39,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:55:39,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:55:39,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:55:39,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:55:39,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:55:39,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:55:39" (1/1) ... [2024-10-11 02:55:39,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca4a4f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:39, skipping insertion in model container [2024-10-11 02:55:39,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:55:39" (1/1) ... [2024-10-11 02:55:39,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:55:40,283 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product21.cil.c[10263,10276] [2024-10-11 02:55:40,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:55:40,550 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:55:40,560 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2024-10-11 02:55:40,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [393] [2024-10-11 02:55:40,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [498] [2024-10-11 02:55:40,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [507] [2024-10-11 02:55:40,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [545] [2024-10-11 02:55:40,562 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [562] [2024-10-11 02:55:40,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1634] [2024-10-11 02:55:40,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2037] [2024-10-11 02:55:40,564 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2079] [2024-10-11 02:55:40,564 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2308] [2024-10-11 02:55:40,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2596] [2024-10-11 02:55:40,591 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product21.cil.c[10263,10276] [2024-10-11 02:55:40,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:55:40,721 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:55:40,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40 WrapperNode [2024-10-11 02:55:40,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:55:40,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:55:40,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:55:40,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:55:40,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,835 INFO L138 Inliner]: procedures = 129, calls = 200, calls flagged for inlining = 58, calls inlined = 55, statements flattened = 1077 [2024-10-11 02:55:40,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:55:40,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:55:40,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:55:40,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:55:40,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,900 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]. [2024-10-11 02:55:40,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:55:40,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:55:40,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:55:40,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:55:40,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (1/1) ... [2024-10-11 02:55:40,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:55:41,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:41,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:55:41,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:55:41,085 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-11 02:55:41,085 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-11 02:55:41,085 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-11 02:55:41,085 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-11 02:55:41,085 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-11 02:55:41,085 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-11 02:55:41,086 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-11 02:55:41,086 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-11 02:55:41,086 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:55:41,087 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:55:41,087 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:55:41,087 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:55:41,087 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:55:41,087 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:55:41,088 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-11 02:55:41,088 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-11 02:55:41,088 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:55:41,089 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:55:41,089 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:55:41,089 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:55:41,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:55:41,089 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-11 02:55:41,089 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-11 02:55:41,089 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:55:41,089 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:55:41,089 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:55:41,090 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:55:41,090 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:55:41,090 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:55:41,090 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2024-10-11 02:55:41,090 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2024-10-11 02:55:41,090 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:55:41,090 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:55:41,090 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-11 02:55:41,090 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-11 02:55:41,091 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:55:41,091 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:55:41,091 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-11 02:55:41,091 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-11 02:55:41,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:55:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:55:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:55:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:55:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:55:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:55:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-11 02:55:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-11 02:55:41,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:55:41,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:55:41,323 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:55:41,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:55:42,405 INFO L? ?]: Removed 524 outVars from TransFormulas that were not future-live. [2024-10-11 02:55:42,405 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:55:42,487 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:55:42,488 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:55:42,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:55:42 BoogieIcfgContainer [2024-10-11 02:55:42,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:55:42,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:55:42,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:55:42,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:55:42,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:55:39" (1/3) ... [2024-10-11 02:55:42,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f755d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:55:42, skipping insertion in model container [2024-10-11 02:55:42,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:40" (2/3) ... [2024-10-11 02:55:42,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f755d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:55:42, skipping insertion in model container [2024-10-11 02:55:42,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:55:42" (3/3) ... [2024-10-11 02:55:42,502 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product21.cil.c [2024-10-11 02:55:42,541 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:55:42,542 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:55:42,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:55:42,643 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;@3040ebee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:55:42,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:55:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 348 states, 268 states have (on average 1.6305970149253732) internal successors, (437), 273 states have internal predecessors, (437), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-11 02:55:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:55:42,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:42,673 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:42,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:42,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1387819178, now seen corresponding path program 1 times [2024-10-11 02:55:42,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:42,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633648628] [2024-10-11 02:55:42,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:55:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:55:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:55:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:55:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:55:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:55:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:55:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:55:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:55:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:55:43,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:43,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633648628] [2024-10-11 02:55:43,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633648628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:43,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914282905] [2024-10-11 02:55:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:43,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:43,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:43,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:43,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:55:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:55:43,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:55:43,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:55:43,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914282905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:43,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:55:43,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-11 02:55:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822186328] [2024-10-11 02:55:43,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:43,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:55:43,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:43,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:55:43,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:55:43,921 INFO L87 Difference]: Start difference. First operand has 348 states, 268 states have (on average 1.6305970149253732) internal successors, (437), 273 states have internal predecessors, (437), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:55:44,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:44,044 INFO L93 Difference]: Finished difference Result 512 states and 801 transitions. [2024-10-11 02:55:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:55:44,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2024-10-11 02:55:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:44,072 INFO L225 Difference]: With dead ends: 512 [2024-10-11 02:55:44,073 INFO L226 Difference]: Without dead ends: 345 [2024-10-11 02:55:44,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:55:44,083 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:44,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:55:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-11 02:55:44,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2024-10-11 02:55:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 266 states have (on average 1.6165413533834587) internal successors, (430), 270 states have internal predecessors, (430), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 02:55:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 543 transitions. [2024-10-11 02:55:44,183 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 543 transitions. Word has length 92 [2024-10-11 02:55:44,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:44,187 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 543 transitions. [2024-10-11 02:55:44,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:55:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 543 transitions. [2024-10-11 02:55:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:55:44,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:44,198 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:44,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:55:44,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:55:44,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:44,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:44,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1959067627, now seen corresponding path program 1 times [2024-10-11 02:55:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:44,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974987696] [2024-10-11 02:55:44,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:55:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:55:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:55:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:55:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:55:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:55:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:55:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:55:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:55:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:55:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974987696] [2024-10-11 02:55:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974987696] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231646995] [2024-10-11 02:55:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:44,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:44,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:44,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:55:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:55:45,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:55:45,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:55:45,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231646995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:45,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:55:45,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:55:45,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761260015] [2024-10-11 02:55:45,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:45,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:55:45,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:45,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:55:45,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:55:45,088 INFO L87 Difference]: Start difference. First operand 345 states and 543 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:55:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:45,153 INFO L93 Difference]: Finished difference Result 508 states and 785 transitions. [2024-10-11 02:55:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:55:45,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2024-10-11 02:55:45,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:45,158 INFO L225 Difference]: With dead ends: 508 [2024-10-11 02:55:45,158 INFO L226 Difference]: Without dead ends: 347 [2024-10-11 02:55:45,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:55:45,162 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 0 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:45,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1055 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:55:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-11 02:55:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-10-11 02:55:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 268 states have (on average 1.6119402985074627) internal successors, (432), 272 states have internal predecessors, (432), 57 states have call successors, (57), 21 states have call predecessors, (57), 21 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 02:55:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 545 transitions. [2024-10-11 02:55:45,199 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 545 transitions. Word has length 93 [2024-10-11 02:55:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:45,200 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 545 transitions. [2024-10-11 02:55:45,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:55:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 545 transitions. [2024-10-11 02:55:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:55:45,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:45,205 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:45,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:55:45,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:45,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:45,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:45,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1941173523, now seen corresponding path program 1 times [2024-10-11 02:55:45,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:45,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097691468] [2024-10-11 02:55:45,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:45,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:55:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:55:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:55:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:55:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:55:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:55:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:55:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:55:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:55:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:55:45,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:45,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097691468] [2024-10-11 02:55:45,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097691468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:45,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741941352] [2024-10-11 02:55:45,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:45,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:45,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:45,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:45,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:55:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:55:45,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:55:46,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:55:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741941352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:46,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:55:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:55:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077153956] [2024-10-11 02:55:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:46,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:55:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:46,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:55:46,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:55:46,010 INFO L87 Difference]: Start difference. First operand 347 states and 545 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:55:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:46,065 INFO L93 Difference]: Finished difference Result 742 states and 1182 transitions. [2024-10-11 02:55:46,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:55:46,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-11 02:55:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:46,069 INFO L225 Difference]: With dead ends: 742 [2024-10-11 02:55:46,069 INFO L226 Difference]: Without dead ends: 417 [2024-10-11 02:55:46,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:55:46,071 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 129 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:46,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1025 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:55:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-11 02:55:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 412. [2024-10-11 02:55:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 319 states have (on average 1.6269592476489028) internal successors, (519), 323 states have internal predecessors, (519), 71 states have call successors, (71), 21 states have call predecessors, (71), 21 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 02:55:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 660 transitions. [2024-10-11 02:55:46,098 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 660 transitions. Word has length 98 [2024-10-11 02:55:46,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:46,099 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 660 transitions. [2024-10-11 02:55:46,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:55:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 660 transitions. [2024-10-11 02:55:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:55:46,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:46,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:46,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 02:55:46,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:46,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash -740923576, now seen corresponding path program 1 times [2024-10-11 02:55:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935885874] [2024-10-11 02:55:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:55:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:55:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:55:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:55:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:55:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:55:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:55:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:55:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:55:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:55:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935885874] [2024-10-11 02:55:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935885874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874590651] [2024-10-11 02:55:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:46,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:46,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:46,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:46,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:55:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:46,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:55:46,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:55:46,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:55:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874590651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:46,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:55:46,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 02:55:46,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348529581] [2024-10-11 02:55:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:55:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:46,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:55:46,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:55:46,890 INFO L87 Difference]: Start difference. First operand 412 states and 660 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:55:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:47,005 INFO L93 Difference]: Finished difference Result 819 states and 1314 transitions. [2024-10-11 02:55:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:55:47,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2024-10-11 02:55:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:47,009 INFO L225 Difference]: With dead ends: 819 [2024-10-11 02:55:47,009 INFO L226 Difference]: Without dead ends: 414 [2024-10-11 02:55:47,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:55:47,012 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 2 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:47,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2069 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:55:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-11 02:55:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2024-10-11 02:55:47,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 320 states have (on average 1.625) internal successors, (520), 325 states have internal predecessors, (520), 71 states have call successors, (71), 21 states have call predecessors, (71), 22 states have return successors, (72), 69 states have call predecessors, (72), 70 states have call successors, (72) [2024-10-11 02:55:47,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 663 transitions. [2024-10-11 02:55:47,031 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 663 transitions. Word has length 99 [2024-10-11 02:55:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:47,031 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 663 transitions. [2024-10-11 02:55:47,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:55:47,031 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 663 transitions. [2024-10-11 02:55:47,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 02:55:47,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:47,034 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:47,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 02:55:47,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:47,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1542399003, now seen corresponding path program 1 times [2024-10-11 02:55:47,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179784411] [2024-10-11 02:55:47,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:47,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:55:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:55:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:55:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:55:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:55:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:55:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:55:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:55:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:55:47,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:47,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179784411] [2024-10-11 02:55:47,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179784411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822422636] [2024-10-11 02:55:47,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:47,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:47,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:47,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:55:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:55:47,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:55:47,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:55:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822422636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:47,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:55:47,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:55:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188067447] [2024-10-11 02:55:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:47,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:55:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:47,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:55:47,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:55:47,837 INFO L87 Difference]: Start difference. First operand 414 states and 663 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:55:47,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:47,963 INFO L93 Difference]: Finished difference Result 821 states and 1319 transitions. [2024-10-11 02:55:47,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:55:47,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2024-10-11 02:55:47,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:47,968 INFO L225 Difference]: With dead ends: 821 [2024-10-11 02:55:47,968 INFO L226 Difference]: Without dead ends: 416 [2024-10-11 02:55:47,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:55:47,972 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 2 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:47,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2055 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:55:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-11 02:55:47,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-10-11 02:55:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 321 states have (on average 1.6230529595015577) internal successors, (521), 327 states have internal predecessors, (521), 71 states have call successors, (71), 21 states have call predecessors, (71), 23 states have return successors, (77), 69 states have call predecessors, (77), 70 states have call successors, (77) [2024-10-11 02:55:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 669 transitions. [2024-10-11 02:55:48,003 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 669 transitions. Word has length 100 [2024-10-11 02:55:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:48,004 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 669 transitions. [2024-10-11 02:55:48,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:55:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 669 transitions. [2024-10-11 02:55:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:55:48,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:48,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:48,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 02:55:48,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:48,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:48,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:48,209 INFO L85 PathProgramCache]: Analyzing trace with hash -150907175, now seen corresponding path program 1 times [2024-10-11 02:55:48,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:48,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853506720] [2024-10-11 02:55:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:55:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:55:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:55:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:55:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:55:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:55:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:55:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:55:48,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:48,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853506720] [2024-10-11 02:55:48,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853506720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:48,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:48,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:55:48,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7125324] [2024-10-11 02:55:48,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:48,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:55:48,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:48,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:55:48,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:55:48,415 INFO L87 Difference]: Start difference. First operand 416 states and 669 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:55:50,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:50,621 INFO L93 Difference]: Finished difference Result 947 states and 1552 transitions. [2024-10-11 02:55:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:55:50,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2024-10-11 02:55:50,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:50,628 INFO L225 Difference]: With dead ends: 947 [2024-10-11 02:55:50,628 INFO L226 Difference]: Without dead ends: 550 [2024-10-11 02:55:50,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:55:50,633 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1161 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2657 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 2657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:50,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 1198 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 2657 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:55:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-11 02:55:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 416. [2024-10-11 02:55:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 321 states have (on average 1.6230529595015577) internal successors, (521), 327 states have internal predecessors, (521), 71 states have call successors, (71), 21 states have call predecessors, (71), 23 states have return successors, (76), 69 states have call predecessors, (76), 70 states have call successors, (76) [2024-10-11 02:55:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 668 transitions. [2024-10-11 02:55:50,677 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 668 transitions. Word has length 101 [2024-10-11 02:55:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:50,678 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 668 transitions. [2024-10-11 02:55:50,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:55:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 668 transitions. [2024-10-11 02:55:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 02:55:50,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:50,699 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:50,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:55:50,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:50,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 383788042, now seen corresponding path program 2 times [2024-10-11 02:55:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:50,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503296494] [2024-10-11 02:55:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:55:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:55:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:55:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:55:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:55:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:55:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:55:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:55:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503296494] [2024-10-11 02:55:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503296494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:50,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:50,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:55:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041478021] [2024-10-11 02:55:50,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:50,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:55:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:50,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:55:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:55:50,885 INFO L87 Difference]: Start difference. First operand 416 states and 668 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:55:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:52,951 INFO L93 Difference]: Finished difference Result 949 states and 1555 transitions. [2024-10-11 02:55:52,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:55:52,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2024-10-11 02:55:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:52,956 INFO L225 Difference]: With dead ends: 949 [2024-10-11 02:55:52,956 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 02:55:52,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:55:52,959 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1156 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2679 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 3064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:52,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1196 Invalid, 3064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2679 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 02:55:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 02:55:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 418. [2024-10-11 02:55:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 322 states have (on average 1.6211180124223603) internal successors, (522), 329 states have internal predecessors, (522), 71 states have call successors, (71), 21 states have call predecessors, (71), 24 states have return successors, (78), 69 states have call predecessors, (78), 70 states have call successors, (78) [2024-10-11 02:55:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 671 transitions. [2024-10-11 02:55:52,998 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 671 transitions. Word has length 102 [2024-10-11 02:55:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:52,998 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 671 transitions. [2024-10-11 02:55:52,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:55:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 671 transitions. [2024-10-11 02:55:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 02:55:53,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:53,002 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:53,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:55:53,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:53,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash 688710592, now seen corresponding path program 1 times [2024-10-11 02:55:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:53,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143008049] [2024-10-11 02:55:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:53,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:55:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:55:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:55:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:55:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:55:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:55:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:55:53,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:53,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143008049] [2024-10-11 02:55:53,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143008049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:53,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:53,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:55:53,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358324346] [2024-10-11 02:55:53,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:53,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:55:53,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:55:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:55:53,240 INFO L87 Difference]: Start difference. First operand 418 states and 671 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:55:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:55,230 INFO L93 Difference]: Finished difference Result 949 states and 1554 transitions. [2024-10-11 02:55:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:55:55,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-11 02:55:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:55,235 INFO L225 Difference]: With dead ends: 949 [2024-10-11 02:55:55,236 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 02:55:55,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:55:55,238 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1159 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:55,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1194 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:55:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 02:55:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 418. [2024-10-11 02:55:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 322 states have (on average 1.6211180124223603) internal successors, (522), 329 states have internal predecessors, (522), 71 states have call successors, (71), 21 states have call predecessors, (71), 24 states have return successors, (78), 69 states have call predecessors, (78), 70 states have call successors, (78) [2024-10-11 02:55:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 671 transitions. [2024-10-11 02:55:55,275 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 671 transitions. Word has length 103 [2024-10-11 02:55:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:55,276 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 671 transitions. [2024-10-11 02:55:55,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:55:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 671 transitions. [2024-10-11 02:55:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 02:55:55,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:55,278 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:55,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:55:55,279 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:55,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:55,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1656061246, now seen corresponding path program 1 times [2024-10-11 02:55:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:55,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682377422] [2024-10-11 02:55:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:55,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:55:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:55:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:55:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:55:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:55:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:55:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:55:55,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:55,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682377422] [2024-10-11 02:55:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682377422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:55,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:55:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367486487] [2024-10-11 02:55:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:55,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:55:55,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:55,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:55:55,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:55:55,508 INFO L87 Difference]: Start difference. First operand 418 states and 671 transitions. Second operand has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:55:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:58,040 INFO L93 Difference]: Finished difference Result 947 states and 1549 transitions. [2024-10-11 02:55:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:55:58,041 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2024-10-11 02:55:58,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:58,045 INFO L225 Difference]: With dead ends: 947 [2024-10-11 02:55:58,045 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 02:55:58,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:55:58,048 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1160 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 4440 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 4834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 4440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:58,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 1663 Invalid, 4834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 4440 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 02:55:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 02:55:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 418. [2024-10-11 02:55:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 322 states have (on average 1.6211180124223603) internal successors, (522), 329 states have internal predecessors, (522), 71 states have call successors, (71), 21 states have call predecessors, (71), 24 states have return successors, (77), 69 states have call predecessors, (77), 70 states have call successors, (77) [2024-10-11 02:55:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 670 transitions. [2024-10-11 02:55:58,105 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 670 transitions. Word has length 103 [2024-10-11 02:55:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:58,105 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 670 transitions. [2024-10-11 02:55:58,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.181818181818182) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:55:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 670 transitions. [2024-10-11 02:55:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:55:58,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:58,109 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:58,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:55:58,109 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:58,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:58,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1577035086, now seen corresponding path program 2 times [2024-10-11 02:55:58,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:58,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044877788] [2024-10-11 02:55:58,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:58,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:55:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:55:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:55:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:55:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:55:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:55:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:55:58,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:58,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044877788] [2024-10-11 02:55:58,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044877788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:58,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:58,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:55:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821305468] [2024-10-11 02:55:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:58,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:55:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:58,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:55:58,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:55:58,354 INFO L87 Difference]: Start difference. First operand 418 states and 670 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:56:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:00,882 INFO L93 Difference]: Finished difference Result 949 states and 1555 transitions. [2024-10-11 02:56:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:56:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2024-10-11 02:56:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:00,887 INFO L225 Difference]: With dead ends: 949 [2024-10-11 02:56:00,887 INFO L226 Difference]: Without dead ends: 554 [2024-10-11 02:56:00,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:56:00,890 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1158 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 4408 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 4798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 4408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:00,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 1662 Invalid, 4798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 4408 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 02:56:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-10-11 02:56:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 420. [2024-10-11 02:56:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 323 states have (on average 1.6191950464396285) internal successors, (523), 331 states have internal predecessors, (523), 71 states have call successors, (71), 21 states have call predecessors, (71), 25 states have return successors, (82), 69 states have call predecessors, (82), 70 states have call successors, (82) [2024-10-11 02:56:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 676 transitions. [2024-10-11 02:56:00,925 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 676 transitions. Word has length 104 [2024-10-11 02:56:00,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:00,925 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 676 transitions. [2024-10-11 02:56:00,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:56:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 676 transitions. [2024-10-11 02:56:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 02:56:00,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:00,928 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:00,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:56:00,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:00,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:00,929 INFO L85 PathProgramCache]: Analyzing trace with hash -791772221, now seen corresponding path program 1 times [2024-10-11 02:56:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028193530] [2024-10-11 02:56:00,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:56:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:56:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:56:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:56:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:56:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:56:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028193530] [2024-10-11 02:56:01,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028193530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:01,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403413504] [2024-10-11 02:56:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:01,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:01,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:01,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:01,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:56:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:56:01,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:01,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:56:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:01,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403413504] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:56:01,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:56:01,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-11 02:56:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844098514] [2024-10-11 02:56:01,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:56:01,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:56:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:56:01,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:56:01,537 INFO L87 Difference]: Start difference. First operand 420 states and 676 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:56:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:03,289 INFO L93 Difference]: Finished difference Result 1135 states and 1932 transitions. [2024-10-11 02:56:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:56:03,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 105 [2024-10-11 02:56:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:03,297 INFO L225 Difference]: With dead ends: 1135 [2024-10-11 02:56:03,297 INFO L226 Difference]: Without dead ends: 974 [2024-10-11 02:56:03,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:56:03,300 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 1736 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:03,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 1578 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 2307 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:56:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-11 02:56:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 825. [2024-10-11 02:56:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 649 states have (on average 1.6687211093990755) internal successors, (1083), 657 states have internal predecessors, (1083), 150 states have call successors, (150), 21 states have call predecessors, (150), 25 states have return successors, (171), 148 states have call predecessors, (171), 149 states have call successors, (171) [2024-10-11 02:56:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1404 transitions. [2024-10-11 02:56:03,382 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1404 transitions. Word has length 105 [2024-10-11 02:56:03,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:03,382 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1404 transitions. [2024-10-11 02:56:03,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 02:56:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1404 transitions. [2024-10-11 02:56:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 02:56:03,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:03,387 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:03,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 02:56:03,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 02:56:03,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:03,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash -545833952, now seen corresponding path program 1 times [2024-10-11 02:56:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:03,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846962447] [2024-10-11 02:56:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:56:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:56:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:56:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:56:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:56:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:56:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:03,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:03,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846962447] [2024-10-11 02:56:03,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846962447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:03,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:03,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:03,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119522550] [2024-10-11 02:56:03,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:03,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:03,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:03,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:03,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:03,698 INFO L87 Difference]: Start difference. First operand 825 states and 1404 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:05,229 INFO L93 Difference]: Finished difference Result 2131 states and 3711 transitions. [2024-10-11 02:56:05,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:05,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-10-11 02:56:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:05,238 INFO L225 Difference]: With dead ends: 2131 [2024-10-11 02:56:05,239 INFO L226 Difference]: Without dead ends: 1366 [2024-10-11 02:56:05,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:05,242 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1282 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:05,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 898 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:56:05,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2024-10-11 02:56:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1227. [2024-10-11 02:56:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 972 states have (on average 1.676954732510288) internal successors, (1630), 980 states have internal predecessors, (1630), 229 states have call successors, (229), 21 states have call predecessors, (229), 25 states have return successors, (260), 227 states have call predecessors, (260), 228 states have call successors, (260) [2024-10-11 02:56:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 2119 transitions. [2024-10-11 02:56:05,302 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 2119 transitions. Word has length 111 [2024-10-11 02:56:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:05,302 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 2119 transitions. [2024-10-11 02:56:05,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 2119 transitions. [2024-10-11 02:56:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 02:56:05,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:05,309 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:05,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:56:05,310 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:05,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:05,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2067585528, now seen corresponding path program 1 times [2024-10-11 02:56:05,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:05,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774041736] [2024-10-11 02:56:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:05,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:56:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:56:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:56:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:56:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:56:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:56:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:05,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:05,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774041736] [2024-10-11 02:56:05,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774041736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:05,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:05,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:05,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116582812] [2024-10-11 02:56:05,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:05,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:05,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:05,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:05,425 INFO L87 Difference]: Start difference. First operand 1227 states and 2119 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:06,830 INFO L93 Difference]: Finished difference Result 3114 states and 5458 transitions. [2024-10-11 02:56:06,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:06,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2024-10-11 02:56:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:06,844 INFO L225 Difference]: With dead ends: 3114 [2024-10-11 02:56:06,845 INFO L226 Difference]: Without dead ends: 1997 [2024-10-11 02:56:06,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:06,851 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 1278 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:06,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 890 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:56:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2024-10-11 02:56:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1858. [2024-10-11 02:56:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1484 states have (on average 1.6819407008086253) internal successors, (2496), 1492 states have internal predecessors, (2496), 348 states have call successors, (348), 21 states have call predecessors, (348), 25 states have return successors, (379), 346 states have call predecessors, (379), 347 states have call successors, (379) [2024-10-11 02:56:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3223 transitions. [2024-10-11 02:56:06,952 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3223 transitions. Word has length 112 [2024-10-11 02:56:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:06,953 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 3223 transitions. [2024-10-11 02:56:06,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3223 transitions. [2024-10-11 02:56:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:56:06,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:06,963 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:06,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:56:06,964 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:06,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 929326338, now seen corresponding path program 1 times [2024-10-11 02:56:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:06,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505022667] [2024-10-11 02:56:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:56:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:56:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:56:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:56:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:56:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:56:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:07,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:07,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505022667] [2024-10-11 02:56:07,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505022667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:07,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:07,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:07,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032011758] [2024-10-11 02:56:07,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:07,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:07,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:07,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:07,073 INFO L87 Difference]: Start difference. First operand 1858 states and 3223 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:08,560 INFO L93 Difference]: Finished difference Result 4594 states and 8110 transitions. [2024-10-11 02:56:08,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:08,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-10-11 02:56:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:08,580 INFO L225 Difference]: With dead ends: 4594 [2024-10-11 02:56:08,580 INFO L226 Difference]: Without dead ends: 2966 [2024-10-11 02:56:08,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:08,589 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1278 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:08,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 878 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:56:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2024-10-11 02:56:08,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2827. [2024-10-11 02:56:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2291 states have (on average 1.6865997381056308) internal successors, (3864), 2299 states have internal predecessors, (3864), 510 states have call successors, (510), 21 states have call predecessors, (510), 25 states have return successors, (557), 508 states have call predecessors, (557), 509 states have call successors, (557) [2024-10-11 02:56:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4931 transitions. [2024-10-11 02:56:08,715 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4931 transitions. Word has length 113 [2024-10-11 02:56:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:08,715 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 4931 transitions. [2024-10-11 02:56:08,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4931 transitions. [2024-10-11 02:56:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 02:56:08,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:08,728 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:08,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:56:08,728 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:08,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1437406681, now seen corresponding path program 1 times [2024-10-11 02:56:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:08,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862991430] [2024-10-11 02:56:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:56:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:56:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:56:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:56:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:56:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:56:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:08,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:08,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862991430] [2024-10-11 02:56:08,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862991430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:08,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:08,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:08,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138963493] [2024-10-11 02:56:08,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:08,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:08,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:08,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:08,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:08,865 INFO L87 Difference]: Start difference. First operand 2827 states and 4931 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:10,227 INFO L93 Difference]: Finished difference Result 6934 states and 12315 transitions. [2024-10-11 02:56:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2024-10-11 02:56:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:10,254 INFO L225 Difference]: With dead ends: 6934 [2024-10-11 02:56:10,254 INFO L226 Difference]: Without dead ends: 4534 [2024-10-11 02:56:10,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:10,266 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1279 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:10,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 876 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:56:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2024-10-11 02:56:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 4395. [2024-10-11 02:56:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4395 states, 3614 states have (on average 1.6900940785832872) internal successors, (6108), 3622 states have internal predecessors, (6108), 755 states have call successors, (755), 21 states have call predecessors, (755), 25 states have return successors, (828), 753 states have call predecessors, (828), 754 states have call successors, (828) [2024-10-11 02:56:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 7691 transitions. [2024-10-11 02:56:10,503 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 7691 transitions. Word has length 114 [2024-10-11 02:56:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:10,504 INFO L471 AbstractCegarLoop]: Abstraction has 4395 states and 7691 transitions. [2024-10-11 02:56:10,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 7691 transitions. [2024-10-11 02:56:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:56:10,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:10,520 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:10,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:56:10,520 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:10,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:10,521 INFO L85 PathProgramCache]: Analyzing trace with hash 588291070, now seen corresponding path program 1 times [2024-10-11 02:56:10,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:10,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946512090] [2024-10-11 02:56:10,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:56:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:56:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:56:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:56:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:56:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:56:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:10,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946512090] [2024-10-11 02:56:10,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946512090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:10,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:10,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:10,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30775279] [2024-10-11 02:56:10,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:10,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:10,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:10,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:10,635 INFO L87 Difference]: Start difference. First operand 4395 states and 7691 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:12,098 INFO L93 Difference]: Finished difference Result 10887 states and 19382 transitions. [2024-10-11 02:56:12,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:12,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-10-11 02:56:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:12,155 INFO L225 Difference]: With dead ends: 10887 [2024-10-11 02:56:12,155 INFO L226 Difference]: Without dead ends: 7206 [2024-10-11 02:56:12,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:12,173 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1275 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:12,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 902 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:56:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states. [2024-10-11 02:56:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 7067. [2024-10-11 02:56:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7067 states, 5793 states have (on average 1.683411013291904) internal successors, (9752), 5801 states have internal predecessors, (9752), 1248 states have call successors, (1248), 21 states have call predecessors, (1248), 25 states have return successors, (1365), 1246 states have call predecessors, (1365), 1247 states have call successors, (1365) [2024-10-11 02:56:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 12365 transitions. [2024-10-11 02:56:12,503 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 12365 transitions. Word has length 115 [2024-10-11 02:56:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:12,504 INFO L471 AbstractCegarLoop]: Abstraction has 7067 states and 12365 transitions. [2024-10-11 02:56:12,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 12365 transitions. [2024-10-11 02:56:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 02:56:12,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:12,523 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:12,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:56:12,523 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:12,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash 746965725, now seen corresponding path program 1 times [2024-10-11 02:56:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:12,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8449605] [2024-10-11 02:56:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:12,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:56:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:56:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:56:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:56:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:56:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:56:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:12,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:12,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8449605] [2024-10-11 02:56:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8449605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:12,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:12,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254077093] [2024-10-11 02:56:12,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:12,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:12,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:12,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:12,631 INFO L87 Difference]: Start difference. First operand 7067 states and 12365 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:14,330 INFO L93 Difference]: Finished difference Result 18022 states and 32066 transitions. [2024-10-11 02:56:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:14,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-10-11 02:56:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:14,376 INFO L225 Difference]: With dead ends: 18022 [2024-10-11 02:56:14,377 INFO L226 Difference]: Without dead ends: 12035 [2024-10-11 02:56:14,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:14,395 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1274 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:14,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 883 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:56:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12035 states. [2024-10-11 02:56:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12035 to 11896. [2024-10-11 02:56:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11896 states, 9800 states have (on average 1.6828571428571428) internal successors, (16492), 9808 states have internal predecessors, (16492), 2070 states have call successors, (2070), 21 states have call predecessors, (2070), 25 states have return successors, (2265), 2068 states have call predecessors, (2265), 2069 states have call successors, (2265) [2024-10-11 02:56:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11896 states to 11896 states and 20827 transitions. [2024-10-11 02:56:14,951 INFO L78 Accepts]: Start accepts. Automaton has 11896 states and 20827 transitions. Word has length 116 [2024-10-11 02:56:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:14,952 INFO L471 AbstractCegarLoop]: Abstraction has 11896 states and 20827 transitions. [2024-10-11 02:56:14,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 11896 states and 20827 transitions. [2024-10-11 02:56:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 02:56:14,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:14,977 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:14,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:56:14,977 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:14,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash -934147540, now seen corresponding path program 1 times [2024-10-11 02:56:14,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:14,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854935575] [2024-10-11 02:56:14,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:14,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:56:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:56:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:56:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:56:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:56:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:56:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854935575] [2024-10-11 02:56:15,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854935575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:15,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:15,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:15,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939629] [2024-10-11 02:56:15,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:15,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:15,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:15,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:15,093 INFO L87 Difference]: Start difference. First operand 11896 states and 20827 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:16,883 INFO L93 Difference]: Finished difference Result 28568 states and 50619 transitions. [2024-10-11 02:56:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:16,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-10-11 02:56:16,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:16,964 INFO L225 Difference]: With dead ends: 28568 [2024-10-11 02:56:16,965 INFO L226 Difference]: Without dead ends: 18707 [2024-10-11 02:56:17,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:17,005 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1270 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:17,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 857 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:56:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18707 states. [2024-10-11 02:56:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18707 to 18568. [2024-10-11 02:56:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18568 states, 15269 states have (on average 1.6604230794420067) internal successors, (25353), 15277 states have internal predecessors, (25353), 3273 states have call successors, (3273), 21 states have call predecessors, (3273), 25 states have return successors, (3612), 3271 states have call predecessors, (3612), 3272 states have call successors, (3612) [2024-10-11 02:56:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18568 states to 18568 states and 32238 transitions. [2024-10-11 02:56:17,825 INFO L78 Accepts]: Start accepts. Automaton has 18568 states and 32238 transitions. Word has length 117 [2024-10-11 02:56:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:17,826 INFO L471 AbstractCegarLoop]: Abstraction has 18568 states and 32238 transitions. [2024-10-11 02:56:17,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:17,826 INFO L276 IsEmpty]: Start isEmpty. Operand 18568 states and 32238 transitions. [2024-10-11 02:56:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 02:56:17,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:17,846 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:17,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:56:17,847 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:17,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash -946010146, now seen corresponding path program 1 times [2024-10-11 02:56:17,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:17,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733597556] [2024-10-11 02:56:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:56:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:56:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:56:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:56:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:56:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:56:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:18,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:18,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733597556] [2024-10-11 02:56:18,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733597556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:18,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:18,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:18,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101533251] [2024-10-11 02:56:18,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:18,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:18,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:18,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:18,049 INFO L87 Difference]: Start difference. First operand 18568 states and 32238 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:19,977 INFO L93 Difference]: Finished difference Result 49201 states and 86940 transitions. [2024-10-11 02:56:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:19,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2024-10-11 02:56:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:20,154 INFO L225 Difference]: With dead ends: 49201 [2024-10-11 02:56:20,154 INFO L226 Difference]: Without dead ends: 33288 [2024-10-11 02:56:20,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:20,379 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1268 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:20,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 877 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:56:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33288 states. [2024-10-11 02:56:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33288 to 33149. [2024-10-11 02:56:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33149 states, 27400 states have (on average 1.6575182481751825) internal successors, (45416), 27408 states have internal predecessors, (45416), 5723 states have call successors, (5723), 21 states have call predecessors, (5723), 25 states have return successors, (6336), 5721 states have call predecessors, (6336), 5722 states have call successors, (6336) [2024-10-11 02:56:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33149 states to 33149 states and 57475 transitions. [2024-10-11 02:56:21,935 INFO L78 Accepts]: Start accepts. Automaton has 33149 states and 57475 transitions. Word has length 118 [2024-10-11 02:56:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:21,937 INFO L471 AbstractCegarLoop]: Abstraction has 33149 states and 57475 transitions. [2024-10-11 02:56:21,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 33149 states and 57475 transitions. [2024-10-11 02:56:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 02:56:21,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:21,970 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:21,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:56:21,971 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:21,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1087225722, now seen corresponding path program 1 times [2024-10-11 02:56:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334194809] [2024-10-11 02:56:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:21,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:56:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:56:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:56:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:56:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:56:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:56:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:22,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:22,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334194809] [2024-10-11 02:56:22,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334194809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:22,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:22,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:22,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302476074] [2024-10-11 02:56:22,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:22,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:22,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:22,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:22,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:22,104 INFO L87 Difference]: Start difference. First operand 33149 states and 57475 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:25,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:25,100 INFO L93 Difference]: Finished difference Result 90503 states and 159164 transitions. [2024-10-11 02:56:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:25,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-10-11 02:56:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:25,632 INFO L225 Difference]: With dead ends: 90503 [2024-10-11 02:56:25,643 INFO L226 Difference]: Without dead ends: 60900 [2024-10-11 02:56:25,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:25,791 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1268 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:25,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 887 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:56:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60900 states. [2024-10-11 02:56:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60900 to 60761. [2024-10-11 02:56:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60761 states, 50499 states have (on average 1.653735717538961) internal successors, (83512), 50507 states have internal predecessors, (83512), 10236 states have call successors, (10236), 21 states have call predecessors, (10236), 25 states have return successors, (11381), 10234 states have call predecessors, (11381), 10235 states have call successors, (11381) [2024-10-11 02:56:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60761 states to 60761 states and 105129 transitions. [2024-10-11 02:56:28,549 INFO L78 Accepts]: Start accepts. Automaton has 60761 states and 105129 transitions. Word has length 119 [2024-10-11 02:56:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:28,551 INFO L471 AbstractCegarLoop]: Abstraction has 60761 states and 105129 transitions. [2024-10-11 02:56:28,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 60761 states and 105129 transitions. [2024-10-11 02:56:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 02:56:28,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:28,584 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:28,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:56:28,584 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:28,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1098138818, now seen corresponding path program 1 times [2024-10-11 02:56:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:28,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810883844] [2024-10-11 02:56:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:56:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:56:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:56:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:56:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:56:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:56:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:28,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:28,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810883844] [2024-10-11 02:56:28,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810883844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:28,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:28,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571763469] [2024-10-11 02:56:28,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:28,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:28,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:28,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:28,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:28,698 INFO L87 Difference]: Start difference. First operand 60761 states and 105129 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:32,455 INFO L93 Difference]: Finished difference Result 113855 states and 200774 transitions. [2024-10-11 02:56:32,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:32,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-10-11 02:56:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:33,066 INFO L225 Difference]: With dead ends: 113855 [2024-10-11 02:56:33,067 INFO L226 Difference]: Without dead ends: 113694 [2024-10-11 02:56:33,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:33,133 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1263 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:33,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 890 Invalid, 1967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:56:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113694 states. [2024-10-11 02:56:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113694 to 113555. [2024-10-11 02:56:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113555 states, 94925 states have (on average 1.6489228338161706) internal successors, (156524), 94933 states have internal predecessors, (156524), 18604 states have call successors, (18604), 21 states have call predecessors, (18604), 25 states have return successors, (20795), 18602 states have call predecessors, (20795), 18603 states have call successors, (20795) [2024-10-11 02:56:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113555 states to 113555 states and 195923 transitions. [2024-10-11 02:56:37,642 INFO L78 Accepts]: Start accepts. Automaton has 113555 states and 195923 transitions. Word has length 120 [2024-10-11 02:56:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:37,643 INFO L471 AbstractCegarLoop]: Abstraction has 113555 states and 195923 transitions. [2024-10-11 02:56:37,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:56:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 113555 states and 195923 transitions. [2024-10-11 02:56:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 02:56:37,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:37,686 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:37,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:56:37,686 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:37,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1967980539, now seen corresponding path program 1 times [2024-10-11 02:56:37,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:37,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364110703] [2024-10-11 02:56:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:56:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:56:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:56:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:56:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:56:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:56:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:38,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:38,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364110703] [2024-10-11 02:56:38,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364110703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:38,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:38,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 02:56:38,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992071356] [2024-10-11 02:56:38,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:38,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:56:38,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:38,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:56:38,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:56:38,228 INFO L87 Difference]: Start difference. First operand 113555 states and 195923 transitions. Second operand has 16 states, 15 states have (on average 5.4) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-11 02:56:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:48,356 INFO L93 Difference]: Finished difference Result 226604 states and 403020 transitions. [2024-10-11 02:56:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 02:56:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.4) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (15), 7 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 121 [2024-10-11 02:56:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:49,633 INFO L225 Difference]: With dead ends: 226604 [2024-10-11 02:56:49,633 INFO L226 Difference]: Without dead ends: 226448