./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product20.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0e95c13964d33a58c84e6632b6635f09155542b4e87cc9520cc45bb7c6f5f1d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:41:37,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:41:38,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:41:38,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:41:38,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:41:38,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:41:38,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:41:38,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:41:38,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:41:38,074 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:41:38,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:41:38,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:41:38,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:41:38,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:41:38,076 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:41:38,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:41:38,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:41:38,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:41:38,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:41:38,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:41:38,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:41:38,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:41:38,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:41:38,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:41:38,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:41:38,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:41:38,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:41:38,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:41:38,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:41:38,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:41:38,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:41:38,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:41:38,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:41:38,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:41:38,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:41:38,080 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:41:38,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:41:38,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:41:38,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:41:38,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:41:38,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:41:38,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:41:38,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:41:38,080 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0e95c13964d33a58c84e6632b6635f09155542b4e87cc9520cc45bb7c6f5f1d [2025-02-05 15:41:38,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:41:38,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:41:38,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:41:38,372 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:41:38,373 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:41:38,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product20.cil.c [2025-02-05 15:41:39,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a02c6e30b/1be718cef348404e850a1d437550073d/FLAG18fdce90f [2025-02-05 15:41:40,126 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:41:40,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product20.cil.c [2025-02-05 15:41:40,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a02c6e30b/1be718cef348404e850a1d437550073d/FLAG18fdce90f [2025-02-05 15:41:40,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a02c6e30b/1be718cef348404e850a1d437550073d [2025-02-05 15:41:40,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:41:40,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:41:40,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:41:40,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:41:40,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:41:40,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:41:40" (1/1) ... [2025-02-05 15:41:40,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ced62c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:40, skipping insertion in model container [2025-02-05 15:41:40,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:41:40" (1/1) ... [2025-02-05 15:41:40,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:41:40,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product20.cil.c[17698,17711] [2025-02-05 15:41:40,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:41:40,857 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:41:40,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-02-05 15:41:40,867 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [460] [2025-02-05 15:41:40,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [795] [2025-02-05 15:41:40,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [899] [2025-02-05 15:41:40,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [908] [2025-02-05 15:41:40,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1220] [2025-02-05 15:41:40,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1439] [2025-02-05 15:41:40,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [2501] [2025-02-05 15:41:40,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2529] [2025-02-05 15:41:40,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2895] [2025-02-05 15:41:40,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2930] [2025-02-05 15:41:40,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product20.cil.c[17698,17711] [2025-02-05 15:41:41,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:41:41,040 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:41:41,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41 WrapperNode [2025-02-05 15:41:41,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:41:41,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:41:41,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:41:41,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:41:41,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,147 INFO L138 Inliner]: procedures = 128, calls = 197, calls flagged for inlining = 55, calls inlined = 48, statements flattened = 949 [2025-02-05 15:41:41,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:41:41,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:41:41,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:41:41,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:41:41,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,203 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:41:41,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,226 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:41:41,243 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:41:41,243 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:41:41,243 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:41:41,244 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (1/1) ... [2025-02-05 15:41:41,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:41:41,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:41,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:41:41,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:41:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:41:41,314 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:41:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:41:41,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:41:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:41:41,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:41:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:41:41,315 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:41:41,315 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:41:41,315 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:41:41,315 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:41:41,315 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:41:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:41:41,316 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:41:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:41:41,316 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:41:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:41:41,316 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:41:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:41:41,316 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:41:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:41:41,316 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:41:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:41:41,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:41:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:41:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:41:41,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:41:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:41:41,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:41:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:41:41,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:41:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:41:41,317 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:41:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:41:41,317 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:41:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:41:41,317 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:41:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:41:41,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:41:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:41:41,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:41:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:41:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:41:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:41:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:41:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:41:41,320 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:41:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:41:41,320 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:41:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:41:41,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:41:41,528 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:41:41,531 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:41:41,671 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2135: #res#1 := ~retValue_acc~32#1; [2025-02-05 15:41:41,672 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2090-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~31#1; [2025-02-05 15:41:41,691 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L896-1: createEmail_#res#1 := createEmail_~retValue_acc~19#1; [2025-02-05 15:41:41,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1587: #res := ~retValue_acc~24; [2025-02-05 15:41:41,734 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-02-05 15:41:41,802 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-02-05 15:41:41,842 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-02-05 15:41:41,969 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1913: #res := ~retValue_acc~28; [2025-02-05 15:41:42,157 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2043-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~30#1; [2025-02-05 15:41:42,158 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2359-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~35#1; [2025-02-05 15:41:42,158 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~29#1; [2025-02-05 15:41:42,158 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~15#1; [2025-02-05 15:41:42,158 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478-1: getClientId_#res#1 := getClientId_~retValue_acc~37#1; [2025-02-05 15:41:42,468 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927-1: valid_product_#res#1 := valid_product_~retValue_acc~42#1; [2025-02-05 15:41:42,470 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~12#1; [2025-02-05 15:41:42,470 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~14#1; [2025-02-05 15:41:42,470 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2305-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~34#1; [2025-02-05 15:41:42,470 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L726-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~13#1; [2025-02-05 15:41:42,470 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2198-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~33#1; [2025-02-05 15:41:42,480 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-02-05 15:41:42,667 INFO L? ?]: Removed 480 outVars from TransFormulas that were not future-live. [2025-02-05 15:41:42,668 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:41:42,696 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:41:42,697 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:41:42,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:41:42 BoogieIcfgContainer [2025-02-05 15:41:42,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:41:42,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:41:42,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:41:42,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:41:42,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:41:40" (1/3) ... [2025-02-05 15:41:42,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b27d4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:41:42, skipping insertion in model container [2025-02-05 15:41:42,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:41" (2/3) ... [2025-02-05 15:41:42,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b27d4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:41:42, skipping insertion in model container [2025-02-05 15:41:42,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:41:42" (3/3) ... [2025-02-05 15:41:42,712 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product20.cil.c [2025-02-05 15:41:42,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:41:42,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product20.cil.c that has 23 procedures, 363 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:41:42,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:41:42,850 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@76bc9731, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:41:42,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:41:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 285 states have (on average 1.5789473684210527) internal successors, (450), 290 states have internal predecessors, (450), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 15:41:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:41:42,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:42,881 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:42,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:42,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:42,887 INFO L85 PathProgramCache]: Analyzing trace with hash -552590134, now seen corresponding path program 1 times [2025-02-05 15:41:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:42,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286327113] [2025-02-05 15:41:42,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:42,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:43,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:41:43,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:41:43,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:43,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:41:43,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286327113] [2025-02-05 15:41:43,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286327113] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:43,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752793682] [2025-02-05 15:41:43,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:43,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:43,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:43,674 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:43,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:41:43,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:41:44,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:41:44,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:44,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:44,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:41:44,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:44,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:44,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752793682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:44,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:41:44,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480836812] [2025-02-05 15:41:44,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:41:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:44,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:41:44,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:44,093 INFO L87 Difference]: Start difference. First operand has 363 states, 285 states have (on average 1.5789473684210527) internal successors, (450), 290 states have internal predecessors, (450), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:44,167 INFO L93 Difference]: Finished difference Result 534 states and 808 transitions. [2025-02-05 15:41:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:41:44,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-02-05 15:41:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:44,182 INFO L225 Difference]: With dead ends: 534 [2025-02-05 15:41:44,182 INFO L226 Difference]: Without dead ends: 356 [2025-02-05 15:41:44,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:44,192 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:44,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-05 15:41:44,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-02-05 15:41:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 279 states have (on average 1.5770609318996416) internal successors, (440), 283 states have internal predecessors, (440), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 15:41:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 547 transitions. [2025-02-05 15:41:44,260 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 547 transitions. Word has length 98 [2025-02-05 15:41:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:44,262 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 547 transitions. [2025-02-05 15:41:44,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 547 transitions. [2025-02-05 15:41:44,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:41:44,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:44,269 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:44,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:41:44,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:41:44,470 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:44,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash 822034393, now seen corresponding path program 1 times [2025-02-05 15:41:44,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:44,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144029586] [2025-02-05 15:41:44,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:44,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:44,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:41:44,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:41:44,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:44,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:41:44,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:44,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144029586] [2025-02-05 15:41:44,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144029586] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:44,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109439761] [2025-02-05 15:41:44,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:44,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:44,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:44,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:44,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:41:45,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:41:45,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:41:45,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:45,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:45,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:41:45,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:45,226 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:45,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109439761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:45,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:45,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:41:45,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901555261] [2025-02-05 15:41:45,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:45,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:45,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:45,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:45,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:45,233 INFO L87 Difference]: Start difference. First operand 356 states and 547 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:45,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:45,283 INFO L93 Difference]: Finished difference Result 523 states and 786 transitions. [2025-02-05 15:41:45,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:45,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-02-05 15:41:45,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:45,289 INFO L225 Difference]: With dead ends: 523 [2025-02-05 15:41:45,292 INFO L226 Difference]: Without dead ends: 358 [2025-02-05 15:41:45,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:45,296 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:45,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-05 15:41:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-02-05 15:41:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 281 states have (on average 1.5729537366548043) internal successors, (442), 285 states have internal predecessors, (442), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 15:41:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 549 transitions. [2025-02-05 15:41:45,348 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 549 transitions. Word has length 99 [2025-02-05 15:41:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:45,350 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 549 transitions. [2025-02-05 15:41:45,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 549 transitions. [2025-02-05 15:41:45,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:41:45,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:45,356 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:45,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:41:45,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:45,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:45,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:45,561 INFO L85 PathProgramCache]: Analyzing trace with hash -808210201, now seen corresponding path program 1 times [2025-02-05 15:41:45,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:45,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671563189] [2025-02-05 15:41:45,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:45,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:45,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:41:45,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:41:45,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:45,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:45,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671563189] [2025-02-05 15:41:45,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671563189] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533826393] [2025-02-05 15:41:45,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:45,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:45,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:45,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:45,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:41:46,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:41:46,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:41:46,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:46,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:46,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:41:46,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:46,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533826393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:46,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:41:46,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051690657] [2025-02-05 15:41:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:46,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:46,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:46,223 INFO L87 Difference]: Start difference. First operand 358 states and 549 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:46,255 INFO L93 Difference]: Finished difference Result 763 states and 1189 transitions. [2025-02-05 15:41:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:46,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-02-05 15:41:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:46,262 INFO L225 Difference]: With dead ends: 763 [2025-02-05 15:41:46,262 INFO L226 Difference]: Without dead ends: 432 [2025-02-05 15:41:46,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:46,265 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 134 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:46,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1053 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-02-05 15:41:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 424. [2025-02-05 15:41:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 333 states have (on average 1.5915915915915917) internal successors, (530), 337 states have internal predecessors, (530), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 15:41:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 665 transitions. [2025-02-05 15:41:46,304 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 665 transitions. Word has length 107 [2025-02-05 15:41:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:46,304 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 665 transitions. [2025-02-05 15:41:46,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 665 transitions. [2025-02-05 15:41:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:41:46,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:46,309 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:46,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:41:46,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:46,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:46,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:46,513 INFO L85 PathProgramCache]: Analyzing trace with hash -805684110, now seen corresponding path program 1 times [2025-02-05 15:41:46,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:46,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719610930] [2025-02-05 15:41:46,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:46,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:46,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:41:46,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:41:46,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:46,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:46,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:46,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719610930] [2025-02-05 15:41:46,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719610930] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:46,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575430606] [2025-02-05 15:41:46,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:46,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:46,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:46,714 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:46,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:41:46,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:41:47,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:41:47,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:47,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:47,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:41:47,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:41:47,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:47,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575430606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:47,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:47,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:41:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015069136] [2025-02-05 15:41:47,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:47,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:47,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:47,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:41:47,081 INFO L87 Difference]: Start difference. First operand 424 states and 665 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:47,180 INFO L93 Difference]: Finished difference Result 839 states and 1320 transitions. [2025-02-05 15:41:47,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:47,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-05 15:41:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:47,186 INFO L225 Difference]: With dead ends: 839 [2025-02-05 15:41:47,186 INFO L226 Difference]: Without dead ends: 426 [2025-02-05 15:41:47,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:41:47,190 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 2 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:47,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-05 15:41:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-02-05 15:41:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 334 states have (on average 1.589820359281437) internal successors, (531), 339 states have internal predecessors, (531), 68 states have call successors, (68), 22 states have call predecessors, (68), 23 states have return successors, (69), 66 states have call predecessors, (69), 67 states have call successors, (69) [2025-02-05 15:41:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 668 transitions. [2025-02-05 15:41:47,224 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 668 transitions. Word has length 108 [2025-02-05 15:41:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:47,224 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 668 transitions. [2025-02-05 15:41:47,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 668 transitions. [2025-02-05 15:41:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:41:47,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:47,230 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:47,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:41:47,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:47,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:47,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:47,431 INFO L85 PathProgramCache]: Analyzing trace with hash -953062498, now seen corresponding path program 1 times [2025-02-05 15:41:47,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:47,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267109795] [2025-02-05 15:41:47,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:47,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:41:47,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:41:47,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:47,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:41:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267109795] [2025-02-05 15:41:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267109795] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191189694] [2025-02-05 15:41:47,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:47,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:47,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:47,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:47,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:41:47,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:41:47,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:41:47,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:47,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:47,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:41:47,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:41:47,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:48,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191189694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:48,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:48,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:41:48,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339045195] [2025-02-05 15:41:48,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:48,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:48,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:48,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:48,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:48,002 INFO L87 Difference]: Start difference. First operand 426 states and 668 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:48,083 INFO L93 Difference]: Finished difference Result 841 states and 1325 transitions. [2025-02-05 15:41:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:48,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-02-05 15:41:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:48,087 INFO L225 Difference]: With dead ends: 841 [2025-02-05 15:41:48,088 INFO L226 Difference]: Without dead ends: 428 [2025-02-05 15:41:48,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:48,090 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 2 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:48,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2131 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:48,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-05 15:41:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-02-05 15:41:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.5880597014925373) internal successors, (532), 341 states have internal predecessors, (532), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (74), 66 states have call predecessors, (74), 67 states have call successors, (74) [2025-02-05 15:41:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 674 transitions. [2025-02-05 15:41:48,125 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 674 transitions. Word has length 109 [2025-02-05 15:41:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:48,126 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 674 transitions. [2025-02-05 15:41:48,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 674 transitions. [2025-02-05 15:41:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:41:48,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:48,129 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:48,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:41:48,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:48,333 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:48,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:48,334 INFO L85 PathProgramCache]: Analyzing trace with hash -827499626, now seen corresponding path program 1 times [2025-02-05 15:41:48,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:48,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963566386] [2025-02-05 15:41:48,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:48,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:48,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:41:48,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:41:48,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:48,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:48,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:48,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963566386] [2025-02-05 15:41:48,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963566386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:48,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:48,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:48,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3999174] [2025-02-05 15:41:48,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:48,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:48,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:48,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:48,492 INFO L87 Difference]: Start difference. First operand 428 states and 674 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:48,546 INFO L93 Difference]: Finished difference Result 833 states and 1316 transitions. [2025-02-05 15:41:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-02-05 15:41:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:48,551 INFO L225 Difference]: With dead ends: 833 [2025-02-05 15:41:48,551 INFO L226 Difference]: Without dead ends: 428 [2025-02-05 15:41:48,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:48,554 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 2 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:48,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2149 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-05 15:41:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-02-05 15:41:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.5880597014925373) internal successors, (532), 341 states have internal predecessors, (532), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (73), 66 states have call predecessors, (73), 67 states have call successors, (73) [2025-02-05 15:41:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 673 transitions. [2025-02-05 15:41:48,592 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 673 transitions. Word has length 110 [2025-02-05 15:41:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:48,593 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 673 transitions. [2025-02-05 15:41:48,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 673 transitions. [2025-02-05 15:41:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:41:48,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:48,596 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:41:48,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:48,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:48,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2127146848, now seen corresponding path program 2 times [2025-02-05 15:41:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:48,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832964689] [2025-02-05 15:41:48,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:41:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:48,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-02-05 15:41:48,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:41:48,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:41:48,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832964689] [2025-02-05 15:41:48,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832964689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:48,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:48,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:48,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130719199] [2025-02-05 15:41:48,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:48,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:48,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:48,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:48,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:48,770 INFO L87 Difference]: Start difference. First operand 428 states and 673 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:48,833 INFO L93 Difference]: Finished difference Result 831 states and 1311 transitions. [2025-02-05 15:41:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:48,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-02-05 15:41:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:48,837 INFO L225 Difference]: With dead ends: 831 [2025-02-05 15:41:48,837 INFO L226 Difference]: Without dead ends: 428 [2025-02-05 15:41:48,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:48,840 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:48,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2135 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-02-05 15:41:48,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-02-05 15:41:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.5880597014925373) internal successors, (532), 341 states have internal predecessors, (532), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (72), 66 states have call predecessors, (72), 67 states have call successors, (72) [2025-02-05 15:41:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 672 transitions. [2025-02-05 15:41:48,861 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 672 transitions. Word has length 111 [2025-02-05 15:41:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:48,861 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 672 transitions. [2025-02-05 15:41:48,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 672 transitions. [2025-02-05 15:41:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:41:48,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:48,864 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:48,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:41:48,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:48,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:48,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1892708170, now seen corresponding path program 3 times [2025-02-05 15:41:48,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:48,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084674607] [2025-02-05 15:41:48,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:41:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:48,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 3 equivalence classes. [2025-02-05 15:41:48,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 100 of 112 statements. [2025-02-05 15:41:48,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:41:48,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:49,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084674607] [2025-02-05 15:41:49,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084674607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:49,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:49,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097770751] [2025-02-05 15:41:49,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:49,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:49,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:49,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:49,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:49,009 INFO L87 Difference]: Start difference. First operand 428 states and 672 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:49,066 INFO L93 Difference]: Finished difference Result 833 states and 1317 transitions. [2025-02-05 15:41:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:49,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-02-05 15:41:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:49,070 INFO L225 Difference]: With dead ends: 833 [2025-02-05 15:41:49,071 INFO L226 Difference]: Without dead ends: 430 [2025-02-05 15:41:49,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:49,073 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:49,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2146 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-02-05 15:41:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-02-05 15:41:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 336 states have (on average 1.5863095238095237) internal successors, (533), 343 states have internal predecessors, (533), 68 states have call successors, (68), 22 states have call predecessors, (68), 25 states have return successors, (77), 66 states have call predecessors, (77), 67 states have call successors, (77) [2025-02-05 15:41:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 678 transitions. [2025-02-05 15:41:49,095 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 678 transitions. Word has length 112 [2025-02-05 15:41:49,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:49,095 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 678 transitions. [2025-02-05 15:41:49,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,095 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 678 transitions. [2025-02-05 15:41:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:41:49,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:49,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:49,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:41:49,099 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:49,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1293464195, now seen corresponding path program 1 times [2025-02-05 15:41:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:49,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221646208] [2025-02-05 15:41:49,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:49,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:41:49,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:41:49,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:49,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:49,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:49,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221646208] [2025-02-05 15:41:49,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221646208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:49,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:49,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781131059] [2025-02-05 15:41:49,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:49,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:49,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:49,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:49,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:49,254 INFO L87 Difference]: Start difference. First operand 430 states and 678 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:49,324 INFO L93 Difference]: Finished difference Result 839 states and 1327 transitions. [2025-02-05 15:41:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:49,325 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2025-02-05 15:41:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:49,329 INFO L225 Difference]: With dead ends: 839 [2025-02-05 15:41:49,329 INFO L226 Difference]: Without dead ends: 432 [2025-02-05 15:41:49,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:49,332 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:49,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2152 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:49,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-02-05 15:41:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-02-05 15:41:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 337 states have (on average 1.5845697329376855) internal successors, (534), 345 states have internal predecessors, (534), 68 states have call successors, (68), 22 states have call predecessors, (68), 26 states have return successors, (79), 66 states have call predecessors, (79), 67 states have call successors, (79) [2025-02-05 15:41:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 681 transitions. [2025-02-05 15:41:49,353 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 681 transitions. Word has length 113 [2025-02-05 15:41:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:49,354 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 681 transitions. [2025-02-05 15:41:49,354 INFO L472 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:41:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 681 transitions. [2025-02-05 15:41:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:41:49,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:49,357 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:49,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:41:49,358 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:49,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:49,358 INFO L85 PathProgramCache]: Analyzing trace with hash 225595728, now seen corresponding path program 1 times [2025-02-05 15:41:49,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:49,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353062309] [2025-02-05 15:41:49,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:49,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:49,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:41:49,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:41:49,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:49,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:41:49,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353062309] [2025-02-05 15:41:49,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353062309] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548441746] [2025-02-05 15:41:49,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:49,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:49,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:49,521 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:41:49,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:41:49,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:41:49,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:41:49,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:49,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:49,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:41:49,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:49,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:41:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:49,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548441746] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:41:49,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:41:49,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:41:49,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873660269] [2025-02-05 15:41:49,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:41:49,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:41:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:49,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:41:49,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:49,940 INFO L87 Difference]: Start difference. First operand 432 states and 681 transitions. Second operand has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-05 15:41:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:50,733 INFO L93 Difference]: Finished difference Result 1274 states and 2092 transitions. [2025-02-05 15:41:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:41:50,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 114 [2025-02-05 15:41:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:50,742 INFO L225 Difference]: With dead ends: 1274 [2025-02-05 15:41:50,743 INFO L226 Difference]: Without dead ends: 871 [2025-02-05 15:41:50,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:41:50,746 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 1314 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 3885 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:50,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 3885 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 15:41:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-02-05 15:41:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 847. [2025-02-05 15:41:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 673 states have (on average 1.6300148588410104) internal successors, (1097), 680 states have internal predecessors, (1097), 147 states have call successors, (147), 23 states have call predecessors, (147), 26 states have return successors, (168), 145 states have call predecessors, (168), 146 states have call successors, (168) [2025-02-05 15:41:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1412 transitions. [2025-02-05 15:41:50,809 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1412 transitions. Word has length 114 [2025-02-05 15:41:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:50,810 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1412 transitions. [2025-02-05 15:41:50,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-05 15:41:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1412 transitions. [2025-02-05 15:41:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:41:50,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:50,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:50,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:41:51,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:41:51,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:51,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:51,019 INFO L85 PathProgramCache]: Analyzing trace with hash -589192906, now seen corresponding path program 1 times [2025-02-05 15:41:51,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:51,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129353919] [2025-02-05 15:41:51,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:51,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:51,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:41:51,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:41:51,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:51,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:51,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:51,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129353919] [2025-02-05 15:41:51,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129353919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:51,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:51,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:51,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202803451] [2025-02-05 15:41:51,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:51,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:51,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:51,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:51,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:51,109 INFO L87 Difference]: Start difference. First operand 847 states and 1412 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:51,188 INFO L93 Difference]: Finished difference Result 2009 states and 3402 transitions. [2025-02-05 15:41:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:51,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-02-05 15:41:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:51,199 INFO L225 Difference]: With dead ends: 2009 [2025-02-05 15:41:51,199 INFO L226 Difference]: Without dead ends: 1240 [2025-02-05 15:41:51,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:51,204 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 131 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:51,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1095 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2025-02-05 15:41:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1232. [2025-02-05 15:41:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 979 states have (on average 1.6465781409601634) internal successors, (1612), 986 states have internal predecessors, (1612), 226 states have call successors, (226), 23 states have call predecessors, (226), 26 states have return successors, (257), 224 states have call predecessors, (257), 225 states have call successors, (257) [2025-02-05 15:41:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2095 transitions. [2025-02-05 15:41:51,278 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2095 transitions. Word has length 117 [2025-02-05 15:41:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:51,278 INFO L471 AbstractCegarLoop]: Abstraction has 1232 states and 2095 transitions. [2025-02-05 15:41:51,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2095 transitions. [2025-02-05 15:41:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:41:51,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:51,287 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:51,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:41:51,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:51,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash -881244482, now seen corresponding path program 1 times [2025-02-05 15:41:51,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:51,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632642120] [2025-02-05 15:41:51,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:51,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:51,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:41:51,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:41:51,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:51,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:51,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:51,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632642120] [2025-02-05 15:41:51,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632642120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:51,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:51,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823004946] [2025-02-05 15:41:51,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:51,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:51,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:51,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:51,359 INFO L87 Difference]: Start difference. First operand 1232 states and 2095 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:51,441 INFO L93 Difference]: Finished difference Result 2972 states and 5084 transitions. [2025-02-05 15:41:51,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:51,443 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-05 15:41:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:51,459 INFO L225 Difference]: With dead ends: 2972 [2025-02-05 15:41:51,459 INFO L226 Difference]: Without dead ends: 1869 [2025-02-05 15:41:51,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:51,467 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 129 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:51,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1092 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2025-02-05 15:41:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1861. [2025-02-05 15:41:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1861 states, 1489 states have (on average 1.6534586971121559) internal successors, (2462), 1496 states have internal predecessors, (2462), 345 states have call successors, (345), 23 states have call predecessors, (345), 26 states have return successors, (376), 343 states have call predecessors, (376), 344 states have call successors, (376) [2025-02-05 15:41:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1861 states to 1861 states and 3183 transitions. [2025-02-05 15:41:51,625 INFO L78 Accepts]: Start accepts. Automaton has 1861 states and 3183 transitions. Word has length 118 [2025-02-05 15:41:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:51,626 INFO L471 AbstractCegarLoop]: Abstraction has 1861 states and 3183 transitions. [2025-02-05 15:41:51,626 INFO L472 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1861 states and 3183 transitions. [2025-02-05 15:41:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:41:51,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:51,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:51,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:41:51,637 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:51,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash -280619787, now seen corresponding path program 1 times [2025-02-05 15:41:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:51,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354367656] [2025-02-05 15:41:51,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:51,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:51,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:41:51,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:41:51,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:51,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:51,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:51,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354367656] [2025-02-05 15:41:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354367656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:51,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:51,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864752914] [2025-02-05 15:41:51,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:51,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:51,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:51,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:51,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:51,728 INFO L87 Difference]: Start difference. First operand 1861 states and 3183 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:51,852 INFO L93 Difference]: Finished difference Result 4434 states and 7643 transitions. [2025-02-05 15:41:51,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:51,853 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-02-05 15:41:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:51,875 INFO L225 Difference]: With dead ends: 4434 [2025-02-05 15:41:51,875 INFO L226 Difference]: Without dead ends: 2834 [2025-02-05 15:41:51,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:51,885 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 127 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:51,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1081 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2025-02-05 15:41:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2826. [2025-02-05 15:41:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2292 states have (on average 1.6592495636998255) internal successors, (3803), 2299 states have internal predecessors, (3803), 507 states have call successors, (507), 23 states have call predecessors, (507), 26 states have return successors, (554), 505 states have call predecessors, (554), 506 states have call successors, (554) [2025-02-05 15:41:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 4864 transitions. [2025-02-05 15:41:52,073 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 4864 transitions. Word has length 119 [2025-02-05 15:41:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:52,073 INFO L471 AbstractCegarLoop]: Abstraction has 2826 states and 4864 transitions. [2025-02-05 15:41:52,073 INFO L472 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 4864 transitions. [2025-02-05 15:41:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:41:52,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:52,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:52,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:41:52,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:52,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1403367583, now seen corresponding path program 1 times [2025-02-05 15:41:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117435615] [2025-02-05 15:41:52,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:52,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:41:52,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:41:52,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:52,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:52,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:52,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117435615] [2025-02-05 15:41:52,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117435615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:52,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:52,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:52,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72796221] [2025-02-05 15:41:52,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:52,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:52,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:52,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:52,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:52,160 INFO L87 Difference]: Start difference. First operand 2826 states and 4864 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:52,368 INFO L93 Difference]: Finished difference Result 6742 states and 11690 transitions. [2025-02-05 15:41:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:52,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-02-05 15:41:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:52,406 INFO L225 Difference]: With dead ends: 6742 [2025-02-05 15:41:52,406 INFO L226 Difference]: Without dead ends: 4392 [2025-02-05 15:41:52,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:52,419 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 125 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:52,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1081 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2025-02-05 15:41:52,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 4384. [2025-02-05 15:41:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4384 states, 3605 states have (on average 1.6635228848821082) internal successors, (5997), 3612 states have internal predecessors, (5997), 752 states have call successors, (752), 23 states have call predecessors, (752), 26 states have return successors, (825), 750 states have call predecessors, (825), 751 states have call successors, (825) [2025-02-05 15:41:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4384 states to 4384 states and 7574 transitions. [2025-02-05 15:41:52,687 INFO L78 Accepts]: Start accepts. Automaton has 4384 states and 7574 transitions. Word has length 120 [2025-02-05 15:41:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:52,689 INFO L471 AbstractCegarLoop]: Abstraction has 4384 states and 7574 transitions. [2025-02-05 15:41:52,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4384 states and 7574 transitions. [2025-02-05 15:41:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:41:52,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:52,709 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:52,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:41:52,710 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:52,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:52,710 INFO L85 PathProgramCache]: Analyzing trace with hash 404306388, now seen corresponding path program 1 times [2025-02-05 15:41:52,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:52,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579471264] [2025-02-05 15:41:52,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:52,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:52,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:41:52,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:41:52,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:52,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:52,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:52,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579471264] [2025-02-05 15:41:52,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579471264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:52,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:52,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:52,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889204395] [2025-02-05 15:41:52,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:52,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:52,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:52,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:52,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:52,780 INFO L87 Difference]: Start difference. First operand 4384 states and 7574 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:53,049 INFO L93 Difference]: Finished difference Result 10857 states and 18863 transitions. [2025-02-05 15:41:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:53,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-02-05 15:41:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:53,108 INFO L225 Difference]: With dead ends: 10857 [2025-02-05 15:41:53,109 INFO L226 Difference]: Without dead ends: 7196 [2025-02-05 15:41:53,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:53,130 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 123 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:53,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1099 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7196 states. [2025-02-05 15:41:53,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7196 to 7188. [2025-02-05 15:41:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7188 states, 5916 states have (on average 1.659398242055443) internal successors, (9817), 5923 states have internal predecessors, (9817), 1245 states have call successors, (1245), 23 states have call predecessors, (1245), 26 states have return successors, (1362), 1243 states have call predecessors, (1362), 1244 states have call successors, (1362) [2025-02-05 15:41:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7188 states to 7188 states and 12424 transitions. [2025-02-05 15:41:53,677 INFO L78 Accepts]: Start accepts. Automaton has 7188 states and 12424 transitions. Word has length 121 [2025-02-05 15:41:53,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:53,678 INFO L471 AbstractCegarLoop]: Abstraction has 7188 states and 12424 transitions. [2025-02-05 15:41:53,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 7188 states and 12424 transitions. [2025-02-05 15:41:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:41:53,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:53,704 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:53,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:41:53,705 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:53,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1150967360, now seen corresponding path program 1 times [2025-02-05 15:41:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092273823] [2025-02-05 15:41:53,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:53,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:41:53,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:41:53,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:53,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:53,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:53,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092273823] [2025-02-05 15:41:53,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092273823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:53,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:53,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:53,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041595529] [2025-02-05 15:41:53,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:53,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:53,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:53,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:53,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:53,775 INFO L87 Difference]: Start difference. First operand 7188 states and 12424 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:54,167 INFO L93 Difference]: Finished difference Result 18172 states and 31611 transitions. [2025-02-05 15:41:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:54,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-05 15:41:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:54,267 INFO L225 Difference]: With dead ends: 18172 [2025-02-05 15:41:54,267 INFO L226 Difference]: Without dead ends: 12103 [2025-02-05 15:41:54,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:54,301 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 121 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:54,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1092 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12103 states. [2025-02-05 15:41:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12103 to 12095. [2025-02-05 15:41:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12095 states, 10001 states have (on average 1.6594340565943406) internal successors, (16596), 10008 states have internal predecessors, (16596), 2067 states have call successors, (2067), 23 states have call predecessors, (2067), 26 states have return successors, (2262), 2065 states have call predecessors, (2262), 2066 states have call successors, (2262) [2025-02-05 15:41:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12095 states to 12095 states and 20925 transitions. [2025-02-05 15:41:54,940 INFO L78 Accepts]: Start accepts. Automaton has 12095 states and 20925 transitions. Word has length 122 [2025-02-05 15:41:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:54,941 INFO L471 AbstractCegarLoop]: Abstraction has 12095 states and 20925 transitions. [2025-02-05 15:41:54,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 12095 states and 20925 transitions. [2025-02-05 15:41:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:41:54,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:54,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:54,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:41:54,971 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:54,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:54,971 INFO L85 PathProgramCache]: Analyzing trace with hash -412008877, now seen corresponding path program 1 times [2025-02-05 15:41:54,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:54,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580316354] [2025-02-05 15:41:54,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:54,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:41:54,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:41:54,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:54,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:55,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:55,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580316354] [2025-02-05 15:41:55,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580316354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:55,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:55,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:55,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834568121] [2025-02-05 15:41:55,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:55,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:55,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:55,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:55,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:55,036 INFO L87 Difference]: Start difference. First operand 12095 states and 20925 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:55,726 INFO L93 Difference]: Finished difference Result 28928 states and 49988 transitions. [2025-02-05 15:41:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:55,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-02-05 15:41:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:55,828 INFO L225 Difference]: With dead ends: 28928 [2025-02-05 15:41:55,829 INFO L226 Difference]: Without dead ends: 18919 [2025-02-05 15:41:55,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:55,883 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 119 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:55,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1056 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18919 states. [2025-02-05 15:41:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18919 to 18911. [2025-02-05 15:41:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18911 states, 15614 states have (on average 1.6350070449596517) internal successors, (25529), 15621 states have internal predecessors, (25529), 3270 states have call successors, (3270), 23 states have call predecessors, (3270), 26 states have return successors, (3609), 3268 states have call predecessors, (3609), 3269 states have call successors, (3609) [2025-02-05 15:41:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18911 states to 18911 states and 32408 transitions. [2025-02-05 15:41:57,101 INFO L78 Accepts]: Start accepts. Automaton has 18911 states and 32408 transitions. Word has length 123 [2025-02-05 15:41:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:57,101 INFO L471 AbstractCegarLoop]: Abstraction has 18911 states and 32408 transitions. [2025-02-05 15:41:57,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 18911 states and 32408 transitions. [2025-02-05 15:41:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:41:57,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:57,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:57,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:41:57,137 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:57,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:57,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1390411681, now seen corresponding path program 1 times [2025-02-05 15:41:57,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:57,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331941361] [2025-02-05 15:41:57,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:57,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:41:57,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:41:57,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:57,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:57,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:57,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331941361] [2025-02-05 15:41:57,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331941361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:57,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:57,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940763311] [2025-02-05 15:41:57,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:57,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:57,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:57,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:57,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:57,213 INFO L87 Difference]: Start difference. First operand 18911 states and 32408 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:41:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:58,091 INFO L93 Difference]: Finished difference Result 49965 states and 85971 transitions. [2025-02-05 15:41:58,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:58,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-02-05 15:41:58,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:58,264 INFO L225 Difference]: With dead ends: 49965 [2025-02-05 15:41:58,264 INFO L226 Difference]: Without dead ends: 33774 [2025-02-05 15:41:58,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:58,332 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 117 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:58,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1084 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33774 states. [2025-02-05 15:41:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33774 to 33766. [2025-02-05 15:41:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33766 states, 28019 states have (on average 1.6320710946143688) internal successors, (45729), 28026 states have internal predecessors, (45729), 5720 states have call successors, (5720), 23 states have call predecessors, (5720), 26 states have return successors, (6333), 5718 states have call predecessors, (6333), 5719 states have call successors, (6333) [2025-02-05 15:42:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33766 states to 33766 states and 57782 transitions. [2025-02-05 15:42:00,146 INFO L78 Accepts]: Start accepts. Automaton has 33766 states and 57782 transitions. Word has length 124 [2025-02-05 15:42:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:00,147 INFO L471 AbstractCegarLoop]: Abstraction has 33766 states and 57782 transitions. [2025-02-05 15:42:00,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:42:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 33766 states and 57782 transitions. [2025-02-05 15:42:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:42:00,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:00,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:00,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:42:00,188 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:00,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:00,189 INFO L85 PathProgramCache]: Analyzing trace with hash 476551666, now seen corresponding path program 1 times [2025-02-05 15:42:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:00,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593932564] [2025-02-05 15:42:00,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:00,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:00,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:42:00,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:42:00,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:00,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:00,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:00,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593932564] [2025-02-05 15:42:00,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593932564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:00,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:00,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:00,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840323389] [2025-02-05 15:42:00,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:00,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:00,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:00,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:00,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:00,273 INFO L87 Difference]: Start difference. First operand 33766 states and 57782 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:42:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:02,083 INFO L93 Difference]: Finished difference Result 92057 states and 158058 transitions. [2025-02-05 15:42:02,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:02,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-02-05 15:42:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:02,534 INFO L225 Difference]: With dead ends: 92057 [2025-02-05 15:42:02,535 INFO L226 Difference]: Without dead ends: 61918 [2025-02-05 15:42:02,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:02,680 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 115 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:02,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1087 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61918 states. [2025-02-05 15:42:05,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61918 to 61910. [2025-02-05 15:42:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61910 states, 51650 states have (on average 1.6280929332042595) internal successors, (84091), 51657 states have internal predecessors, (84091), 10233 states have call successors, (10233), 23 states have call predecessors, (10233), 26 states have return successors, (11378), 10231 states have call predecessors, (11378), 10232 states have call successors, (11378) [2025-02-05 15:42:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61910 states to 61910 states and 105702 transitions. [2025-02-05 15:42:06,342 INFO L78 Accepts]: Start accepts. Automaton has 61910 states and 105702 transitions. Word has length 125 [2025-02-05 15:42:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:06,343 INFO L471 AbstractCegarLoop]: Abstraction has 61910 states and 105702 transitions. [2025-02-05 15:42:06,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:42:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 61910 states and 105702 transitions. [2025-02-05 15:42:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:42:06,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:06,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:06,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:42:06,387 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:06,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1236514, now seen corresponding path program 1 times [2025-02-05 15:42:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:06,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184381632] [2025-02-05 15:42:06,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:06,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:06,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:42:06,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:42:06,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:06,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:06,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:06,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184381632] [2025-02-05 15:42:06,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184381632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:06,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:06,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:06,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265563228] [2025-02-05 15:42:06,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:06,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:06,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:06,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:06,473 INFO L87 Difference]: Start difference. First operand 61910 states and 105702 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:42:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:08,983 INFO L93 Difference]: Finished difference Result 115923 states and 198356 transitions. [2025-02-05 15:42:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:08,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-02-05 15:42:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:09,640 INFO L225 Difference]: With dead ends: 115923 [2025-02-05 15:42:09,640 INFO L226 Difference]: Without dead ends: 115758 [2025-02-05 15:42:09,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:09,894 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 110 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:09,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1098 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:42:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115758 states. [2025-02-05 15:42:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115758 to 115750. [2025-02-05 15:42:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115750 states, 97122 states have (on average 1.622969049237042) internal successors, (157626), 97129 states have internal predecessors, (157626), 18601 states have call successors, (18601), 23 states have call predecessors, (18601), 26 states have return successors, (20792), 18599 states have call predecessors, (20792), 18600 states have call successors, (20792) [2025-02-05 15:42:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115750 states to 115750 states and 197019 transitions. [2025-02-05 15:42:14,570 INFO L78 Accepts]: Start accepts. Automaton has 115750 states and 197019 transitions. Word has length 126 [2025-02-05 15:42:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:14,571 INFO L471 AbstractCegarLoop]: Abstraction has 115750 states and 197019 transitions. [2025-02-05 15:42:14,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:42:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 115750 states and 197019 transitions. [2025-02-05 15:42:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:42:14,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:14,609 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:14,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:42:14,609 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:14,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1887679825, now seen corresponding path program 1 times [2025-02-05 15:42:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:14,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916685322] [2025-02-05 15:42:14,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:14,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:14,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:42:14,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:42:14,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:14,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:14,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916685322] [2025-02-05 15:42:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916685322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:14,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:14,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 15:42:14,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614001747] [2025-02-05 15:42:14,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:42:14,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:14,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:42:14,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:42:14,947 INFO L87 Difference]: Start difference. First operand 115750 states and 197019 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-05 15:42:21,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:21,070 INFO L93 Difference]: Finished difference Result 230594 states and 397987 transitions. [2025-02-05 15:42:21,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 15:42:21,071 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 127 [2025-02-05 15:42:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:22,768 INFO L225 Difference]: With dead ends: 230594 [2025-02-05 15:42:22,768 INFO L226 Difference]: Without dead ends: 230435 [2025-02-05 15:42:22,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:42:22,886 INFO L435 NwaCegarLoop]: 640 mSDtfsCounter, 1383 mSDsluCounter, 5485 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 6125 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:22,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 6125 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 15:42:23,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230435 states.