./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product34.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product34.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76fb98768a82c6e881c4461160153969b956a6a73a8217d33a39b93921ba72b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:40:00,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:40:00,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:40:00,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:40:00,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:40:00,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:40:00,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:40:00,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:40:00,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:40:00,994 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:40:00,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:40:00,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:40:00,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:40:00,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:40:00,995 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:40:00,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:40:00,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:40:00,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:40:00,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:40:00,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:40:00,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:40:01,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:40:01,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:40:01,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:40:01,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:40:01,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:40:01,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:40:01,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:40:01,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:40:01,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:40:01,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:40:01,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:40:01,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:40:01,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:40:01,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:40:01,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:40:01,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:40:01,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:40:01,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:40:01,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:40:01,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:40:01,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:40:01,007 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/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/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 -> 76fb98768a82c6e881c4461160153969b956a6a73a8217d33a39b93921ba72b5 [2024-11-11 20:40:01,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:40:01,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:40:01,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:40:01,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:40:01,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:40:01,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product34.cil.c [2024-11-11 20:40:02,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:40:02,789 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:40:02,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product34.cil.c [2024-11-11 20:40:02,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f991f41/1768e0fe85f64d8db789072faf49b1f2/FLAGe156348de [2024-11-11 20:40:02,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f991f41/1768e0fe85f64d8db789072faf49b1f2 [2024-11-11 20:40:02,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:40:02,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:40:02,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:40:02,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:40:02,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:40:02,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:40:02" (1/1) ... [2024-11-11 20:40:02,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce54e4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:02, skipping insertion in model container [2024-11-11 20:40:02,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:40:02" (1/1) ... [2024-11-11 20:40:02,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:40:03,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product34.cil.c[2480,2493] [2024-11-11 20:40:03,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:40:03,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:40:03,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [48] [2024-11-11 20:40:03,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [90] [2024-11-11 20:40:03,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [99] [2024-11-11 20:40:03,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [117] [2024-11-11 20:40:03,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [483] [2024-11-11 20:40:03,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1563] [2024-11-11 20:40:03,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1601] [2024-11-11 20:40:03,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2021] [2024-11-11 20:40:03,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2250] [2024-11-11 20:40:03,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2387] [2024-11-11 20:40:03,401 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2784] [2024-11-11 20:40:03,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product34.cil.c[2480,2493] [2024-11-11 20:40:03,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:40:03,488 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:40:03,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03 WrapperNode [2024-11-11 20:40:03,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:40:03,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:40:03,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:40:03,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:40:03,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,565 INFO L138 Inliner]: procedures = 134, calls = 219, calls flagged for inlining = 62, calls inlined = 59, statements flattened = 1103 [2024-11-11 20:40:03,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:40:03,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:40:03,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:40:03,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:40:03,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,604 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-11-11 20:40:03,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:40:03,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:40:03,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:40:03,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:40:03,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (1/1) ... [2024-11-11 20:40:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:40:03,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:03,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:40:03,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:40:03,743 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-11 20:40:03,743 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-11 20:40:03,743 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-11-11 20:40:03,743 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-11-11 20:40:03,743 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:40:03,744 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:40:03,744 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-11-11 20:40:03,744 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-11-11 20:40:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:40:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:40:03,745 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:40:03,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:40:03,746 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:40:03,746 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:40:03,746 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:40:03,746 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:40:03,746 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:40:03,746 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:40:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:40:03,747 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:40:03,747 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:40:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:40:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:40:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:40:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:40:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-11 20:40:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-11 20:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-11-11 20:40:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-11-11 20:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:40:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:40:03,748 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:40:03,748 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:40:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:40:03,749 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:40:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2024-11-11 20:40:03,749 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2024-11-11 20:40:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:40:03,749 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:40:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:40:03,749 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:40:03,749 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:40:03,749 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:40:03,750 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:40:03,750 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:40:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:40:03,751 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:40:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:40:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:40:03,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:40:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:40:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:40:03,752 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:40:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-11-11 20:40:03,752 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-11-11 20:40:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:40:03,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:40:03,958 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:40:03,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:40:05,260 INFO L? ?]: Removed 583 outVars from TransFormulas that were not future-live. [2024-11-11 20:40:05,260 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:40:05,275 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:40:05,275 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:40:05,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:40:05 BoogieIcfgContainer [2024-11-11 20:40:05,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:40:05,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:40:05,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:40:05,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:40:05,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:40:02" (1/3) ... [2024-11-11 20:40:05,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1585e8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:40:05, skipping insertion in model container [2024-11-11 20:40:05,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:03" (2/3) ... [2024-11-11 20:40:05,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1585e8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:40:05, skipping insertion in model container [2024-11-11 20:40:05,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:40:05" (3/3) ... [2024-11-11 20:40:05,281 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product34.cil.c [2024-11-11 20:40:05,293 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:40:05,293 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:40:05,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:40:05,351 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;@25a955c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:40:05,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:40:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 447 states, 346 states have (on average 1.5375722543352601) internal successors, (532), 351 states have internal predecessors, (532), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-11 20:40:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:40:05,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:05,372 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:05,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:05,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:05,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1466919949, now seen corresponding path program 1 times [2024-11-11 20:40:05,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:05,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686501060] [2024-11-11 20:40:05,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:05,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:40:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:40:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:40:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:40:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:40:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:40:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:40:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:40:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:40:06,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:06,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686501060] [2024-11-11 20:40:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686501060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591282745] [2024-11-11 20:40:06,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:06,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:06,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:06,150 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:06,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:40:06,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:06,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:40:06,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:40:06,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:06,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591282745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:06,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:06,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-11 20:40:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752263727] [2024-11-11 20:40:06,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:06,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:40:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:06,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:40:06,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:40:06,540 INFO L87 Difference]: Start difference. First operand has 447 states, 346 states have (on average 1.5375722543352601) internal successors, (532), 351 states have internal predecessors, (532), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:06,633 INFO L93 Difference]: Finished difference Result 701 states and 1038 transitions. [2024-11-11 20:40:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:40:06,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-11-11 20:40:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:06,660 INFO L225 Difference]: With dead ends: 701 [2024-11-11 20:40:06,660 INFO L226 Difference]: Without dead ends: 440 [2024-11-11 20:40:06,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 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-11-11 20:40:06,681 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:06,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-11 20:40:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-11 20:40:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 340 states have (on average 1.5323529411764707) internal successors, (521), 344 states have internal predecessors, (521), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-11 20:40:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 662 transitions. [2024-11-11 20:40:06,759 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 662 transitions. Word has length 110 [2024-11-11 20:40:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:06,761 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 662 transitions. [2024-11-11 20:40:06,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 662 transitions. [2024-11-11 20:40:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:40:06,771 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:06,772 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:06,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:40:06,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-11 20:40:06,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash -467021498, now seen corresponding path program 1 times [2024-11-11 20:40:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909619374] [2024-11-11 20:40:06,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:06,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:40:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:40:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:40:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:40:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:40:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:40:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:40:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:40:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:40:07,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:07,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909619374] [2024-11-11 20:40:07,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909619374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075497806] [2024-11-11 20:40:07,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:07,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:07,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:07,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:07,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:40:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:40:07,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:07,546 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:40:07,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075497806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:07,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:07,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:40:07,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986472009] [2024-11-11 20:40:07,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:07,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:40:07,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:07,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:40:07,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:40:07,549 INFO L87 Difference]: Start difference. First operand 440 states and 662 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:07,581 INFO L93 Difference]: Finished difference Result 691 states and 1016 transitions. [2024-11-11 20:40:07,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:40:07,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-11-11 20:40:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:07,585 INFO L225 Difference]: With dead ends: 691 [2024-11-11 20:40:07,585 INFO L226 Difference]: Without dead ends: 443 [2024-11-11 20:40:07,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 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-11-11 20:40:07,587 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 1 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:07,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1318 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-11 20:40:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 442. [2024-11-11 20:40:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 342 states have (on average 1.5292397660818713) internal successors, (523), 346 states have internal predecessors, (523), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-11 20:40:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 664 transitions. [2024-11-11 20:40:07,606 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 664 transitions. Word has length 111 [2024-11-11 20:40:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:07,606 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 664 transitions. [2024-11-11 20:40:07,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 664 transitions. [2024-11-11 20:40:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:40:07,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:07,609 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:07,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:40:07,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-11 20:40:07,810 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:07,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:07,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2076566883, now seen corresponding path program 1 times [2024-11-11 20:40:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:07,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027655102] [2024-11-11 20:40:07,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:07,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:40:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:40:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:40:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:40:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:40:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:40:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:40:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:40:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:08,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027655102] [2024-11-11 20:40:08,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027655102] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:08,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034154655] [2024-11-11 20:40:08,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:08,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:08,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:08,086 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:08,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:40:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:40:08,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:40:08,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:08,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034154655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:08,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:08,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:40:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589262236] [2024-11-11 20:40:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:08,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:40:08,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:08,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:40:08,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:40:08,346 INFO L87 Difference]: Start difference. First operand 442 states and 664 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:08,370 INFO L93 Difference]: Finished difference Result 932 states and 1420 transitions. [2024-11-11 20:40:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:40:08,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-11 20:40:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:08,379 INFO L225 Difference]: With dead ends: 932 [2024-11-11 20:40:08,379 INFO L226 Difference]: Without dead ends: 517 [2024-11-11 20:40:08,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 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-11-11 20:40:08,381 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 134 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:08,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1284 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-11-11 20:40:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 509. [2024-11-11 20:40:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 395 states have (on average 1.549367088607595) internal successors, (612), 399 states have internal predecessors, (612), 85 states have call successors, (85), 28 states have call predecessors, (85), 28 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-11 20:40:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 781 transitions. [2024-11-11 20:40:08,399 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 781 transitions. Word has length 117 [2024-11-11 20:40:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:08,399 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 781 transitions. [2024-11-11 20:40:08,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 781 transitions. [2024-11-11 20:40:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:40:08,401 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:08,401 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:08,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:40:08,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:08,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:08,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:08,607 INFO L85 PathProgramCache]: Analyzing trace with hash -39840388, now seen corresponding path program 1 times [2024-11-11 20:40:08,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:08,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919792020] [2024-11-11 20:40:08,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:08,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:40:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:40:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:40:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:40:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:40:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:40:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:40:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919792020] [2024-11-11 20:40:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919792020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:08,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551646149] [2024-11-11 20:40:08,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:08,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:08,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:08,799 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:08,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:40:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:40:09,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:40:09,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:09,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551646149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:09,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:09,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-11 20:40:09,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791800243] [2024-11-11 20:40:09,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:09,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:40:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:09,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:40:09,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:40:09,132 INFO L87 Difference]: Start difference. First operand 509 states and 781 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:40:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:09,194 INFO L93 Difference]: Finished difference Result 1009 states and 1552 transitions. [2024-11-11 20:40:09,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:40:09,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2024-11-11 20:40:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:09,198 INFO L225 Difference]: With dead ends: 1009 [2024-11-11 20:40:09,199 INFO L226 Difference]: Without dead ends: 511 [2024-11-11 20:40:09,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 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-11-11 20:40:09,203 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 2 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:09,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2605 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-11 20:40:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2024-11-11 20:40:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 396 states have (on average 1.547979797979798) internal successors, (613), 401 states have internal predecessors, (613), 85 states have call successors, (85), 28 states have call predecessors, (85), 29 states have return successors, (86), 83 states have call predecessors, (86), 84 states have call successors, (86) [2024-11-11 20:40:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 784 transitions. [2024-11-11 20:40:09,237 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 784 transitions. Word has length 118 [2024-11-11 20:40:09,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:09,238 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 784 transitions. [2024-11-11 20:40:09,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:40:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 784 transitions. [2024-11-11 20:40:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 20:40:09,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:09,242 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:09,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:40:09,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:09,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:09,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:09,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1820964723, now seen corresponding path program 1 times [2024-11-11 20:40:09,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:09,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012545580] [2024-11-11 20:40:09,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:40:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:40:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:40:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:40:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:40:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:40:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:40:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:40:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:40:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:40:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:40:09,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012545580] [2024-11-11 20:40:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012545580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072864520] [2024-11-11 20:40:09,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:09,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:09,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:09,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:09,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:40:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:09,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:40:09,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:40:09,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:09,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072864520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:09,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:09,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:40:09,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422715484] [2024-11-11 20:40:09,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:09,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:40:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:09,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:40:09,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:40:09,994 INFO L87 Difference]: Start difference. First operand 511 states and 784 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:40:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:10,043 INFO L93 Difference]: Finished difference Result 1011 states and 1557 transitions. [2024-11-11 20:40:10,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:40:10,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2024-11-11 20:40:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:10,051 INFO L225 Difference]: With dead ends: 1011 [2024-11-11 20:40:10,054 INFO L226 Difference]: Without dead ends: 513 [2024-11-11 20:40:10,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 139 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-11-11 20:40:10,061 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 2 mSDsluCounter, 1939 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2591 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:10,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2591 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-11 20:40:10,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2024-11-11 20:40:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 397 states have (on average 1.5465994962216625) internal successors, (614), 403 states have internal predecessors, (614), 85 states have call successors, (85), 28 states have call predecessors, (85), 30 states have return successors, (91), 83 states have call predecessors, (91), 84 states have call successors, (91) [2024-11-11 20:40:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 790 transitions. [2024-11-11 20:40:10,084 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 790 transitions. Word has length 119 [2024-11-11 20:40:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:10,084 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 790 transitions. [2024-11-11 20:40:10,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:40:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 790 transitions. [2024-11-11 20:40:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:40:10,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:10,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:10,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:40:10,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:10,287 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:10,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:10,288 INFO L85 PathProgramCache]: Analyzing trace with hash 350854511, now seen corresponding path program 1 times [2024-11-11 20:40:10,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:10,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580549358] [2024-11-11 20:40:10,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:10,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:40:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:40:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:40:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:40:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:40:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:40:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:40:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:40:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:40:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:10,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580549358] [2024-11-11 20:40:10,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580549358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:10,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:10,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:40:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305581100] [2024-11-11 20:40:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:10,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:40:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:10,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:40:10,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:40:10,484 INFO L87 Difference]: Start difference. First operand 513 states and 790 transitions. Second operand has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:40:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:13,287 INFO L93 Difference]: Finished difference Result 1207 states and 1875 transitions. [2024-11-11 20:40:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:40:13,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2024-11-11 20:40:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:13,294 INFO L225 Difference]: With dead ends: 1207 [2024-11-11 20:40:13,295 INFO L226 Difference]: Without dead ends: 717 [2024-11-11 20:40:13,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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-11-11 20:40:13,299 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1500 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 3412 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 3412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:13,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1338 Invalid, 3918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 3412 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 20:40:13,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-11 20:40:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 513. [2024-11-11 20:40:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 397 states have (on average 1.5465994962216625) internal successors, (614), 403 states have internal predecessors, (614), 85 states have call successors, (85), 28 states have call predecessors, (85), 30 states have return successors, (90), 83 states have call predecessors, (90), 84 states have call successors, (90) [2024-11-11 20:40:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 789 transitions. [2024-11-11 20:40:13,385 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 789 transitions. Word has length 120 [2024-11-11 20:40:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:13,386 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 789 transitions. [2024-11-11 20:40:13,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:40:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 789 transitions. [2024-11-11 20:40:13,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 20:40:13,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:13,389 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:13,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:40:13,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:13,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1406877538, now seen corresponding path program 2 times [2024-11-11 20:40:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:13,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039264204] [2024-11-11 20:40:13,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:13,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:40:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:40:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:40:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:40:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:40:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:40:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:40:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:40:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:40:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:13,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039264204] [2024-11-11 20:40:13,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039264204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:13,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:13,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:40:13,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570050313] [2024-11-11 20:40:13,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:13,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:40:13,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:13,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:40:13,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:40:13,543 INFO L87 Difference]: Start difference. First operand 513 states and 789 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:40:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:15,587 INFO L93 Difference]: Finished difference Result 1209 states and 1878 transitions. [2024-11-11 20:40:15,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:40:15,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-11-11 20:40:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:15,591 INFO L225 Difference]: With dead ends: 1209 [2024-11-11 20:40:15,592 INFO L226 Difference]: Without dead ends: 719 [2024-11-11 20:40:15,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:40:15,593 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1496 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 3399 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 3911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 3399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:15,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1338 Invalid, 3911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 3399 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 20:40:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-11 20:40:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 515. [2024-11-11 20:40:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 398 states have (on average 1.5452261306532664) internal successors, (615), 405 states have internal predecessors, (615), 85 states have call successors, (85), 28 states have call predecessors, (85), 31 states have return successors, (92), 83 states have call predecessors, (92), 84 states have call successors, (92) [2024-11-11 20:40:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 792 transitions. [2024-11-11 20:40:15,618 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 792 transitions. Word has length 121 [2024-11-11 20:40:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:15,618 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 792 transitions. [2024-11-11 20:40:15,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 20:40:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 792 transitions. [2024-11-11 20:40:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 20:40:15,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:15,620 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:15,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:40:15,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1329866986, now seen corresponding path program 1 times [2024-11-11 20:40:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:15,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242068827] [2024-11-11 20:40:15,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:15,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:40:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:40:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:40:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:40:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:40:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:40:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:40:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:40:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:15,838 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:40:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:15,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242068827] [2024-11-11 20:40:15,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242068827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:15,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:15,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:40:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153643576] [2024-11-11 20:40:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:15,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:40:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:15,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:40:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:40:15,840 INFO L87 Difference]: Start difference. First operand 515 states and 792 transitions. Second operand has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:40:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:18,761 INFO L93 Difference]: Finished difference Result 1207 states and 1873 transitions. [2024-11-11 20:40:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:40:18,761 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 122 [2024-11-11 20:40:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:18,767 INFO L225 Difference]: With dead ends: 1207 [2024-11-11 20:40:18,767 INFO L226 Difference]: Without dead ends: 719 [2024-11-11 20:40:18,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:40:18,772 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1500 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 5682 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 6200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 5682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:18,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1854 Invalid, 6200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 5682 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 20:40:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-11 20:40:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 515. [2024-11-11 20:40:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 398 states have (on average 1.5452261306532664) internal successors, (615), 405 states have internal predecessors, (615), 85 states have call successors, (85), 28 states have call predecessors, (85), 31 states have return successors, (91), 83 states have call predecessors, (91), 84 states have call successors, (91) [2024-11-11 20:40:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 791 transitions. [2024-11-11 20:40:18,799 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 791 transitions. Word has length 122 [2024-11-11 20:40:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:18,799 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 791 transitions. [2024-11-11 20:40:18,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:40:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 791 transitions. [2024-11-11 20:40:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 20:40:18,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:18,802 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:18,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:40:18,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:18,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash -418626466, now seen corresponding path program 2 times [2024-11-11 20:40:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:18,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173178027] [2024-11-11 20:40:18,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:18,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:18,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:18,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:18,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:40:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:40:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:19,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:40:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:19,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:40:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:19,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:40:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:19,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:40:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:19,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:40:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:19,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:40:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:40:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173178027] [2024-11-11 20:40:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173178027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:19,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:19,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:40:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241189467] [2024-11-11 20:40:19,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:19,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:40:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:19,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:40:19,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:40:19,060 INFO L87 Difference]: Start difference. First operand 515 states and 791 transitions. Second operand has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:40:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:21,954 INFO L93 Difference]: Finished difference Result 1209 states and 1879 transitions. [2024-11-11 20:40:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:40:21,954 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2024-11-11 20:40:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:21,958 INFO L225 Difference]: With dead ends: 1209 [2024-11-11 20:40:21,959 INFO L226 Difference]: Without dead ends: 721 [2024-11-11 20:40:21,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:40:21,961 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1491 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 5836 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 6326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 5836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:21,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1857 Invalid, 6326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 5836 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-11 20:40:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-11 20:40:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 517. [2024-11-11 20:40:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 399 states have (on average 1.543859649122807) internal successors, (616), 407 states have internal predecessors, (616), 85 states have call successors, (85), 28 states have call predecessors, (85), 32 states have return successors, (96), 83 states have call predecessors, (96), 84 states have call successors, (96) [2024-11-11 20:40:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 797 transitions. [2024-11-11 20:40:21,987 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 797 transitions. Word has length 123 [2024-11-11 20:40:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:21,987 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 797 transitions. [2024-11-11 20:40:21,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-11 20:40:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 797 transitions. [2024-11-11 20:40:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:40:21,989 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:21,989 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:21,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:40:21,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:21,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1643604795, now seen corresponding path program 1 times [2024-11-11 20:40:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:21,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555568360] [2024-11-11 20:40:21,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:40:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:40:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:40:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:40:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:40:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:40:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:40:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:40:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:22,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:22,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555568360] [2024-11-11 20:40:22,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555568360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635746791] [2024-11-11 20:40:22,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:22,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:22,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:22,123 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:22,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:40:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:22,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:40:22,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:22,395 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:22,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:40:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:22,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635746791] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:40:22,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:40:22,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-11 20:40:22,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387806386] [2024-11-11 20:40:22,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:40:22,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:40:22,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:22,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:40:22,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:40:22,489 INFO L87 Difference]: Start difference. First operand 517 states and 797 transitions. Second operand has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 7 states have internal predecessors, (120), 2 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-11 20:40:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:24,733 INFO L93 Difference]: Finished difference Result 1411 states and 2272 transitions. [2024-11-11 20:40:24,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:40:24,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 7 states have internal predecessors, (120), 2 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 124 [2024-11-11 20:40:24,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:24,740 INFO L225 Difference]: With dead ends: 1411 [2024-11-11 20:40:24,740 INFO L226 Difference]: Without dead ends: 1163 [2024-11-11 20:40:24,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 273 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-11-11 20:40:24,741 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1989 mSDsluCounter, 1392 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 677 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2043 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 4285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:24,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2043 Valid, 1650 Invalid, 4285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [677 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:40:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-11 20:40:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 935. [2024-11-11 20:40:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 738 states have (on average 1.6111111111111112) internal successors, (1189), 746 states have internal predecessors, (1189), 164 states have call successors, (164), 28 states have call predecessors, (164), 32 states have return successors, (185), 162 states have call predecessors, (185), 163 states have call successors, (185) [2024-11-11 20:40:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1538 transitions. [2024-11-11 20:40:24,779 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1538 transitions. Word has length 124 [2024-11-11 20:40:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:24,780 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1538 transitions. [2024-11-11 20:40:24,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 7 states have internal predecessors, (120), 2 states have call successors, (34), 6 states have call predecessors, (34), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-11 20:40:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1538 transitions. [2024-11-11 20:40:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 20:40:24,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:24,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:24,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 20:40:24,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:24,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:24,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:24,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1540379912, now seen corresponding path program 1 times [2024-11-11 20:40:24,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:24,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190806469] [2024-11-11 20:40:24,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:24,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:40:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:40:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:40:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:40:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:40:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:40:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:40:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:40:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:25,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:25,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190806469] [2024-11-11 20:40:25,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190806469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:25,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:25,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:25,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544463679] [2024-11-11 20:40:25,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:25,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:25,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:25,068 INFO L87 Difference]: Start difference. First operand 935 states and 1538 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:26,695 INFO L93 Difference]: Finished difference Result 2429 states and 4073 transitions. [2024-11-11 20:40:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:26,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-11-11 20:40:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:26,704 INFO L225 Difference]: With dead ends: 2429 [2024-11-11 20:40:26,704 INFO L226 Difference]: Without dead ends: 1562 [2024-11-11 20:40:26,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:40:26,707 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 1624 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:26,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 1006 Invalid, 2503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 20:40:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2024-11-11 20:40:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1350. [2024-11-11 20:40:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1074 states have (on average 1.6284916201117319) internal successors, (1749), 1082 states have internal predecessors, (1749), 243 states have call successors, (243), 28 states have call predecessors, (243), 32 states have return successors, (274), 241 states have call predecessors, (274), 242 states have call successors, (274) [2024-11-11 20:40:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2266 transitions. [2024-11-11 20:40:26,753 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2266 transitions. Word has length 130 [2024-11-11 20:40:26,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:26,753 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 2266 transitions. [2024-11-11 20:40:26,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2266 transitions. [2024-11-11 20:40:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:40:26,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:26,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:26,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:40:26,758 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:26,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1370544268, now seen corresponding path program 1 times [2024-11-11 20:40:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499308918] [2024-11-11 20:40:26,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:26,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:40:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:40:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:40:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:40:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:40:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:40:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:40:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:40:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:26,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499308918] [2024-11-11 20:40:26,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499308918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:26,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:26,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:26,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683993547] [2024-11-11 20:40:26,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:26,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:26,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:26,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:26,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:26,845 INFO L87 Difference]: Start difference. First operand 1350 states and 2266 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:28,620 INFO L93 Difference]: Finished difference Result 3443 states and 5851 transitions. [2024-11-11 20:40:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:28,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2024-11-11 20:40:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:28,632 INFO L225 Difference]: With dead ends: 3443 [2024-11-11 20:40:28,632 INFO L226 Difference]: Without dead ends: 2214 [2024-11-11 20:40:28,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:40:28,637 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 1620 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:28,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 1020 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:40:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2024-11-11 20:40:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2002. [2024-11-11 20:40:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 1607 states have (on average 1.6403235843186061) internal successors, (2636), 1615 states have internal predecessors, (2636), 362 states have call successors, (362), 28 states have call predecessors, (362), 32 states have return successors, (393), 360 states have call predecessors, (393), 361 states have call successors, (393) [2024-11-11 20:40:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 3391 transitions. [2024-11-11 20:40:28,702 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 3391 transitions. Word has length 131 [2024-11-11 20:40:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:28,703 INFO L471 AbstractCegarLoop]: Abstraction has 2002 states and 3391 transitions. [2024-11-11 20:40:28,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 3391 transitions. [2024-11-11 20:40:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 20:40:28,710 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:28,710 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:28,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:40:28,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:28,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash -441035802, now seen corresponding path program 1 times [2024-11-11 20:40:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:28,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118533643] [2024-11-11 20:40:28,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:40:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:40:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:40:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:40:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:40:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:40:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:40:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:40:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:28,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:28,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118533643] [2024-11-11 20:40:28,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118533643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:28,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:28,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:28,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450164837] [2024-11-11 20:40:28,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:28,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:28,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:28,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:28,827 INFO L87 Difference]: Start difference. First operand 2002 states and 3391 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:30,484 INFO L93 Difference]: Finished difference Result 4973 states and 8553 transitions. [2024-11-11 20:40:30,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:30,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2024-11-11 20:40:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:30,499 INFO L225 Difference]: With dead ends: 4973 [2024-11-11 20:40:30,499 INFO L226 Difference]: Without dead ends: 3217 [2024-11-11 20:40:30,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:40:30,505 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1621 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 2476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:30,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 982 Invalid, 2476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:40:30,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2024-11-11 20:40:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3005. [2024-11-11 20:40:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3005 states, 2448 states have (on average 1.6495098039215685) internal successors, (4038), 2456 states have internal predecessors, (4038), 524 states have call successors, (524), 28 states have call predecessors, (524), 32 states have return successors, (571), 522 states have call predecessors, (571), 523 states have call successors, (571) [2024-11-11 20:40:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 5133 transitions. [2024-11-11 20:40:30,597 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 5133 transitions. Word has length 132 [2024-11-11 20:40:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:30,598 INFO L471 AbstractCegarLoop]: Abstraction has 3005 states and 5133 transitions. [2024-11-11 20:40:30,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 5133 transitions. [2024-11-11 20:40:30,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 20:40:30,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:30,608 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:30,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:40:30,608 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:30,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1935415117, now seen corresponding path program 1 times [2024-11-11 20:40:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:30,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555922256] [2024-11-11 20:40:30,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:40:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:40:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:40:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:40:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:40:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:40:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:40:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:40:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:30,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:30,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555922256] [2024-11-11 20:40:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555922256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:30,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615137725] [2024-11-11 20:40:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:30,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:30,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:30,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:30,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:30,744 INFO L87 Difference]: Start difference. First operand 3005 states and 5133 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:32,379 INFO L93 Difference]: Finished difference Result 7397 states and 12842 transitions. [2024-11-11 20:40:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:32,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2024-11-11 20:40:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:32,402 INFO L225 Difference]: With dead ends: 7397 [2024-11-11 20:40:32,403 INFO L226 Difference]: Without dead ends: 4842 [2024-11-11 20:40:32,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:40:32,412 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1619 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:32,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 984 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:40:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4842 states. [2024-11-11 20:40:32,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4842 to 4630. [2024-11-11 20:40:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 3828 states have (on average 1.6559561128526645) internal successors, (6339), 3836 states have internal predecessors, (6339), 769 states have call successors, (769), 28 states have call predecessors, (769), 32 states have return successors, (842), 767 states have call predecessors, (842), 768 states have call successors, (842) [2024-11-11 20:40:32,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 7950 transitions. [2024-11-11 20:40:32,607 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 7950 transitions. Word has length 133 [2024-11-11 20:40:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:32,607 INFO L471 AbstractCegarLoop]: Abstraction has 4630 states and 7950 transitions. [2024-11-11 20:40:32,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 7950 transitions. [2024-11-11 20:40:32,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-11 20:40:32,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:32,618 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:32,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:40:32,619 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:32,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:32,619 INFO L85 PathProgramCache]: Analyzing trace with hash -85827862, now seen corresponding path program 1 times [2024-11-11 20:40:32,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:32,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191572600] [2024-11-11 20:40:32,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:32,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:40:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:40:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:40:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:40:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:40:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:40:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:40:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 20:40:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:32,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:32,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191572600] [2024-11-11 20:40:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191572600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:32,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206513880] [2024-11-11 20:40:32,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:32,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:32,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:32,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:32,709 INFO L87 Difference]: Start difference. First operand 4630 states and 7950 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:34,450 INFO L93 Difference]: Finished difference Result 11443 states and 20002 transitions. [2024-11-11 20:40:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:34,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2024-11-11 20:40:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:34,482 INFO L225 Difference]: With dead ends: 11443 [2024-11-11 20:40:34,483 INFO L226 Difference]: Without dead ends: 7575 [2024-11-11 20:40:34,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:40:34,494 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 1619 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:34,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 1042 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 1950 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:40:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7575 states. [2024-11-11 20:40:34,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7575 to 7363. [2024-11-11 20:40:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7363 states, 6068 states have (on average 1.6552406064601186) internal successors, (10044), 6076 states have internal predecessors, (10044), 1262 states have call successors, (1262), 28 states have call predecessors, (1262), 32 states have return successors, (1379), 1260 states have call predecessors, (1379), 1261 states have call successors, (1379) [2024-11-11 20:40:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7363 states to 7363 states and 12685 transitions. [2024-11-11 20:40:34,737 INFO L78 Accepts]: Start accepts. Automaton has 7363 states and 12685 transitions. Word has length 134 [2024-11-11 20:40:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:34,738 INFO L471 AbstractCegarLoop]: Abstraction has 7363 states and 12685 transitions. [2024-11-11 20:40:34,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 7363 states and 12685 transitions. [2024-11-11 20:40:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-11 20:40:34,756 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:34,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:34,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:40:34,757 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:34,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1324121681, now seen corresponding path program 1 times [2024-11-11 20:40:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:34,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509350829] [2024-11-11 20:40:34,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:34,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:40:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:40:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:40:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:40:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:40:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:40:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:40:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,925 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:34,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:34,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509350829] [2024-11-11 20:40:34,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509350829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:34,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:34,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:34,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659312695] [2024-11-11 20:40:34,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:34,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:34,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:34,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:34,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:34,927 INFO L87 Difference]: Start difference. First operand 7363 states and 12685 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:36,568 INFO L93 Difference]: Finished difference Result 18778 states and 32886 transitions. [2024-11-11 20:40:36,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:36,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2024-11-11 20:40:36,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:36,614 INFO L225 Difference]: With dead ends: 18778 [2024-11-11 20:40:36,614 INFO L226 Difference]: Without dead ends: 12554 [2024-11-11 20:40:36,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:40:36,733 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1615 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:36,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1633 Valid, 983 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 1909 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:40:36,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12554 states. [2024-11-11 20:40:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12554 to 12342. [2024-11-11 20:40:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12342 states, 10225 states have (on average 1.6561369193154034) internal successors, (16934), 10233 states have internal predecessors, (16934), 2084 states have call successors, (2084), 28 states have call predecessors, (2084), 32 states have return successors, (2279), 2082 states have call predecessors, (2279), 2083 states have call successors, (2279) [2024-11-11 20:40:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12342 states to 12342 states and 21297 transitions. [2024-11-11 20:40:37,087 INFO L78 Accepts]: Start accepts. Automaton has 12342 states and 21297 transitions. Word has length 135 [2024-11-11 20:40:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:37,087 INFO L471 AbstractCegarLoop]: Abstraction has 12342 states and 21297 transitions. [2024-11-11 20:40:37,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 12342 states and 21297 transitions. [2024-11-11 20:40:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-11 20:40:37,141 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:37,141 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:37,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:40:37,142 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:37,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1826345980, now seen corresponding path program 1 times [2024-11-11 20:40:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381480759] [2024-11-11 20:40:37,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:40:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:40:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:40:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:40:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:40:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:40:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:40:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 20:40:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:37,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:37,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381480759] [2024-11-11 20:40:37,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381480759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:37,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:37,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:37,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632692581] [2024-11-11 20:40:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:37,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:37,328 INFO L87 Difference]: Start difference. First operand 12342 states and 21297 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:39,208 INFO L93 Difference]: Finished difference Result 29736 states and 51851 transitions. [2024-11-11 20:40:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:39,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2024-11-11 20:40:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:39,267 INFO L225 Difference]: With dead ends: 29736 [2024-11-11 20:40:39,268 INFO L226 Difference]: Without dead ends: 19507 [2024-11-11 20:40:39,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:40:39,290 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1613 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:39,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 957 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:40:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19507 states. [2024-11-11 20:40:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19507 to 19295. [2024-11-11 20:40:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19295 states, 15975 states have (on average 1.632300469483568) internal successors, (26076), 15983 states have internal predecessors, (26076), 3287 states have call successors, (3287), 28 states have call predecessors, (3287), 32 states have return successors, (3626), 3285 states have call predecessors, (3626), 3286 states have call successors, (3626) [2024-11-11 20:40:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19295 states to 19295 states and 32989 transitions. [2024-11-11 20:40:40,036 INFO L78 Accepts]: Start accepts. Automaton has 19295 states and 32989 transitions. Word has length 136 [2024-11-11 20:40:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:40,037 INFO L471 AbstractCegarLoop]: Abstraction has 19295 states and 32989 transitions. [2024-11-11 20:40:40,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 19295 states and 32989 transitions. [2024-11-11 20:40:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 20:40:40,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:40,063 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:40,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:40:40,064 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:40,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1323587022, now seen corresponding path program 1 times [2024-11-11 20:40:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:40,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396557300] [2024-11-11 20:40:40,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:40:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:40:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:40:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:40:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:40:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:40:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:40:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 20:40:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:40,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:40,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396557300] [2024-11-11 20:40:40,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396557300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:40,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:40,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580605780] [2024-11-11 20:40:40,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:40,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:40,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:40,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:40,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:40,201 INFO L87 Difference]: Start difference. First operand 19295 states and 32989 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:42,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:42,657 INFO L93 Difference]: Finished difference Result 51168 states and 88971 transitions. [2024-11-11 20:40:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:42,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2024-11-11 20:40:42,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:42,769 INFO L225 Difference]: With dead ends: 51168 [2024-11-11 20:40:42,769 INFO L226 Difference]: Without dead ends: 34628 [2024-11-11 20:40:42,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:40:42,803 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1613 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:42,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 981 Invalid, 2475 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [578 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:40:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34628 states. [2024-11-11 20:40:43,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34628 to 34416. [2024-11-11 20:40:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34416 states, 28646 states have (on average 1.6295119737485164) internal successors, (46679), 28654 states have internal predecessors, (46679), 5737 states have call successors, (5737), 28 states have call predecessors, (5737), 32 states have return successors, (6350), 5735 states have call predecessors, (6350), 5736 states have call successors, (6350) [2024-11-11 20:40:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34416 states to 34416 states and 58766 transitions. [2024-11-11 20:40:43,760 INFO L78 Accepts]: Start accepts. Automaton has 34416 states and 58766 transitions. Word has length 137 [2024-11-11 20:40:43,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:43,761 INFO L471 AbstractCegarLoop]: Abstraction has 34416 states and 58766 transitions. [2024-11-11 20:40:43,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 34416 states and 58766 transitions. [2024-11-11 20:40:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 20:40:43,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:43,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:43,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:40:43,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:43,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1707214946, now seen corresponding path program 1 times [2024-11-11 20:40:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:43,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162520376] [2024-11-11 20:40:43,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:43,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:40:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:40:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:40:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:40:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:40:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:40:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:40:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 20:40:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162520376] [2024-11-11 20:40:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162520376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:43,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501348270] [2024-11-11 20:40:43,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:43,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:43,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:43,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:43,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:43,871 INFO L87 Difference]: Start difference. First operand 34416 states and 58766 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:47,065 INFO L93 Difference]: Finished difference Result 94040 states and 162765 transitions. [2024-11-11 20:40:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:47,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2024-11-11 20:40:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:47,550 INFO L225 Difference]: With dead ends: 94040 [2024-11-11 20:40:47,550 INFO L226 Difference]: Without dead ends: 63295 [2024-11-11 20:40:47,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:40:47,790 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1610 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:47,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 1015 Invalid, 2490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 20:40:47,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63295 states. [2024-11-11 20:40:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63295 to 63083. [2024-11-11 20:40:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63083 states, 52800 states have (on average 1.6255681818181817) internal successors, (85830), 52808 states have internal predecessors, (85830), 10250 states have call successors, (10250), 28 states have call predecessors, (10250), 32 states have return successors, (11395), 10248 states have call predecessors, (11395), 10249 states have call successors, (11395) [2024-11-11 20:40:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63083 states to 63083 states and 107475 transitions. [2024-11-11 20:40:49,889 INFO L78 Accepts]: Start accepts. Automaton has 63083 states and 107475 transitions. Word has length 138 [2024-11-11 20:40:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:49,890 INFO L471 AbstractCegarLoop]: Abstraction has 63083 states and 107475 transitions. [2024-11-11 20:40:49,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 63083 states and 107475 transitions. [2024-11-11 20:40:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 20:40:49,922 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:49,922 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:49,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:40:49,923 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:49,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash 659514862, now seen corresponding path program 1 times [2024-11-11 20:40:49,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:49,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247994046] [2024-11-11 20:40:49,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:49,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:40:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:40:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:40:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:40:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:40:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:40:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:40:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 20:40:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:50,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:50,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247994046] [2024-11-11 20:40:50,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247994046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:50,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:50,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:50,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365347025] [2024-11-11 20:40:50,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:50,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:50,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:50,423 INFO L87 Difference]: Start difference. First operand 63083 states and 107475 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:53,858 INFO L93 Difference]: Finished difference Result 118416 states and 205399 transitions. [2024-11-11 20:40:53,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:53,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2024-11-11 20:40:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:54,445 INFO L225 Difference]: With dead ends: 118416 [2024-11-11 20:40:54,445 INFO L226 Difference]: Without dead ends: 118168 [2024-11-11 20:40:54,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11-11 20:40:54,486 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1604 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 2490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:54,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 991 Invalid, 2490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 1916 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 20:40:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118168 states. [2024-11-11 20:40:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118168 to 117956. [2024-11-11 20:40:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117956 states, 99305 states have (on average 1.620472282362419) internal successors, (160921), 99313 states have internal predecessors, (160921), 18618 states have call successors, (18618), 28 states have call predecessors, (18618), 32 states have return successors, (20809), 18616 states have call predecessors, (20809), 18617 states have call successors, (20809) [2024-11-11 20:40:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117956 states to 117956 states and 200348 transitions. [2024-11-11 20:40:58,519 INFO L78 Accepts]: Start accepts. Automaton has 117956 states and 200348 transitions. Word has length 139 [2024-11-11 20:40:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:58,520 INFO L471 AbstractCegarLoop]: Abstraction has 117956 states and 200348 transitions. [2024-11-11 20:40:58,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:40:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 117956 states and 200348 transitions. [2024-11-11 20:40:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 20:40:58,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:58,634 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:58,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:40:58,635 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:58,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1448323133, now seen corresponding path program 1 times [2024-11-11 20:40:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:58,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598763398] [2024-11-11 20:40:58,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:58,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:58,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:58,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:58,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:58,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:58,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:58,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:40:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:58,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:40:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:40:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:40:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:40:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:40:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:40:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:59,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:59,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598763398] [2024-11-11 20:40:59,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598763398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:59,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:59,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-11 20:40:59,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306036330] [2024-11-11 20:40:59,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:59,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 20:40:59,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:59,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 20:40:59,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:40:59,058 INFO L87 Difference]: Start difference. First operand 117956 states and 200348 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-11 20:41:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:11,884 INFO L93 Difference]: Finished difference Result 236069 states and 412819 transitions. [2024-11-11 20:41:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-11 20:41:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 140 [2024-11-11 20:41:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:13,167 INFO L225 Difference]: With dead ends: 236069 [2024-11-11 20:41:13,168 INFO L226 Difference]: Without dead ends: 235827 [2024-11-11 20:41:13,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=900, Invalid=4070, Unknown=0, NotChecked=0, Total=4970 [2024-11-11 20:41:13,264 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 5940 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 12270 mSolverCounterSat, 2231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5940 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 14501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2231 IncrementalHoareTripleChecker+Valid, 12270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:13,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5940 Valid, 3457 Invalid, 14501 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2231 Valid, 12270 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-11 20:41:13,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235827 states. [2024-11-11 20:41:20,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235827 to 235016. [2024-11-11 20:41:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235016 states, 197892 states have (on average 1.620833585996402) internal successors, (320750), 197802 states have internal predecessors, (320750), 37037 states have call successors, (37037), 75 states have call predecessors, (37037), 86 states have return successors, (44719), 37146 states have call predecessors, (44719), 37034 states have call successors, (44719) [2024-11-11 20:41:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235016 states to 235016 states and 402506 transitions. [2024-11-11 20:41:21,675 INFO L78 Accepts]: Start accepts. Automaton has 235016 states and 402506 transitions. Word has length 140 [2024-11-11 20:41:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:21,676 INFO L471 AbstractCegarLoop]: Abstraction has 235016 states and 402506 transitions. [2024-11-11 20:41:21,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 12 states have internal predecessors, (96), 6 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-11-11 20:41:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 235016 states and 402506 transitions. [2024-11-11 20:41:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 20:41:21,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:21,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:21,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:41:21,759 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:21,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:21,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1751796690, now seen corresponding path program 1 times [2024-11-11 20:41:21,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:21,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281035269] [2024-11-11 20:41:21,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:21,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:41:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:41:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:41:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:41:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:23,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:41:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:23,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:41:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 20:41:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 20:41:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:23,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-11-11 20:41:23,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:23,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281035269] [2024-11-11 20:41:23,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281035269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:23,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:23,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-11 20:41:23,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436270003] [2024-11-11 20:41:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:23,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 20:41:23,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:23,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 20:41:23,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:41:23,095 INFO L87 Difference]: Start difference. First operand 235016 states and 402506 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 9 states have internal predecessors, (97), 6 states have call successors, (17), 8 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14)