/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 05:54:06,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 05:54:06,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 05:54:06,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 05:54:06,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 05:54:06,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 05:54:06,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 05:54:06,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 05:54:06,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 05:54:06,804 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 05:54:06,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 05:54:06,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 05:54:06,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 05:54:06,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 05:54:06,806 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 05:54:06,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 05:54:06,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 05:54:06,807 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 05:54:06,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 05:54:06,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 05:54:06,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 05:54:06,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 05:54:06,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 05:54:06,808 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 05:54:06,808 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 05:54:06,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 05:54:06,809 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 05:54:06,809 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 05:54:06,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 05:54:06,809 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 05:54:06,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 05:54:06,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 05:54:06,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 05:54:06,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 05:54:06,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:54:06,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 05:54:06,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 05:54:06,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 05:54:06,811 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 05:54:06,811 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 05:54:06,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 05:54:06,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 05:54:06,812 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 05:54:06,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 05:54:06,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 05:54:06,812 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 05:54:06,812 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 [2023-12-25 05:54:07,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 05:54:07,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 05:54:07,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 05:54:07,026 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 05:54:07,028 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 05:54:07,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c [2023-12-25 05:54:08,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 05:54:08,376 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 05:54:08,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c [2023-12-25 05:54:08,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897e79703/f2e8925bfc5a4a4cabc5c8d4460a91e1/FLAG4d9fa7c5e [2023-12-25 05:54:08,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897e79703/f2e8925bfc5a4a4cabc5c8d4460a91e1 [2023-12-25 05:54:08,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 05:54:08,413 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 05:54:08,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 05:54:08,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 05:54:08,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 05:54:08,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:54:08" (1/1) ... [2023-12-25 05:54:08,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f315904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:08, skipping insertion in model container [2023-12-25 05:54:08,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:54:08" (1/1) ... [2023-12-25 05:54:08,480 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 05:54:08,710 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c[10988,11001] [2023-12-25 05:54:08,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:54:08,874 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-25 05:54:08,887 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 05:54:08,907 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c[10988,11001] [2023-12-25 05:54:08,970 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:54:08,985 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 05:54:08,992 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2023-12-25 05:54:08,993 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [380] [2023-12-25 05:54:08,993 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [528] [2023-12-25 05:54:08,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [547] [2023-12-25 05:54:08,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [556] [2023-12-25 05:54:08,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [922] [2023-12-25 05:54:08,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1324] [2023-12-25 05:54:08,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1359] [2023-12-25 05:54:08,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2428] [2023-12-25 05:54:08,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2445] [2023-12-25 05:54:08,994 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2842] [2023-12-25 05:54:09,011 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c[10988,11001] [2023-12-25 05:54:09,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:54:09,115 INFO L206 MainTranslator]: Completed translation [2023-12-25 05:54:09,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09 WrapperNode [2023-12-25 05:54:09,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 05:54:09,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 05:54:09,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 05:54:09,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 05:54:09,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,196 INFO L138 Inliner]: procedures = 136, calls = 218, calls flagged for inlining = 62, calls inlined = 59, statements flattened = 1017 [2023-12-25 05:54:09,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 05:54:09,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 05:54:09,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 05:54:09,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 05:54:09,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,238 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]. [2023-12-25 05:54:09,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,276 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 05:54:09,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 05:54:09,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 05:54:09,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 05:54:09,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (1/1) ... [2023-12-25 05:54:09,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:54:09,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 05:54:09,313 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) [2023-12-25 05:54:09,332 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 [2023-12-25 05:54:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2023-12-25 05:54:09,348 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2023-12-25 05:54:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2023-12-25 05:54:09,348 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2023-12-25 05:54:09,348 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2023-12-25 05:54:09,348 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2023-12-25 05:54:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2023-12-25 05:54:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2023-12-25 05:54:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2023-12-25 05:54:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2023-12-25 05:54:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2023-12-25 05:54:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2023-12-25 05:54:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2023-12-25 05:54:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2023-12-25 05:54:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2023-12-25 05:54:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2023-12-25 05:54:09,349 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2023-12-25 05:54:09,349 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2023-12-25 05:54:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2023-12-25 05:54:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2023-12-25 05:54:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2023-12-25 05:54:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2023-12-25 05:54:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2023-12-25 05:54:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2023-12-25 05:54:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2023-12-25 05:54:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2023-12-25 05:54:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2023-12-25 05:54:09,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2023-12-25 05:54:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 05:54:09,350 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2023-12-25 05:54:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2023-12-25 05:54:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2023-12-25 05:54:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2023-12-25 05:54:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2023-12-25 05:54:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2023-12-25 05:54:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2023-12-25 05:54:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2023-12-25 05:54:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2023-12-25 05:54:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2023-12-25 05:54:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2023-12-25 05:54:09,351 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2023-12-25 05:54:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 05:54:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 05:54:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-25 05:54:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-25 05:54:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2023-12-25 05:54:09,352 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2023-12-25 05:54:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2023-12-25 05:54:09,352 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2023-12-25 05:54:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2023-12-25 05:54:09,352 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2023-12-25 05:54:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2023-12-25 05:54:09,352 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2023-12-25 05:54:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2023-12-25 05:54:09,353 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2023-12-25 05:54:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2023-12-25 05:54:09,353 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2023-12-25 05:54:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2023-12-25 05:54:09,353 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2023-12-25 05:54:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2023-12-25 05:54:09,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2023-12-25 05:54:09,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 05:54:09,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 05:54:09,528 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 05:54:09,530 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 05:54:10,331 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 05:54:10,402 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 05:54:10,402 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 05:54:10,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:54:10 BoogieIcfgContainer [2023-12-25 05:54:10,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 05:54:10,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 05:54:10,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 05:54:10,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 05:54:10,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 05:54:08" (1/3) ... [2023-12-25 05:54:10,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f7b859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:54:10, skipping insertion in model container [2023-12-25 05:54:10,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:54:09" (2/3) ... [2023-12-25 05:54:10,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f7b859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:54:10, skipping insertion in model container [2023-12-25 05:54:10,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:54:10" (3/3) ... [2023-12-25 05:54:10,412 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product34.cil.c [2023-12-25 05:54:10,425 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 05:54:10,425 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 05:54:10,478 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 05:54:10,483 INFO L357 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, mHoare=true, 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;@5061f2e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 05:54:10,483 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 05:54:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 412 states, 312 states have (on average 1.5929487179487178) internal successors, (497), 317 states have internal predecessors, (497), 70 states have call successors, (70), 28 states have call predecessors, (70), 28 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-25 05:54:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-25 05:54:10,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:10,523 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:10,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:10,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1491379960, now seen corresponding path program 1 times [2023-12-25 05:54:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:10,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518789753] [2023-12-25 05:54:10,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:10,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:10,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:10,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:10,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 05:54:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:10,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 05:54:10,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-25 05:54:10,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:10,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:10,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518789753] [2023-12-25 05:54:10,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518789753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:10,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 05:54:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152233493] [2023-12-25 05:54:10,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:10,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 05:54:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:10,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 05:54:10,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 05:54:10,925 INFO L87 Difference]: Start difference. First operand has 412 states, 312 states have (on average 1.5929487179487178) internal successors, (497), 317 states have internal predecessors, (497), 70 states have call successors, (70), 28 states have call predecessors, (70), 28 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:11,034 INFO L93 Difference]: Finished difference Result 640 states and 973 transitions. [2023-12-25 05:54:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 05:54:11,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2023-12-25 05:54:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:11,050 INFO L225 Difference]: With dead ends: 640 [2023-12-25 05:54:11,050 INFO L226 Difference]: Without dead ends: 409 [2023-12-25 05:54:11,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 05:54:11,057 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:11,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-12-25 05:54:11,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2023-12-25 05:54:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 310 states have (on average 1.5806451612903225) internal successors, (490), 314 states have internal predecessors, (490), 70 states have call successors, (70), 28 states have call predecessors, (70), 28 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2023-12-25 05:54:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 629 transitions. [2023-12-25 05:54:11,121 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 629 transitions. Word has length 141 [2023-12-25 05:54:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:11,122 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 629 transitions. [2023-12-25 05:54:11,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 629 transitions. [2023-12-25 05:54:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-25 05:54:11,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:11,128 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:11,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 05:54:11,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:11,336 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:11,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash -366913925, now seen corresponding path program 1 times [2023-12-25 05:54:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:11,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191660476] [2023-12-25 05:54:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:11,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:11,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:11,339 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:11,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 05:54:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:11,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 05:54:11,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-25 05:54:11,706 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:11,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:11,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191660476] [2023-12-25 05:54:11,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191660476] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:11,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:11,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:54:11,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088953201] [2023-12-25 05:54:11,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:11,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:54:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:11,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:54:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:54:11,708 INFO L87 Difference]: Start difference. First operand 409 states and 629 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-25 05:54:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:11,905 INFO L93 Difference]: Finished difference Result 813 states and 1252 transitions. [2023-12-25 05:54:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:54:11,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 124 [2023-12-25 05:54:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:11,913 INFO L225 Difference]: With dead ends: 813 [2023-12-25 05:54:11,913 INFO L226 Difference]: Without dead ends: 411 [2023-12-25 05:54:11,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:54:11,918 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 8 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:11,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2401 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 05:54:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-25 05:54:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2023-12-25 05:54:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 311 states have (on average 1.5787781350482315) internal successors, (491), 316 states have internal predecessors, (491), 70 states have call successors, (70), 28 states have call predecessors, (70), 29 states have return successors, (71), 68 states have call predecessors, (71), 69 states have call successors, (71) [2023-12-25 05:54:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 632 transitions. [2023-12-25 05:54:11,962 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 632 transitions. Word has length 124 [2023-12-25 05:54:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:11,963 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 632 transitions. [2023-12-25 05:54:11,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-25 05:54:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2023-12-25 05:54:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-25 05:54:11,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:11,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:11,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:12,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:12,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:12,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash 196840547, now seen corresponding path program 1 times [2023-12-25 05:54:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806854514] [2023-12-25 05:54:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:12,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:12,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:12,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:12,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 05:54:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:12,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 05:54:12,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-25 05:54:12,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:12,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806854514] [2023-12-25 05:54:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806854514] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:12,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:12,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:54:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344682788] [2023-12-25 05:54:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:12,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:54:12,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:12,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:54:12,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:54:12,462 INFO L87 Difference]: Start difference. First operand 411 states and 632 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-25 05:54:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:12,581 INFO L93 Difference]: Finished difference Result 815 states and 1256 transitions. [2023-12-25 05:54:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:54:12,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 125 [2023-12-25 05:54:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:12,584 INFO L225 Difference]: With dead ends: 815 [2023-12-25 05:54:12,584 INFO L226 Difference]: Without dead ends: 413 [2023-12-25 05:54:12,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:54:12,586 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 8 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:12,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2387 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 05:54:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-12-25 05:54:12,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2023-12-25 05:54:12,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 312 states have (on average 1.5769230769230769) internal successors, (492), 318 states have internal predecessors, (492), 70 states have call successors, (70), 28 states have call predecessors, (70), 30 states have return successors, (75), 68 states have call predecessors, (75), 69 states have call successors, (75) [2023-12-25 05:54:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 637 transitions. [2023-12-25 05:54:12,621 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 637 transitions. Word has length 125 [2023-12-25 05:54:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:12,621 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 637 transitions. [2023-12-25 05:54:12,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-25 05:54:12,622 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 637 transitions. [2023-12-25 05:54:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-25 05:54:12,623 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:12,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:12,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:12,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:12,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:12,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1589880326, now seen corresponding path program 1 times [2023-12-25 05:54:12,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420835715] [2023-12-25 05:54:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:12,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:12,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:12,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:12,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 05:54:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:13,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 05:54:13,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 05:54:13,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:13,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420835715] [2023-12-25 05:54:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420835715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:13,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:54:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594828089] [2023-12-25 05:54:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:13,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:54:13,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:13,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:54:13,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:54:13,093 INFO L87 Difference]: Start difference. First operand 413 states and 637 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-25 05:54:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:13,188 INFO L93 Difference]: Finished difference Result 807 states and 1246 transitions. [2023-12-25 05:54:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:54:13,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 126 [2023-12-25 05:54:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:13,191 INFO L225 Difference]: With dead ends: 807 [2023-12-25 05:54:13,191 INFO L226 Difference]: Without dead ends: 413 [2023-12-25 05:54:13,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:54:13,196 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 8 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:13,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2401 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 05:54:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-12-25 05:54:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2023-12-25 05:54:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 312 states have (on average 1.5769230769230769) internal successors, (492), 318 states have internal predecessors, (492), 70 states have call successors, (70), 28 states have call predecessors, (70), 30 states have return successors, (74), 68 states have call predecessors, (74), 69 states have call successors, (74) [2023-12-25 05:54:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 636 transitions. [2023-12-25 05:54:13,210 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 636 transitions. Word has length 126 [2023-12-25 05:54:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:13,210 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 636 transitions. [2023-12-25 05:54:13,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-25 05:54:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 636 transitions. [2023-12-25 05:54:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-25 05:54:13,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:13,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:13,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 05:54:13,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:13,420 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:13,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash -635862149, now seen corresponding path program 1 times [2023-12-25 05:54:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:13,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655252164] [2023-12-25 05:54:13,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:13,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:13,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:13,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:13,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 05:54:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:13,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 05:54:13,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-25 05:54:13,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:13,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:13,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655252164] [2023-12-25 05:54:13,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655252164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:13,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:13,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:54:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742388778] [2023-12-25 05:54:13,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:13,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:54:13,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:13,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:54:13,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:54:13,682 INFO L87 Difference]: Start difference. First operand 413 states and 636 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-25 05:54:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:13,774 INFO L93 Difference]: Finished difference Result 809 states and 1249 transitions. [2023-12-25 05:54:13,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:54:13,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 145 [2023-12-25 05:54:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:13,777 INFO L225 Difference]: With dead ends: 809 [2023-12-25 05:54:13,777 INFO L226 Difference]: Without dead ends: 415 [2023-12-25 05:54:13,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:54:13,779 INFO L413 NwaCegarLoop]: 604 mSDtfsCounter, 6 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2403 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:13,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2403 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 05:54:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-25 05:54:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2023-12-25 05:54:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 313 states have (on average 1.5750798722044728) internal successors, (493), 320 states have internal predecessors, (493), 70 states have call successors, (70), 28 states have call predecessors, (70), 31 states have return successors, (76), 68 states have call predecessors, (76), 69 states have call successors, (76) [2023-12-25 05:54:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 639 transitions. [2023-12-25 05:54:13,791 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 639 transitions. Word has length 145 [2023-12-25 05:54:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:13,792 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 639 transitions. [2023-12-25 05:54:13,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-25 05:54:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 639 transitions. [2023-12-25 05:54:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-25 05:54:13,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:13,794 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:13,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:14,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:14,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:14,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:14,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1829916255, now seen corresponding path program 1 times [2023-12-25 05:54:14,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:14,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155395045] [2023-12-25 05:54:14,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:14,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:14,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:14,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:14,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 05:54:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:14,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 05:54:14,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 05:54:14,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:14,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155395045] [2023-12-25 05:54:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155395045] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:14,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:14,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:54:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494515606] [2023-12-25 05:54:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:14,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:54:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:54:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:54:14,255 INFO L87 Difference]: Start difference. First operand 415 states and 639 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-25 05:54:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:14,346 INFO L93 Difference]: Finished difference Result 811 states and 1252 transitions. [2023-12-25 05:54:14,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:54:14,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 128 [2023-12-25 05:54:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:14,349 INFO L225 Difference]: With dead ends: 811 [2023-12-25 05:54:14,349 INFO L226 Difference]: Without dead ends: 417 [2023-12-25 05:54:14,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:54:14,351 INFO L413 NwaCegarLoop]: 603 mSDtfsCounter, 6 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:14,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2401 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 05:54:14,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-12-25 05:54:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 415. [2023-12-25 05:54:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 313 states have (on average 1.5750798722044728) internal successors, (493), 320 states have internal predecessors, (493), 70 states have call successors, (70), 28 states have call predecessors, (70), 31 states have return successors, (76), 68 states have call predecessors, (76), 69 states have call successors, (76) [2023-12-25 05:54:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 639 transitions. [2023-12-25 05:54:14,361 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 639 transitions. Word has length 128 [2023-12-25 05:54:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:14,361 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 639 transitions. [2023-12-25 05:54:14,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2023-12-25 05:54:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 639 transitions. [2023-12-25 05:54:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-25 05:54:14,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:14,363 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:14,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:14,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:14,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:14,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:14,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1244968884, now seen corresponding path program 1 times [2023-12-25 05:54:14,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:14,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853076108] [2023-12-25 05:54:14,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:14,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:14,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:14,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:14,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 05:54:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:14,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 05:54:14,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-12-25 05:54:14,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:14,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:14,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853076108] [2023-12-25 05:54:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853076108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:14,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:14,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:54:14,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67477242] [2023-12-25 05:54:14,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:14,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:54:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:14,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:54:14,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:54:14,852 INFO L87 Difference]: Start difference. First operand 415 states and 639 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-25 05:54:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:14,947 INFO L93 Difference]: Finished difference Result 807 states and 1244 transitions. [2023-12-25 05:54:14,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:54:14,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 146 [2023-12-25 05:54:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:14,972 INFO L225 Difference]: With dead ends: 807 [2023-12-25 05:54:14,972 INFO L226 Difference]: Without dead ends: 415 [2023-12-25 05:54:14,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:54:14,974 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 8 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2388 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:14,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2388 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 05:54:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-25 05:54:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2023-12-25 05:54:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 313 states have (on average 1.5750798722044728) internal successors, (493), 320 states have internal predecessors, (493), 70 states have call successors, (70), 28 states have call predecessors, (70), 31 states have return successors, (75), 68 states have call predecessors, (75), 69 states have call successors, (75) [2023-12-25 05:54:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 638 transitions. [2023-12-25 05:54:14,987 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 638 transitions. Word has length 146 [2023-12-25 05:54:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:14,988 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 638 transitions. [2023-12-25 05:54:14,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-25 05:54:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 638 transitions. [2023-12-25 05:54:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-25 05:54:14,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:14,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:14,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:15,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:15,197 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:15,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2010284529, now seen corresponding path program 2 times [2023-12-25 05:54:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648495136] [2023-12-25 05:54:15,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 05:54:15,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:15,199 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:15,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 05:54:15,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-25 05:54:15,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:54:15,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:15,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:54:15,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:15,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:15,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648495136] [2023-12-25 05:54:15,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648495136] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:15,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:15,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:15,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223472086] [2023-12-25 05:54:15,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:15,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:15,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:15,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:15,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:15,408 INFO L87 Difference]: Start difference. First operand 415 states and 638 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:15,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:15,455 INFO L93 Difference]: Finished difference Result 642 states and 966 transitions. [2023-12-25 05:54:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:15,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 147 [2023-12-25 05:54:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:15,459 INFO L225 Difference]: With dead ends: 642 [2023-12-25 05:54:15,459 INFO L226 Difference]: Without dead ends: 417 [2023-12-25 05:54:15,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:15,461 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 0 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:15,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1223 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-12-25 05:54:15,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2023-12-25 05:54:15,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 315 states have (on average 1.5714285714285714) internal successors, (495), 322 states have internal predecessors, (495), 70 states have call successors, (70), 28 states have call predecessors, (70), 31 states have return successors, (75), 68 states have call predecessors, (75), 69 states have call successors, (75) [2023-12-25 05:54:15,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 640 transitions. [2023-12-25 05:54:15,473 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 640 transitions. Word has length 147 [2023-12-25 05:54:15,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:15,474 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 640 transitions. [2023-12-25 05:54:15,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:15,474 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 640 transitions. [2023-12-25 05:54:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 05:54:15,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:15,476 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:15,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:15,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:15,683 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:15,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash -52545996, now seen corresponding path program 1 times [2023-12-25 05:54:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869978736] [2023-12-25 05:54:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:15,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:15,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:15,686 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:15,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 05:54:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:15,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 05:54:15,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 05:54:15,954 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:15,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:15,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869978736] [2023-12-25 05:54:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869978736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:15,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:15,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:54:15,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399903288] [2023-12-25 05:54:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:15,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:54:15,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:15,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:54:15,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:54:15,956 INFO L87 Difference]: Start difference. First operand 417 states and 640 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-25 05:54:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:16,080 INFO L93 Difference]: Finished difference Result 813 states and 1253 transitions. [2023-12-25 05:54:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:54:16,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 152 [2023-12-25 05:54:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:16,083 INFO L225 Difference]: With dead ends: 813 [2023-12-25 05:54:16,083 INFO L226 Difference]: Without dead ends: 419 [2023-12-25 05:54:16,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:54:16,086 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 6 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:16,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2390 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 05:54:16,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-25 05:54:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-25 05:54:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 316 states have (on average 1.5696202531645569) internal successors, (496), 324 states have internal predecessors, (496), 70 states have call successors, (70), 28 states have call predecessors, (70), 32 states have return successors, (79), 68 states have call predecessors, (79), 69 states have call successors, (79) [2023-12-25 05:54:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 645 transitions. [2023-12-25 05:54:16,098 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 645 transitions. Word has length 152 [2023-12-25 05:54:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:16,098 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 645 transitions. [2023-12-25 05:54:16,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-25 05:54:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 645 transitions. [2023-12-25 05:54:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-25 05:54:16,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:16,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:16,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:16,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:16,308 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:16,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1536858641, now seen corresponding path program 1 times [2023-12-25 05:54:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:16,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281372991] [2023-12-25 05:54:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:16,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:16,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:16,311 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:16,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-25 05:54:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:16,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:16,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-25 05:54:16,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:16,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:16,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281372991] [2023-12-25 05:54:16,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281372991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:16,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:16,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:16,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864797612] [2023-12-25 05:54:16,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:16,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:16,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:16,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:16,585 INFO L87 Difference]: Start difference. First operand 419 states and 645 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 05:54:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:16,635 INFO L93 Difference]: Finished difference Result 882 states and 1376 transitions. [2023-12-25 05:54:16,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:16,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2023-12-25 05:54:16,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:16,639 INFO L225 Difference]: With dead ends: 882 [2023-12-25 05:54:16,639 INFO L226 Difference]: Without dead ends: 489 [2023-12-25 05:54:16,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:16,641 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 129 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:16,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1186 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-12-25 05:54:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 484. [2023-12-25 05:54:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 367 states have (on average 1.5885558583106267) internal successors, (583), 375 states have internal predecessors, (583), 84 states have call successors, (84), 28 states have call predecessors, (84), 32 states have return successors, (95), 82 states have call predecessors, (95), 83 states have call successors, (95) [2023-12-25 05:54:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 762 transitions. [2023-12-25 05:54:16,656 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 762 transitions. Word has length 135 [2023-12-25 05:54:16,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:16,656 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 762 transitions. [2023-12-25 05:54:16,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 05:54:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 762 transitions. [2023-12-25 05:54:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-25 05:54:16,659 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:16,659 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:16,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:16,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:16,866 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:16,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash -886521902, now seen corresponding path program 1 times [2023-12-25 05:54:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:16,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670066493] [2023-12-25 05:54:16,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:16,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:16,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:16,868 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:16,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 05:54:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:17,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 05:54:17,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:54:17,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:54:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:54:17,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:17,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670066493] [2023-12-25 05:54:17,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670066493] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:54:17,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:54:17,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-25 05:54:17,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784194264] [2023-12-25 05:54:17,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:54:17,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 05:54:17,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 05:54:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:54:17,236 INFO L87 Difference]: Start difference. First operand 484 states and 762 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2023-12-25 05:54:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:17,485 INFO L93 Difference]: Finished difference Result 1129 states and 1839 transitions. [2023-12-25 05:54:17,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 05:54:17,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 154 [2023-12-25 05:54:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:17,490 INFO L225 Difference]: With dead ends: 1129 [2023-12-25 05:54:17,490 INFO L226 Difference]: Without dead ends: 904 [2023-12-25 05:54:17,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-25 05:54:17,492 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 433 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:17,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 2815 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 05:54:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2023-12-25 05:54:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 889. [2023-12-25 05:54:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 693 states have (on average 1.6493506493506493) internal successors, (1143), 701 states have internal predecessors, (1143), 163 states have call successors, (163), 28 states have call predecessors, (163), 32 states have return successors, (184), 161 states have call predecessors, (184), 162 states have call successors, (184) [2023-12-25 05:54:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1490 transitions. [2023-12-25 05:54:17,519 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1490 transitions. Word has length 154 [2023-12-25 05:54:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:17,519 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1490 transitions. [2023-12-25 05:54:17,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2023-12-25 05:54:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1490 transitions. [2023-12-25 05:54:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-25 05:54:17,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:17,523 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:17,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:17,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:17,732 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:17,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1693109429, now seen corresponding path program 1 times [2023-12-25 05:54:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:17,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107299073] [2023-12-25 05:54:17,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:17,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:17,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:17,735 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:17,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 05:54:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:17,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:17,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:54:17,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:17,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:17,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107299073] [2023-12-25 05:54:17,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107299073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:17,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:17,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725525372] [2023-12-25 05:54:17,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:17,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:17,999 INFO L87 Difference]: Start difference. First operand 889 states and 1490 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:18,067 INFO L93 Difference]: Finished difference Result 2125 states and 3609 transitions. [2023-12-25 05:54:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:18,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2023-12-25 05:54:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:18,074 INFO L225 Difference]: With dead ends: 2125 [2023-12-25 05:54:18,074 INFO L226 Difference]: Without dead ends: 1296 [2023-12-25 05:54:18,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:18,078 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 127 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:18,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1232 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2023-12-25 05:54:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1291. [2023-12-25 05:54:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1016 states have (on average 1.6633858267716535) internal successors, (1690), 1024 states have internal predecessors, (1690), 242 states have call successors, (242), 28 states have call predecessors, (242), 32 states have return successors, (273), 240 states have call predecessors, (273), 241 states have call successors, (273) [2023-12-25 05:54:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2205 transitions. [2023-12-25 05:54:18,124 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2205 transitions. Word has length 160 [2023-12-25 05:54:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:18,125 INFO L495 AbstractCegarLoop]: Abstraction has 1291 states and 2205 transitions. [2023-12-25 05:54:18,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2205 transitions. [2023-12-25 05:54:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-25 05:54:18,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:18,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:18,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:18,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:18,351 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:18,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:18,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1104057809, now seen corresponding path program 1 times [2023-12-25 05:54:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:18,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188560819] [2023-12-25 05:54:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:18,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:18,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:18,353 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:18,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 05:54:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:18,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:18,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-25 05:54:18,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:18,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:18,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188560819] [2023-12-25 05:54:18,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188560819] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:18,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:18,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:18,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664008809] [2023-12-25 05:54:18,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:18,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:18,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:18,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:18,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:18,604 INFO L87 Difference]: Start difference. First operand 1291 states and 2205 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 05:54:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:18,694 INFO L93 Difference]: Finished difference Result 3108 states and 5340 transitions. [2023-12-25 05:54:18,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:18,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2023-12-25 05:54:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:18,703 INFO L225 Difference]: With dead ends: 3108 [2023-12-25 05:54:18,703 INFO L226 Difference]: Without dead ends: 1927 [2023-12-25 05:54:18,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:18,709 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 125 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:18,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1221 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2023-12-25 05:54:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1922. [2023-12-25 05:54:18,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1528 states have (on average 1.6727748691099475) internal successors, (2556), 1536 states have internal predecessors, (2556), 361 states have call successors, (361), 28 states have call predecessors, (361), 32 states have return successors, (392), 359 states have call predecessors, (392), 360 states have call successors, (392) [2023-12-25 05:54:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 3309 transitions. [2023-12-25 05:54:18,775 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 3309 transitions. Word has length 143 [2023-12-25 05:54:18,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:18,776 INFO L495 AbstractCegarLoop]: Abstraction has 1922 states and 3309 transitions. [2023-12-25 05:54:18,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 05:54:18,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 3309 transitions. [2023-12-25 05:54:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-25 05:54:18,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:18,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:18,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:18,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:18,993 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:18,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1817280525, now seen corresponding path program 1 times [2023-12-25 05:54:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:18,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99210921] [2023-12-25 05:54:18,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:18,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:18,995 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:18,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-25 05:54:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:19,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:19,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:54:19,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:19,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:19,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99210921] [2023-12-25 05:54:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99210921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:19,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:19,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436867508] [2023-12-25 05:54:19,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:19,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:19,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:19,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:19,257 INFO L87 Difference]: Start difference. First operand 1922 states and 3309 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:19,356 INFO L93 Difference]: Finished difference Result 4588 states and 7958 transitions. [2023-12-25 05:54:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:19,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2023-12-25 05:54:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:19,368 INFO L225 Difference]: With dead ends: 4588 [2023-12-25 05:54:19,368 INFO L226 Difference]: Without dead ends: 2896 [2023-12-25 05:54:19,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:19,374 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 123 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:19,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1214 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:19,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2023-12-25 05:54:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 2891. [2023-12-25 05:54:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2335 states have (on average 1.6805139186295504) internal successors, (3924), 2343 states have internal predecessors, (3924), 523 states have call successors, (523), 28 states have call predecessors, (523), 32 states have return successors, (570), 521 states have call predecessors, (570), 522 states have call successors, (570) [2023-12-25 05:54:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 5017 transitions. [2023-12-25 05:54:19,477 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 5017 transitions. Word has length 162 [2023-12-25 05:54:19,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:19,477 INFO L495 AbstractCegarLoop]: Abstraction has 2891 states and 5017 transitions. [2023-12-25 05:54:19,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 5017 transitions. [2023-12-25 05:54:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-25 05:54:19,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:19,490 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:19,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:19,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:19,701 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:19,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1582899675, now seen corresponding path program 1 times [2023-12-25 05:54:19,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:19,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578004198] [2023-12-25 05:54:19,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:19,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:19,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:19,703 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:19,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-25 05:54:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:19,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:19,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:54:19,962 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:19,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578004198] [2023-12-25 05:54:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578004198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:19,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:19,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:19,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20430851] [2023-12-25 05:54:19,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:19,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:19,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:19,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:19,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:19,963 INFO L87 Difference]: Start difference. First operand 2891 states and 5017 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:20,123 INFO L93 Difference]: Finished difference Result 6928 states and 12106 transitions. [2023-12-25 05:54:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 163 [2023-12-25 05:54:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:20,144 INFO L225 Difference]: With dead ends: 6928 [2023-12-25 05:54:20,144 INFO L226 Difference]: Without dead ends: 4464 [2023-12-25 05:54:20,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:20,155 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 121 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:20,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1214 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4464 states. [2023-12-25 05:54:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4464 to 4459. [2023-12-25 05:54:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4459 states, 3658 states have (on average 1.686167304537999) internal successors, (6168), 3666 states have internal predecessors, (6168), 768 states have call successors, (768), 28 states have call predecessors, (768), 32 states have return successors, (841), 766 states have call predecessors, (841), 767 states have call successors, (841) [2023-12-25 05:54:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 7777 transitions. [2023-12-25 05:54:20,339 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 7777 transitions. Word has length 163 [2023-12-25 05:54:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:20,339 INFO L495 AbstractCegarLoop]: Abstraction has 4459 states and 7777 transitions. [2023-12-25 05:54:20,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 7777 transitions. [2023-12-25 05:54:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-25 05:54:20,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:20,358 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:20,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:20,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:20,564 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:20,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:20,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1659780972, now seen corresponding path program 1 times [2023-12-25 05:54:20,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:20,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033291057] [2023-12-25 05:54:20,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:20,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:20,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:20,567 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:20,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-25 05:54:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:20,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:20,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-25 05:54:20,837 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:20,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:20,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033291057] [2023-12-25 05:54:20,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033291057] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:20,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:20,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:20,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737886170] [2023-12-25 05:54:20,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:20,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:20,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:20,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:20,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:20,839 INFO L87 Difference]: Start difference. First operand 4459 states and 7777 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 05:54:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:21,058 INFO L93 Difference]: Finished difference Result 10881 states and 19073 transitions. [2023-12-25 05:54:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:21,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2023-12-25 05:54:21,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:21,105 INFO L225 Difference]: With dead ends: 10881 [2023-12-25 05:54:21,105 INFO L226 Difference]: Without dead ends: 7136 [2023-12-25 05:54:21,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:21,118 INFO L413 NwaCegarLoop]: 617 mSDtfsCounter, 119 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:21,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1220 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7136 states. [2023-12-25 05:54:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7136 to 7131. [2023-12-25 05:54:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7131 states, 5837 states have (on average 1.681000513962652) internal successors, (9812), 5845 states have internal predecessors, (9812), 1261 states have call successors, (1261), 28 states have call predecessors, (1261), 32 states have return successors, (1378), 1259 states have call predecessors, (1378), 1260 states have call successors, (1378) [2023-12-25 05:54:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7131 states to 7131 states and 12451 transitions. [2023-12-25 05:54:21,389 INFO L78 Accepts]: Start accepts. Automaton has 7131 states and 12451 transitions. Word has length 146 [2023-12-25 05:54:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:21,389 INFO L495 AbstractCegarLoop]: Abstraction has 7131 states and 12451 transitions. [2023-12-25 05:54:21,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 05:54:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand 7131 states and 12451 transitions. [2023-12-25 05:54:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-25 05:54:21,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:21,416 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:21,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:21,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:21,623 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:21,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:21,624 INFO L85 PathProgramCache]: Analyzing trace with hash 779707767, now seen corresponding path program 1 times [2023-12-25 05:54:21,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:21,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194176420] [2023-12-25 05:54:21,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:21,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:21,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:21,626 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:21,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-25 05:54:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:21,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:21,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:54:21,895 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:21,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:21,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194176420] [2023-12-25 05:54:21,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194176420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:21,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:21,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:21,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927945762] [2023-12-25 05:54:21,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:21,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:21,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:21,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:21,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:21,898 INFO L87 Difference]: Start difference. First operand 7131 states and 12451 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:22,237 INFO L93 Difference]: Finished difference Result 18016 states and 31646 transitions. [2023-12-25 05:54:22,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:22,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2023-12-25 05:54:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:22,286 INFO L225 Difference]: With dead ends: 18016 [2023-12-25 05:54:22,286 INFO L226 Difference]: Without dead ends: 11965 [2023-12-25 05:54:22,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:22,312 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 117 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:22,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1222 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:22,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11965 states. [2023-12-25 05:54:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11965 to 11960. [2023-12-25 05:54:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11960 states, 9844 states have (on average 1.6814303128809427) internal successors, (16552), 9852 states have internal predecessors, (16552), 2083 states have call successors, (2083), 28 states have call predecessors, (2083), 32 states have return successors, (2278), 2081 states have call predecessors, (2278), 2082 states have call successors, (2278) [2023-12-25 05:54:22,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11960 states to 11960 states and 20913 transitions. [2023-12-25 05:54:22,991 INFO L78 Accepts]: Start accepts. Automaton has 11960 states and 20913 transitions. Word has length 165 [2023-12-25 05:54:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:22,991 INFO L495 AbstractCegarLoop]: Abstraction has 11960 states and 20913 transitions. [2023-12-25 05:54:22,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 11960 states and 20913 transitions. [2023-12-25 05:54:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-25 05:54:23,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:23,036 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:23,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:23,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:23,244 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:23,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash 763149257, now seen corresponding path program 1 times [2023-12-25 05:54:23,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:23,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330197737] [2023-12-25 05:54:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:23,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:23,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:23,246 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:23,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-25 05:54:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:23,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:23,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:54:23,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:23,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330197737] [2023-12-25 05:54:23,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330197737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:23,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:23,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:23,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294175091] [2023-12-25 05:54:23,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:23,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:23,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:23,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:23,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:23,514 INFO L87 Difference]: Start difference. First operand 11960 states and 20913 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:24,027 INFO L93 Difference]: Finished difference Result 28562 states and 49918 transitions. [2023-12-25 05:54:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:24,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 166 [2023-12-25 05:54:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:24,097 INFO L225 Difference]: With dead ends: 28562 [2023-12-25 05:54:24,098 INFO L226 Difference]: Without dead ends: 18637 [2023-12-25 05:54:24,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:24,130 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 115 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:24,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1189 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18637 states. [2023-12-25 05:54:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18637 to 18632. [2023-12-25 05:54:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18632 states, 15313 states have (on average 1.6595702997453143) internal successors, (25413), 15321 states have internal predecessors, (25413), 3286 states have call successors, (3286), 28 states have call predecessors, (3286), 32 states have return successors, (3625), 3284 states have call predecessors, (3625), 3285 states have call successors, (3625) [2023-12-25 05:54:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18632 states to 18632 states and 32324 transitions. [2023-12-25 05:54:24,930 INFO L78 Accepts]: Start accepts. Automaton has 18632 states and 32324 transitions. Word has length 166 [2023-12-25 05:54:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:24,931 INFO L495 AbstractCegarLoop]: Abstraction has 18632 states and 32324 transitions. [2023-12-25 05:54:24,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 18632 states and 32324 transitions. [2023-12-25 05:54:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-25 05:54:24,971 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:24,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:24,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-25 05:54:25,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:25,179 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:25,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2014395509, now seen corresponding path program 1 times [2023-12-25 05:54:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:25,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844993511] [2023-12-25 05:54:25,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:25,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:25,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:25,181 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:25,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 05:54:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:25,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:25,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-25 05:54:25,435 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:25,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844993511] [2023-12-25 05:54:25,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844993511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:25,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:25,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:25,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687223236] [2023-12-25 05:54:25,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:25,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:25,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:25,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:25,439 INFO L87 Difference]: Start difference. First operand 18632 states and 32324 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 05:54:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:26,469 INFO L93 Difference]: Finished difference Result 49195 states and 85699 transitions. [2023-12-25 05:54:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:26,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2023-12-25 05:54:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:26,629 INFO L225 Difference]: With dead ends: 49195 [2023-12-25 05:54:26,629 INFO L226 Difference]: Without dead ends: 33218 [2023-12-25 05:54:26,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:26,672 INFO L413 NwaCegarLoop]: 613 mSDtfsCounter, 113 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:26,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1220 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33218 states. [2023-12-25 05:54:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33218 to 33213. [2023-12-25 05:54:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33213 states, 27444 states have (on average 1.6570470776854687) internal successors, (45476), 27452 states have internal predecessors, (45476), 5736 states have call successors, (5736), 28 states have call predecessors, (5736), 32 states have return successors, (6349), 5734 states have call predecessors, (6349), 5735 states have call successors, (6349) [2023-12-25 05:54:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33213 states to 33213 states and 57561 transitions. [2023-12-25 05:54:28,284 INFO L78 Accepts]: Start accepts. Automaton has 33213 states and 57561 transitions. Word has length 149 [2023-12-25 05:54:28,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:28,284 INFO L495 AbstractCegarLoop]: Abstraction has 33213 states and 57561 transitions. [2023-12-25 05:54:28,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 05:54:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 33213 states and 57561 transitions. [2023-12-25 05:54:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-25 05:54:28,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:28,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:28,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:28,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:28,552 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:28,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:28,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1666942833, now seen corresponding path program 1 times [2023-12-25 05:54:28,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:28,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104925557] [2023-12-25 05:54:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:28,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:28,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:28,556 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:28,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-25 05:54:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:28,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:28,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:54:28,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:28,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:28,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104925557] [2023-12-25 05:54:28,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104925557] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:28,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:28,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:28,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350705502] [2023-12-25 05:54:28,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:28,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:28,830 INFO L87 Difference]: Start difference. First operand 33213 states and 57561 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:30,718 INFO L93 Difference]: Finished difference Result 90497 states and 157391 transitions. [2023-12-25 05:54:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:30,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 168 [2023-12-25 05:54:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:30,993 INFO L225 Difference]: With dead ends: 90497 [2023-12-25 05:54:30,993 INFO L226 Difference]: Without dead ends: 60830 [2023-12-25 05:54:31,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:31,066 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 111 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:31,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1223 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:54:31,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60830 states. [2023-12-25 05:54:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60830 to 60825. [2023-12-25 05:54:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60825 states, 50543 states have (on average 1.6534831727440003) internal successors, (83572), 50551 states have internal predecessors, (83572), 10249 states have call successors, (10249), 28 states have call predecessors, (10249), 32 states have return successors, (11394), 10247 states have call predecessors, (11394), 10248 states have call successors, (11394) [2023-12-25 05:54:34,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60825 states to 60825 states and 105215 transitions. [2023-12-25 05:54:34,246 INFO L78 Accepts]: Start accepts. Automaton has 60825 states and 105215 transitions. Word has length 168 [2023-12-25 05:54:34,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:34,246 INFO L495 AbstractCegarLoop]: Abstraction has 60825 states and 105215 transitions. [2023-12-25 05:54:34,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 60825 states and 105215 transitions. [2023-12-25 05:54:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-25 05:54:34,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:34,332 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:34,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-25 05:54:34,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:34,540 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:34,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:34,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1514688374, now seen corresponding path program 1 times [2023-12-25 05:54:34,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:34,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352969529] [2023-12-25 05:54:34,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:34,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:34,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:34,542 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:34,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-25 05:54:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:34,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 05:54:34,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:54:34,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:54:34,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:34,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352969529] [2023-12-25 05:54:34,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352969529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:54:34,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:54:34,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:54:34,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637197734] [2023-12-25 05:54:34,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:54:34,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 05:54:34,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:34,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 05:54:34,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:34,832 INFO L87 Difference]: Start difference. First operand 60825 states and 105215 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:37,702 INFO L93 Difference]: Finished difference Result 113849 states and 197432 transitions. [2023-12-25 05:54:37,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 05:54:37,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 169 [2023-12-25 05:54:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:38,234 INFO L225 Difference]: With dead ends: 113849 [2023-12-25 05:54:38,235 INFO L226 Difference]: Without dead ends: 113624 [2023-12-25 05:54:38,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 05:54:38,279 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 109 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:38,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1217 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 05:54:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113624 states. [2023-12-25 05:54:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113624 to 113619. [2023-12-25 05:54:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113619 states, 94969 states have (on average 1.648790658004191) internal successors, (156584), 94977 states have internal predecessors, (156584), 18617 states have call successors, (18617), 28 states have call predecessors, (18617), 32 states have return successors, (20808), 18615 states have call predecessors, (20808), 18616 states have call successors, (20808) [2023-12-25 05:54:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113619 states to 113619 states and 196009 transitions. [2023-12-25 05:54:42,441 INFO L78 Accepts]: Start accepts. Automaton has 113619 states and 196009 transitions. Word has length 169 [2023-12-25 05:54:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:54:42,441 INFO L495 AbstractCegarLoop]: Abstraction has 113619 states and 196009 transitions. [2023-12-25 05:54:42,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 05:54:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 113619 states and 196009 transitions. [2023-12-25 05:54:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-25 05:54:42,564 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:54:42,564 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:54:42,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-25 05:54:42,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:42,766 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:54:42,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:54:42,766 INFO L85 PathProgramCache]: Analyzing trace with hash -14080475, now seen corresponding path program 1 times [2023-12-25 05:54:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:54:42,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518030761] [2023-12-25 05:54:42,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:54:42,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:54:42,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:54:42,768 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:54:42,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-25 05:54:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:54:42,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 05:54:42,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:54:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 05:54:43,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:54:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 05:54:43,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:54:43,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518030761] [2023-12-25 05:54:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518030761] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:54:43,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:54:43,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-25 05:54:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820806826] [2023-12-25 05:54:43,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:54:43,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 05:54:43,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:54:43,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 05:54:43,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-12-25 05:54:43,414 INFO L87 Difference]: Start difference. First operand 113619 states and 196009 transitions. Second operand has 16 states, 16 states have (on average 11.375) internal successors, (182), 14 states have internal predecessors, (182), 4 states have call successors, (37), 6 states have call predecessors, (37), 9 states have return successors, (33), 6 states have call predecessors, (33), 4 states have call successors, (33) [2023-12-25 05:54:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:54:56,502 INFO L93 Difference]: Finished difference Result 334645 states and 583995 transitions. [2023-12-25 05:54:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 05:54:56,503 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 14 states have internal predecessors, (182), 4 states have call successors, (37), 6 states have call predecessors, (37), 9 states have return successors, (33), 6 states have call predecessors, (33), 4 states have call successors, (33) Word has length 152 [2023-12-25 05:54:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:54:58,218 INFO L225 Difference]: With dead ends: 334645 [2023-12-25 05:54:58,218 INFO L226 Difference]: Without dead ends: 334425 [2023-12-25 05:54:58,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2023-12-25 05:54:58,369 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 1398 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 5170 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 5437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 5170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-25 05:54:58,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 3014 Invalid, 5437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 5170 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-25 05:54:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334425 states. [2023-12-25 05:55:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334425 to 227239. [2023-12-25 05:55:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227239 states, 189941 states have (on average 1.6487909403446332) internal successors, (313173), 189954 states have internal predecessors, (313173), 37232 states have call successors, (37232), 57 states have call predecessors, (37232), 65 states have return successors, (45978), 37231 states have call predecessors, (45978), 37230 states have call successors, (45978) [2023-12-25 05:55:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227239 states to 227239 states and 396383 transitions. [2023-12-25 05:55:11,700 INFO L78 Accepts]: Start accepts. Automaton has 227239 states and 396383 transitions. Word has length 152 [2023-12-25 05:55:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:55:11,701 INFO L495 AbstractCegarLoop]: Abstraction has 227239 states and 396383 transitions. [2023-12-25 05:55:11,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 14 states have internal predecessors, (182), 4 states have call successors, (37), 6 states have call predecessors, (37), 9 states have return successors, (33), 6 states have call predecessors, (33), 4 states have call successors, (33) [2023-12-25 05:55:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 227239 states and 396383 transitions. [2023-12-25 05:55:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-25 05:55:11,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:55:11,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:55:11,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-25 05:55:12,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:55:12,143 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__EncryptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:55:12,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:55:12,143 INFO L85 PathProgramCache]: Analyzing trace with hash 329127117, now seen corresponding path program 1 times [2023-12-25 05:55:12,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:55:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065956717] [2023-12-25 05:55:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:55:12,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:55:12,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:55:12,145 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:55:12,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-25 05:55:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:55:12,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 05:55:12,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:55:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-12-25 05:55:12,490 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:55:12,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:55:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065956717] [2023-12-25 05:55:12,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065956717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:55:12,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:55:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-25 05:55:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567141673] [2023-12-25 05:55:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:55:12,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 05:55:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:55:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 05:55:12,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-25 05:55:12,492 INFO L87 Difference]: Start difference. First operand 227239 states and 396383 transitions. Second operand has 9 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 4 states have call successors, (23), 5 states have call predecessors, (23), 4 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20)