./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product35.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_spec0_product35.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 7ed16a2a74d5e33f66ab9b575b27ed24f9a6964adc1478fcc08a5f7b11595b14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:40:15,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:40:16,010 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:40:16,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:40:16,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:40:16,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:40:16,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:40:16,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:40:16,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:40:16,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:40:16,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:40:16,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:40:16,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:40:16,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:40:16,035 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:40:16,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:40:16,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:16,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:40:16,036 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:40:16,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:40:16,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:40:16,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:40:16,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:40:16,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:40:16,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:40:16,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:40:16,037 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 -> 7ed16a2a74d5e33f66ab9b575b27ed24f9a6964adc1478fcc08a5f7b11595b14 [2025-02-05 15:40:16,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:40:16,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:40:16,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:40:16,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:40:16,283 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:40:16,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product35.cil.c [2025-02-05 15:40:17,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7117634fb/fe9a9d905ec7418e92ba815cb456aec6/FLAG82b0ede54 [2025-02-05 15:40:17,846 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:40:17,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product35.cil.c [2025-02-05 15:40:17,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7117634fb/fe9a9d905ec7418e92ba815cb456aec6/FLAG82b0ede54 [2025-02-05 15:40:18,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7117634fb/fe9a9d905ec7418e92ba815cb456aec6 [2025-02-05 15:40:18,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:40:18,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:40:18,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:18,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:40:18,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:40:18,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230acf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18, skipping insertion in model container [2025-02-05 15:40:18,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:40:18,325 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_spec0_product35.cil.c[5573,5586] [2025-02-05 15:40:18,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:18,573 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:40:18,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-02-05 15:40:18,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [66] [2025-02-05 15:40:18,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [225] [2025-02-05 15:40:18,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [234] [2025-02-05 15:40:18,581 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [600] [2025-02-05 15:40:18,581 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [620] [2025-02-05 15:40:18,581 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [658] [2025-02-05 15:40:18,581 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1108] [2025-02-05 15:40:18,582 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2179] [2025-02-05 15:40:18,582 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2412] [2025-02-05 15:40:18,582 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2710] [2025-02-05 15:40:18,594 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_spec0_product35.cil.c[5573,5586] [2025-02-05 15:40:18,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:18,700 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:40:18,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18 WrapperNode [2025-02-05 15:40:18,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:18,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:18,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:40:18,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:40:18,706 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:40:18" (1/1) ... [2025-02-05 15:40:18,723 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:40:18" (1/1) ... [2025-02-05 15:40:18,768 INFO L138 Inliner]: procedures = 137, calls = 226, calls flagged for inlining = 66, calls inlined = 63, statements flattened = 1141 [2025-02-05 15:40:18,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:18,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:40:18,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:40:18,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:40:18,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,820 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:40:18,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:40:18,847 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:40:18,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:40:18,847 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:40:18,852 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (1/1) ... [2025-02-05 15:40:18,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:18,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:18,881 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:40:18,883 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:40:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:40:18,899 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:40:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:40:18,899 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:40:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:40:18,899 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:40:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:40:18,899 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:40:18,899 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:40:18,900 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:40:18,900 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:40:18,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:40:18,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:40:19,091 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:40:19,096 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:40:19,361 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3014: #res := ~retValue_acc~41; [2025-02-05 15:40:19,373 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L990: #res := ~retValue_acc~14; [2025-02-05 15:40:19,444 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1813: #res#1 := ~retValue_acc~26#1; [2025-02-05 15:40:19,445 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1768-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~25#1; [2025-02-05 15:40:19,465 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2037: #res := ~retValue_acc~29; [2025-02-05 15:40:19,478 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1721: #res := ~retValue_acc~24; [2025-02-05 15:40:19,490 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L222-1: createEmail_#res#1 := createEmail_~retValue_acc~4#1; [2025-02-05 15:40:19,497 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1265: #res := ~retValue_acc~18; [2025-02-05 15:40:19,506 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2940: #res := ~retValue_acc~39; [2025-02-05 15:40:19,543 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2977: #res := ~retValue_acc~40; [2025-02-05 15:40:19,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3051: #res := ~retValue_acc~42; [2025-02-05 15:40:19,574 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2825: #res := ~retValue_acc~36; [2025-02-05 15:40:19,616 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1591: #res := ~retValue_acc~22; [2025-02-05 15:40:19,741 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2109-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~30#1; [2025-02-05 15:40:19,741 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1674-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~23#1; [2025-02-05 15:40:19,741 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088-1: isVerified_#res#1 := isVerified_~retValue_acc~43#1; [2025-02-05 15:40:19,741 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2156-1: getClientId_#res#1 := getClientId_~retValue_acc~31#1; [2025-02-05 15:40:19,741 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751-1: getEmailId_#res#1 := getEmailId_~retValue_acc~34#1; [2025-02-05 15:40:19,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L947-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~11#1; [2025-02-05 15:40:19,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L965-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~13#1; [2025-02-05 15:40:19,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1876-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~27#1; [2025-02-05 15:40:19,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L655-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-02-05 15:40:19,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L956-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~12#1; [2025-02-05 15:40:19,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1983-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~28#1; [2025-02-05 15:40:19,957 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788: #res := ~retValue_acc~35; [2025-02-05 15:40:19,965 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L178-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~1#1; [2025-02-05 15:40:19,965 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L198: #res#1 := ~retValue_acc~2#1; [2025-02-05 15:40:20,106 INFO L? ?]: Removed 604 outVars from TransFormulas that were not future-live. [2025-02-05 15:40:20,106 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:40:20,124 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:40:20,124 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:40:20,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:20 BoogieIcfgContainer [2025-02-05 15:40:20,124 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:40:20,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:40:20,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:40:20,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:40:20,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:40:18" (1/3) ... [2025-02-05 15:40:20,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6ce46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:20, skipping insertion in model container [2025-02-05 15:40:20,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:18" (2/3) ... [2025-02-05 15:40:20,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6ce46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:20, skipping insertion in model container [2025-02-05 15:40:20,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:20" (3/3) ... [2025-02-05 15:40:20,134 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product35.cil.c [2025-02-05 15:40:20,145 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:40:20,148 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product35.cil.c that has 30 procedures, 462 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:40:20,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:40:20,203 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;@4cd17afc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:40:20,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:40:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 462 states, 357 states have (on average 1.535014005602241) internal successors, (548), 362 states have internal predecessors, (548), 74 states have call successors, (74), 29 states have call predecessors, (74), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 15:40:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 15:40:20,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:20,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:20,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:20,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1569739239, now seen corresponding path program 1 times [2025-02-05 15:40:20,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:20,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161627650] [2025-02-05 15:40:20,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:20,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:40:20,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:40:20,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:20,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 15:40:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161627650] [2025-02-05 15:40:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161627650] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184591495] [2025-02-05 15:40:20,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:20,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:20,809 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:40:20,810 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:40:20,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:40:21,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:40:21,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:21,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:21,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:40:21,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 15:40:21,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184591495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:21,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:21,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:40:21,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680691869] [2025-02-05 15:40:21,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:21,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:40:21,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:21,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:40:21,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:21,203 INFO L87 Difference]: Start difference. First operand has 462 states, 357 states have (on average 1.535014005602241) internal successors, (548), 362 states have internal predecessors, (548), 74 states have call successors, (74), 29 states have call predecessors, (74), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:21,260 INFO L93 Difference]: Finished difference Result 727 states and 1076 transitions. [2025-02-05 15:40:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:40:21,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 158 [2025-02-05 15:40:21,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:21,270 INFO L225 Difference]: With dead ends: 727 [2025-02-05 15:40:21,270 INFO L226 Difference]: Without dead ends: 455 [2025-02-05 15:40:21,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 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:40:21,275 INFO L435 NwaCegarLoop]: 693 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, 693 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:40:21,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-02-05 15:40:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2025-02-05 15:40:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 351 states have (on average 1.5327635327635327) internal successors, (538), 355 states have internal predecessors, (538), 74 states have call successors, (74), 29 states have call predecessors, (74), 29 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-05 15:40:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 685 transitions. [2025-02-05 15:40:21,323 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 685 transitions. Word has length 158 [2025-02-05 15:40:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:21,323 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 685 transitions. [2025-02-05 15:40:21,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 685 transitions. [2025-02-05 15:40:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 15:40:21,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:21,327 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:21,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:21,532 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:40:21,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:21,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:21,534 INFO L85 PathProgramCache]: Analyzing trace with hash 171064099, now seen corresponding path program 1 times [2025-02-05 15:40:21,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:21,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929160741] [2025-02-05 15:40:21,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:21,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 15:40:21,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 15:40:21,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:21,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 15:40:21,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929160741] [2025-02-05 15:40:21,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929160741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:21,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912593617] [2025-02-05 15:40:21,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:21,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:21,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:21,847 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:40:21,848 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:40:22,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 15:40:22,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 15:40:22,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:22,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:22,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:40:22,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-05 15:40:22,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912593617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:22,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:40:22,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524553035] [2025-02-05 15:40:22,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:22,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:22,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:22,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:22,253 INFO L87 Difference]: Start difference. First operand 455 states and 685 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:22,297 INFO L93 Difference]: Finished difference Result 716 states and 1054 transitions. [2025-02-05 15:40:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:22,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 178 [2025-02-05 15:40:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:22,303 INFO L225 Difference]: With dead ends: 716 [2025-02-05 15:40:22,303 INFO L226 Difference]: Without dead ends: 457 [2025-02-05 15:40:22,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 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:40:22,305 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 0 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1366 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:40:22,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1366 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-02-05 15:40:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2025-02-05 15:40:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 353 states have (on average 1.5297450424929178) internal successors, (540), 357 states have internal predecessors, (540), 74 states have call successors, (74), 29 states have call predecessors, (74), 29 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-02-05 15:40:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 687 transitions. [2025-02-05 15:40:22,337 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 687 transitions. Word has length 178 [2025-02-05 15:40:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:22,338 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 687 transitions. [2025-02-05 15:40:22,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 687 transitions. [2025-02-05 15:40:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 15:40:22,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:22,341 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:22,349 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:40:22,546 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:40:22,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:22,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:22,547 INFO L85 PathProgramCache]: Analyzing trace with hash -690046288, now seen corresponding path program 1 times [2025-02-05 15:40:22,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:22,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047824796] [2025-02-05 15:40:22,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:22,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:22,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 15:40:22,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 15:40:22,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:22,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:22,775 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:40:22,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:22,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047824796] [2025-02-05 15:40:22,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047824796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:22,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752128047] [2025-02-05 15:40:22,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:22,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:22,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:22,777 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:40:22,779 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:40:22,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 15:40:23,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 15:40:23,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:23,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:23,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:23,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 15:40:23,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:23,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752128047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:23,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:23,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:40:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484683091] [2025-02-05 15:40:23,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:23,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:23,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:23,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:23,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:23,114 INFO L87 Difference]: Start difference. First operand 457 states and 687 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:23,153 INFO L93 Difference]: Finished difference Result 966 states and 1473 transitions. [2025-02-05 15:40:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:23,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 167 [2025-02-05 15:40:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:23,158 INFO L225 Difference]: With dead ends: 966 [2025-02-05 15:40:23,158 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:40:23,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 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:40:23,161 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 142 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:23,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1336 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:40:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 528. [2025-02-05 15:40:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 410 states have (on average 1.551219512195122) internal successors, (636), 414 states have internal predecessors, (636), 88 states have call successors, (88), 29 states have call predecessors, (88), 29 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-02-05 15:40:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 811 transitions. [2025-02-05 15:40:23,184 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 811 transitions. Word has length 167 [2025-02-05 15:40:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:23,185 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 811 transitions. [2025-02-05 15:40:23,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:23,185 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 811 transitions. [2025-02-05 15:40:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 15:40:23,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:23,188 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:23,197 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:40:23,388 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:40:23,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:23,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1823295735, now seen corresponding path program 1 times [2025-02-05 15:40:23,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:23,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328169921] [2025-02-05 15:40:23,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:23,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:23,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:40:23,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:40:23,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:23,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:40:23,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:23,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328169921] [2025-02-05 15:40:23,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328169921] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:23,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93953143] [2025-02-05 15:40:23,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:23,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:23,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:23,717 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:40:23,718 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:40:23,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:40:24,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:40:24,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:24,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:24,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:40:24,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:40:24,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:24,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93953143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:24,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:24,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:40:24,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453190016] [2025-02-05 15:40:24,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:24,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:24,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:24,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:24,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:24,119 INFO L87 Difference]: Start difference. First operand 528 states and 811 transitions. Second operand has 5 states, 4 states have (on average 25.5) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:40:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:24,189 INFO L93 Difference]: Finished difference Result 1047 states and 1612 transitions. [2025-02-05 15:40:24,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:24,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.5) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 168 [2025-02-05 15:40:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:24,192 INFO L225 Difference]: With dead ends: 1047 [2025-02-05 15:40:24,192 INFO L226 Difference]: Without dead ends: 530 [2025-02-05 15:40:24,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:24,195 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 2 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2697 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:40:24,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2697 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-02-05 15:40:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-02-05 15:40:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 411 states have (on average 1.5498783454987834) internal successors, (637), 416 states have internal predecessors, (637), 88 states have call successors, (88), 29 states have call predecessors, (88), 30 states have return successors, (89), 86 states have call predecessors, (89), 87 states have call successors, (89) [2025-02-05 15:40:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 814 transitions. [2025-02-05 15:40:24,220 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 814 transitions. Word has length 168 [2025-02-05 15:40:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:24,221 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 814 transitions. [2025-02-05 15:40:24,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.5) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:40:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 814 transitions. [2025-02-05 15:40:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 15:40:24,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:24,224 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:24,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:24,429 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:40:24,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:24,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:24,429 INFO L85 PathProgramCache]: Analyzing trace with hash 758785276, now seen corresponding path program 1 times [2025-02-05 15:40:24,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240693156] [2025-02-05 15:40:24,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:24,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 15:40:24,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 15:40:24,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:24,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:40:24,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:24,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240693156] [2025-02-05 15:40:24,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240693156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:24,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540606724] [2025-02-05 15:40:24,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:24,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:24,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:24,625 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:40:24,634 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:40:24,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 15:40:25,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 15:40:25,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:25,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:25,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:40:25,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:40:25,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:25,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540606724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:25,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:25,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:40:25,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822942647] [2025-02-05 15:40:25,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:25,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:25,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:25,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:25,103 INFO L87 Difference]: Start difference. First operand 530 states and 814 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:40:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:25,181 INFO L93 Difference]: Finished difference Result 1049 states and 1617 transitions. [2025-02-05 15:40:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:25,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 169 [2025-02-05 15:40:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:25,185 INFO L225 Difference]: With dead ends: 1049 [2025-02-05 15:40:25,185 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:40:25,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 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:40:25,188 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 2 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2683 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:40:25,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2683 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:25,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:40:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:40:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 412 states have (on average 1.5485436893203883) internal successors, (638), 418 states have internal predecessors, (638), 88 states have call successors, (88), 29 states have call predecessors, (88), 31 states have return successors, (94), 86 states have call predecessors, (94), 87 states have call successors, (94) [2025-02-05 15:40:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 820 transitions. [2025-02-05 15:40:25,218 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 820 transitions. Word has length 169 [2025-02-05 15:40:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:25,218 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 820 transitions. [2025-02-05 15:40:25,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:40:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 820 transitions. [2025-02-05 15:40:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 15:40:25,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:25,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:25,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:25,425 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:40:25,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash -355174557, now seen corresponding path program 1 times [2025-02-05 15:40:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:25,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145413503] [2025-02-05 15:40:25,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:25,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:25,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 15:40:25,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 15:40:25,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:25,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 15:40:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:25,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145413503] [2025-02-05 15:40:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145413503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:25,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:25,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:25,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215600264] [2025-02-05 15:40:25,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:25,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:25,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:25,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:25,618 INFO L87 Difference]: Start difference. First operand 532 states and 820 transitions. Second operand has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-05 15:40:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:25,743 INFO L93 Difference]: Finished difference Result 1041 states and 1608 transitions. [2025-02-05 15:40:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) Word has length 189 [2025-02-05 15:40:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:25,777 INFO L225 Difference]: With dead ends: 1041 [2025-02-05 15:40:25,777 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:40:25,809 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:40:25,817 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 2 mSDsluCounter, 2023 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2701 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:25,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2701 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:40:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:40:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 412 states have (on average 1.5485436893203883) internal successors, (638), 418 states have internal predecessors, (638), 88 states have call successors, (88), 29 states have call predecessors, (88), 31 states have return successors, (93), 86 states have call predecessors, (93), 87 states have call successors, (93) [2025-02-05 15:40:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 819 transitions. [2025-02-05 15:40:25,836 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 819 transitions. Word has length 189 [2025-02-05 15:40:25,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:25,837 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 819 transitions. [2025-02-05 15:40:25,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (22), 2 states have call predecessors, (22), 3 states have call successors, (22) [2025-02-05 15:40:25,837 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 819 transitions. [2025-02-05 15:40:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 15:40:25,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:25,840 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:25,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:40:25,840 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:25,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:25,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2134944463, now seen corresponding path program 1 times [2025-02-05 15:40:25,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:25,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411354003] [2025-02-05 15:40:25,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:25,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:25,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 15:40:25,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 15:40:25,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:25,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:40:26,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:26,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411354003] [2025-02-05 15:40:26,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411354003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:26,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:26,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:26,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326749296] [2025-02-05 15:40:26,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:26,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:26,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:26,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:26,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:26,170 INFO L87 Difference]: Start difference. First operand 532 states and 819 transitions. Second operand has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:40:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:26,250 INFO L93 Difference]: Finished difference Result 1043 states and 1611 transitions. [2025-02-05 15:40:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:26,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 171 [2025-02-05 15:40:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:26,253 INFO L225 Difference]: With dead ends: 1043 [2025-02-05 15:40:26,253 INFO L226 Difference]: Without dead ends: 534 [2025-02-05 15:40:26,256 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:40:26,257 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 1 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2704 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:26,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2704 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-05 15:40:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-02-05 15:40:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 413 states have (on average 1.5472154963680387) internal successors, (639), 420 states have internal predecessors, (639), 88 states have call successors, (88), 29 states have call predecessors, (88), 32 states have return successors, (95), 86 states have call predecessors, (95), 87 states have call successors, (95) [2025-02-05 15:40:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 822 transitions. [2025-02-05 15:40:26,287 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 822 transitions. Word has length 171 [2025-02-05 15:40:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:26,287 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 822 transitions. [2025-02-05 15:40:26,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:40:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 822 transitions. [2025-02-05 15:40:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 15:40:26,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:26,301 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:26,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:40:26,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:26,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1734060073, now seen corresponding path program 1 times [2025-02-05 15:40:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096417809] [2025-02-05 15:40:26,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:26,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 15:40:26,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 15:40:26,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:26,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:40:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:26,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096417809] [2025-02-05 15:40:26,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096417809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:26,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:26,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:40:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895454657] [2025-02-05 15:40:26,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:26,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:40:26,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:26,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:40:26,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:26,509 INFO L87 Difference]: Start difference. First operand 534 states and 822 transitions. Second operand has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 15:40:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:26,672 INFO L93 Difference]: Finished difference Result 1045 states and 1610 transitions. [2025-02-05 15:40:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:40:26,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 172 [2025-02-05 15:40:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:26,675 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 15:40:26,675 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:40:26,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:40:26,680 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 7 mSDsluCounter, 3985 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4654 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:26,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4654 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:40:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-05 15:40:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 415 states have (on average 1.544578313253012) internal successors, (641), 421 states have internal predecessors, (641), 88 states have call successors, (88), 30 states have call predecessors, (88), 32 states have return successors, (94), 86 states have call predecessors, (94), 87 states have call successors, (94) [2025-02-05 15:40:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 823 transitions. [2025-02-05 15:40:26,698 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 823 transitions. Word has length 172 [2025-02-05 15:40:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:26,698 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 823 transitions. [2025-02-05 15:40:26,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 15:40:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 823 transitions. [2025-02-05 15:40:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 15:40:26,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:26,701 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:26,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:40:26,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:26,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:26,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1156664253, now seen corresponding path program 2 times [2025-02-05 15:40:26,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:26,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754909923] [2025-02-05 15:40:26,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:40:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:26,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 173 statements into 2 equivalence classes. [2025-02-05 15:40:26,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 15:40:26,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:40:26,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-05 15:40:26,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:26,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754909923] [2025-02-05 15:40:26,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754909923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:26,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:26,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:40:26,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455820310] [2025-02-05 15:40:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:26,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:40:26,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:26,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:40:26,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:26,836 INFO L87 Difference]: Start difference. First operand 536 states and 823 transitions. Second operand has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 15:40:26,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:26,905 INFO L93 Difference]: Finished difference Result 1045 states and 1614 transitions. [2025-02-05 15:40:26,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:40:26,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 173 [2025-02-05 15:40:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:26,909 INFO L225 Difference]: With dead ends: 1045 [2025-02-05 15:40:26,909 INFO L226 Difference]: Without dead ends: 538 [2025-02-05 15:40:26,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:26,912 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 2 mSDsluCounter, 2685 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:26,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3362 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-02-05 15:40:26,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-02-05 15:40:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 416 states have (on average 1.5432692307692308) internal successors, (642), 423 states have internal predecessors, (642), 88 states have call successors, (88), 30 states have call predecessors, (88), 33 states have return successors, (99), 86 states have call predecessors, (99), 87 states have call successors, (99) [2025-02-05 15:40:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 829 transitions. [2025-02-05 15:40:26,931 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 829 transitions. Word has length 173 [2025-02-05 15:40:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:26,932 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 829 transitions. [2025-02-05 15:40:26,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.166666666666668) internal successors, (103), 7 states have internal predecessors, (103), 4 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 15:40:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 829 transitions. [2025-02-05 15:40:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 15:40:26,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:26,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:26,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:40:26,935 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:26,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1839836154, now seen corresponding path program 1 times [2025-02-05 15:40:26,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:26,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724696952] [2025-02-05 15:40:26,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:26,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:26,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 15:40:26,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 15:40:26,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:26,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 15:40:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724696952] [2025-02-05 15:40:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724696952] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478612512] [2025-02-05 15:40:27,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:27,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:27,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:27,092 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:40:27,094 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:40:27,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 15:40:27,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 15:40:27,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:27,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:27,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:27,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:27,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:40:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:27,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478612512] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:40:27,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:40:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:40:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362350429] [2025-02-05 15:40:27,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:40:27,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:40:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:27,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:40:27,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:27,512 INFO L87 Difference]: Start difference. First operand 538 states and 829 transitions. Second operand has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-05 15:40:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:28,091 INFO L93 Difference]: Finished difference Result 1509 states and 2426 transitions. [2025-02-05 15:40:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:40:28,092 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) Word has length 174 [2025-02-05 15:40:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:28,098 INFO L225 Difference]: With dead ends: 1509 [2025-02-05 15:40:28,098 INFO L226 Difference]: Without dead ends: 1002 [2025-02-05 15:40:28,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:40:28,101 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1404 mSDsluCounter, 4752 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 5420 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:28,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 5420 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:40:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-02-05 15:40:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 976. [2025-02-05 15:40:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 775 states have (on average 1.6038709677419354) internal successors, (1243), 782 states have internal predecessors, (1243), 167 states have call successors, (167), 30 states have call predecessors, (167), 33 states have return successors, (188), 165 states have call predecessors, (188), 166 states have call successors, (188) [2025-02-05 15:40:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1598 transitions. [2025-02-05 15:40:28,155 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1598 transitions. Word has length 174 [2025-02-05 15:40:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:28,157 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1598 transitions. [2025-02-05 15:40:28,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-05 15:40:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1598 transitions. [2025-02-05 15:40:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 15:40:28,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:28,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:28,178 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:40:28,365 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:40:28,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:28,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash 716196856, now seen corresponding path program 1 times [2025-02-05 15:40:28,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:28,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084150596] [2025-02-05 15:40:28,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:28,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:28,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 15:40:28,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 15:40:28,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:28,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:28,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:28,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084150596] [2025-02-05 15:40:28,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084150596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:28,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:28,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:28,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757523443] [2025-02-05 15:40:28,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:28,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:28,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:28,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:28,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:28,418 INFO L87 Difference]: Start difference. First operand 976 states and 1598 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:28,483 INFO L93 Difference]: Finished difference Result 2292 states and 3814 transitions. [2025-02-05 15:40:28,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:28,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 177 [2025-02-05 15:40:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:28,491 INFO L225 Difference]: With dead ends: 2292 [2025-02-05 15:40:28,491 INFO L226 Difference]: Without dead ends: 1394 [2025-02-05 15:40:28,494 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:40:28,494 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 139 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1360 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:40:28,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1360 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-02-05 15:40:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1386. [2025-02-05 15:40:28,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1106 states have (on average 1.6256781193490055) internal successors, (1798), 1113 states have internal predecessors, (1798), 246 states have call successors, (246), 30 states have call predecessors, (246), 33 states have return successors, (277), 244 states have call predecessors, (277), 245 states have call successors, (277) [2025-02-05 15:40:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2321 transitions. [2025-02-05 15:40:28,542 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2321 transitions. Word has length 177 [2025-02-05 15:40:28,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:28,542 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 2321 transitions. [2025-02-05 15:40:28,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2321 transitions. [2025-02-05 15:40:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 15:40:28,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:28,549 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:28,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:40:28,549 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:28,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:28,550 INFO L85 PathProgramCache]: Analyzing trace with hash 453572689, now seen corresponding path program 1 times [2025-02-05 15:40:28,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:28,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254785179] [2025-02-05 15:40:28,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:28,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 15:40:28,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 15:40:28,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:28,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 15:40:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:28,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254785179] [2025-02-05 15:40:28,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254785179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:28,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:28,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:28,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523623066] [2025-02-05 15:40:28,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:28,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:28,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:28,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:28,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:28,616 INFO L87 Difference]: Start difference. First operand 1386 states and 2321 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:28,668 INFO L93 Difference]: Finished difference Result 3320 states and 5600 transitions. [2025-02-05 15:40:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:28,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 197 [2025-02-05 15:40:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:28,679 INFO L225 Difference]: With dead ends: 3320 [2025-02-05 15:40:28,679 INFO L226 Difference]: Without dead ends: 2063 [2025-02-05 15:40:28,683 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:40:28,684 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 137 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1360 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:40:28,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1360 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-02-05 15:40:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2055. [2025-02-05 15:40:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1656 states have (on average 1.6376811594202898) internal successors, (2712), 1663 states have internal predecessors, (2712), 365 states have call successors, (365), 30 states have call predecessors, (365), 33 states have return successors, (396), 363 states have call predecessors, (396), 364 states have call successors, (396) [2025-02-05 15:40:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3473 transitions. [2025-02-05 15:40:28,754 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3473 transitions. Word has length 197 [2025-02-05 15:40:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:28,754 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 3473 transitions. [2025-02-05 15:40:28,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3473 transitions. [2025-02-05 15:40:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 15:40:28,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:28,763 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:28,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:40:28,764 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:28,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:28,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1907196424, now seen corresponding path program 1 times [2025-02-05 15:40:28,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:28,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043521439] [2025-02-05 15:40:28,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:28,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:28,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 15:40:28,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 15:40:28,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:28,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 15:40:28,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:28,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043521439] [2025-02-05 15:40:28,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043521439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:28,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:28,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:28,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296839822] [2025-02-05 15:40:28,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:28,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:28,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:28,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:28,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:28,829 INFO L87 Difference]: Start difference. First operand 2055 states and 3473 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:28,986 INFO L93 Difference]: Finished difference Result 4887 states and 8327 transitions. [2025-02-05 15:40:28,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:28,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 198 [2025-02-05 15:40:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:29,004 INFO L225 Difference]: With dead ends: 4887 [2025-02-05 15:40:29,004 INFO L226 Difference]: Without dead ends: 3093 [2025-02-05 15:40:29,011 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:40:29,012 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 135 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1357 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:40:29,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1357 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3093 states. [2025-02-05 15:40:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3093 to 3085. [2025-02-05 15:40:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3085 states, 2524 states have (on average 1.6469889064976229) internal successors, (4157), 2531 states have internal predecessors, (4157), 527 states have call successors, (527), 30 states have call predecessors, (527), 33 states have return successors, (574), 525 states have call predecessors, (574), 526 states have call successors, (574) [2025-02-05 15:40:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 5258 transitions. [2025-02-05 15:40:29,148 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 5258 transitions. Word has length 198 [2025-02-05 15:40:29,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:29,148 INFO L471 AbstractCegarLoop]: Abstraction has 3085 states and 5258 transitions. [2025-02-05 15:40:29,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 5258 transitions. [2025-02-05 15:40:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 15:40:29,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:29,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:29,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:40:29,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:29,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1423177104, now seen corresponding path program 1 times [2025-02-05 15:40:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:29,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430278065] [2025-02-05 15:40:29,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:29,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:29,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 15:40:29,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 15:40:29,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:29,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 15:40:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430278065] [2025-02-05 15:40:29,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430278065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:29,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:29,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109955530] [2025-02-05 15:40:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:29,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:29,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:29,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:29,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:29,229 INFO L87 Difference]: Start difference. First operand 3085 states and 5258 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:29,318 INFO L93 Difference]: Finished difference Result 7370 states and 12654 transitions. [2025-02-05 15:40:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:29,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 199 [2025-02-05 15:40:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:29,342 INFO L225 Difference]: With dead ends: 7370 [2025-02-05 15:40:29,342 INFO L226 Difference]: Without dead ends: 4761 [2025-02-05 15:40:29,353 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:40:29,354 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 133 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1357 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:40:29,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1357 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2025-02-05 15:40:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4753. [2025-02-05 15:40:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4753 states, 3947 states have (on average 1.6536610083607803) internal successors, (6527), 3954 states have internal predecessors, (6527), 772 states have call successors, (772), 30 states have call predecessors, (772), 33 states have return successors, (845), 770 states have call predecessors, (845), 771 states have call successors, (845) [2025-02-05 15:40:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4753 states to 4753 states and 8144 transitions. [2025-02-05 15:40:29,541 INFO L78 Accepts]: Start accepts. Automaton has 4753 states and 8144 transitions. Word has length 199 [2025-02-05 15:40:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:29,542 INFO L471 AbstractCegarLoop]: Abstraction has 4753 states and 8144 transitions. [2025-02-05 15:40:29,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:29,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4753 states and 8144 transitions. [2025-02-05 15:40:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 15:40:29,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:29,561 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:29,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:40:29,561 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:29,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:29,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1461395946, now seen corresponding path program 1 times [2025-02-05 15:40:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911618863] [2025-02-05 15:40:29,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:29,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-05 15:40:29,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 15:40:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:29,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:29,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911618863] [2025-02-05 15:40:29,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911618863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:29,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:29,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:29,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673111241] [2025-02-05 15:40:29,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:29,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:29,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:29,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:29,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:29,609 INFO L87 Difference]: Start difference. First operand 4753 states and 8144 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:29,783 INFO L93 Difference]: Finished difference Result 11515 states and 19875 transitions. [2025-02-05 15:40:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 181 [2025-02-05 15:40:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:29,820 INFO L225 Difference]: With dead ends: 11515 [2025-02-05 15:40:29,820 INFO L226 Difference]: Without dead ends: 7565 [2025-02-05 15:40:29,834 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:40:29,834 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 131 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1365 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:40:29,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1365 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7565 states. [2025-02-05 15:40:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7565 to 7557. [2025-02-05 15:40:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7557 states, 6258 states have (on average 1.6534036433365293) internal successors, (10347), 6265 states have internal predecessors, (10347), 1265 states have call successors, (1265), 30 states have call predecessors, (1265), 33 states have return successors, (1382), 1263 states have call predecessors, (1382), 1264 states have call successors, (1382) [2025-02-05 15:40:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7557 states to 7557 states and 12994 transitions. [2025-02-05 15:40:30,116 INFO L78 Accepts]: Start accepts. Automaton has 7557 states and 12994 transitions. Word has length 181 [2025-02-05 15:40:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:30,116 INFO L471 AbstractCegarLoop]: Abstraction has 7557 states and 12994 transitions. [2025-02-05 15:40:30,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 7557 states and 12994 transitions. [2025-02-05 15:40:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 15:40:30,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:30,153 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:30,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:40:30,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:30,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 564430031, now seen corresponding path program 1 times [2025-02-05 15:40:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:30,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726351707] [2025-02-05 15:40:30,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:30,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:30,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 15:40:30,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 15:40:30,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:30,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 15:40:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:30,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726351707] [2025-02-05 15:40:30,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726351707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:30,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:30,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642585101] [2025-02-05 15:40:30,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:30,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:30,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:30,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:30,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:30,212 INFO L87 Difference]: Start difference. First operand 7557 states and 12994 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:30,453 INFO L93 Difference]: Finished difference Result 19025 states and 32935 transitions. [2025-02-05 15:40:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 201 [2025-02-05 15:40:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:30,507 INFO L225 Difference]: With dead ends: 19025 [2025-02-05 15:40:30,507 INFO L226 Difference]: Without dead ends: 12667 [2025-02-05 15:40:30,529 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:40:30,530 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 129 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1370 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:40:30,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1370 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12667 states. [2025-02-05 15:40:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12667 to 12659. [2025-02-05 15:40:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 10538 states have (on average 1.654773201746062) internal successors, (17438), 10545 states have internal predecessors, (17438), 2087 states have call successors, (2087), 30 states have call predecessors, (2087), 33 states have return successors, (2282), 2085 states have call predecessors, (2282), 2086 states have call successors, (2282) [2025-02-05 15:40:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 21807 transitions. [2025-02-05 15:40:31,083 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 21807 transitions. Word has length 201 [2025-02-05 15:40:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:31,084 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 21807 transitions. [2025-02-05 15:40:31,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 21807 transitions. [2025-02-05 15:40:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 15:40:31,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:31,132 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:31,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:40:31,132 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:31,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash -625090091, now seen corresponding path program 1 times [2025-02-05 15:40:31,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:31,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734642150] [2025-02-05 15:40:31,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:31,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 15:40:31,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 15:40:31,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:31,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:31,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:31,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734642150] [2025-02-05 15:40:31,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734642150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:31,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:31,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:31,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641736480] [2025-02-05 15:40:31,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:31,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:31,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:31,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:31,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:31,203 INFO L87 Difference]: Start difference. First operand 12659 states and 21807 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:31,539 INFO L93 Difference]: Finished difference Result 30306 states and 52152 transitions. [2025-02-05 15:40:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 183 [2025-02-05 15:40:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:31,603 INFO L225 Difference]: With dead ends: 30306 [2025-02-05 15:40:31,604 INFO L226 Difference]: Without dead ends: 19843 [2025-02-05 15:40:31,631 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:40:31,632 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 127 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1334 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:31,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1334 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19843 states. [2025-02-05 15:40:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19843 to 19835. [2025-02-05 15:40:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19835 states, 16511 states have (on average 1.632063472836291) internal successors, (26947), 16518 states have internal predecessors, (26947), 3290 states have call successors, (3290), 30 states have call predecessors, (3290), 33 states have return successors, (3629), 3288 states have call predecessors, (3629), 3289 states have call successors, (3629) [2025-02-05 15:40:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19835 states to 19835 states and 33866 transitions. [2025-02-05 15:40:32,232 INFO L78 Accepts]: Start accepts. Automaton has 19835 states and 33866 transitions. Word has length 183 [2025-02-05 15:40:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:32,232 INFO L471 AbstractCegarLoop]: Abstraction has 19835 states and 33866 transitions. [2025-02-05 15:40:32,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 19835 states and 33866 transitions. [2025-02-05 15:40:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-05 15:40:32,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:32,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:32,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:40:32,281 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:32,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:32,281 INFO L85 PathProgramCache]: Analyzing trace with hash 591685025, now seen corresponding path program 1 times [2025-02-05 15:40:32,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:32,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256114525] [2025-02-05 15:40:32,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:32,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:32,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-05 15:40:32,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-05 15:40:32,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:32,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:32,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:32,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256114525] [2025-02-05 15:40:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256114525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:32,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:32,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654768973] [2025-02-05 15:40:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:32,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:32,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:32,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:32,330 INFO L87 Difference]: Start difference. First operand 19835 states and 33866 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:33,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:33,113 INFO L93 Difference]: Finished difference Result 52353 states and 89751 transitions. [2025-02-05 15:40:33,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:33,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 184 [2025-02-05 15:40:33,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:33,232 INFO L225 Difference]: With dead ends: 52353 [2025-02-05 15:40:33,232 INFO L226 Difference]: Without dead ends: 35383 [2025-02-05 15:40:33,282 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:40:33,283 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 125 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1360 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:40:33,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1360 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35383 states. [2025-02-05 15:40:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35383 to 35375. [2025-02-05 15:40:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35375 states, 29601 states have (on average 1.629776021080369) internal successors, (48243), 29608 states have internal predecessors, (48243), 5740 states have call successors, (5740), 30 states have call predecessors, (5740), 33 states have return successors, (6353), 5738 states have call predecessors, (6353), 5739 states have call successors, (6353) [2025-02-05 15:40:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35375 states to 35375 states and 60336 transitions. [2025-02-05 15:40:34,709 INFO L78 Accepts]: Start accepts. Automaton has 35375 states and 60336 transitions. Word has length 184 [2025-02-05 15:40:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:34,709 INFO L471 AbstractCegarLoop]: Abstraction has 35375 states and 60336 transitions. [2025-02-05 15:40:34,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 35375 states and 60336 transitions. [2025-02-05 15:40:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-05 15:40:34,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:34,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:34,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:40:34,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:34,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash -237249356, now seen corresponding path program 1 times [2025-02-05 15:40:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:34,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420128763] [2025-02-05 15:40:34,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:34,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:34,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-05 15:40:34,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-05 15:40:34,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:34,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:34,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:34,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420128763] [2025-02-05 15:40:34,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420128763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:34,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:34,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:34,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076785691] [2025-02-05 15:40:34,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:34,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:34,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:34,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:34,845 INFO L87 Difference]: Start difference. First operand 35375 states and 60336 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:35,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:35,894 INFO L93 Difference]: Finished difference Result 96420 states and 164998 transitions. [2025-02-05 15:40:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:35,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 185 [2025-02-05 15:40:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:36,157 INFO L225 Difference]: With dead ends: 96420 [2025-02-05 15:40:36,158 INFO L226 Difference]: Without dead ends: 64857 [2025-02-05 15:40:36,245 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:40:36,245 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 123 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1361 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:40:36,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1361 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64857 states. [2025-02-05 15:40:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64857 to 64849. [2025-02-05 15:40:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64849 states, 54562 states have (on average 1.6262783622301236) internal successors, (88733), 54569 states have internal predecessors, (88733), 10253 states have call successors, (10253), 30 states have call predecessors, (10253), 33 states have return successors, (11398), 10251 states have call predecessors, (11398), 10252 states have call successors, (11398) [2025-02-05 15:40:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64849 states to 64849 states and 110384 transitions. [2025-02-05 15:40:38,576 INFO L78 Accepts]: Start accepts. Automaton has 64849 states and 110384 transitions. Word has length 185 [2025-02-05 15:40:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:38,577 INFO L471 AbstractCegarLoop]: Abstraction has 64849 states and 110384 transitions. [2025-02-05 15:40:38,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:40:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 64849 states and 110384 transitions. [2025-02-05 15:40:38,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 15:40:38,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:38,707 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:38,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:40:38,707 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:38,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash -309209171, now seen corresponding path program 1 times [2025-02-05 15:40:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:38,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286733991] [2025-02-05 15:40:38,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:38,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:38,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 15:40:38,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 15:40:38,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:38,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 15:40:38,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:38,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286733991] [2025-02-05 15:40:38,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286733991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:38,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:38,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666087337] [2025-02-05 15:40:38,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:38,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:38,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:38,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:38,782 INFO L87 Difference]: Start difference. First operand 64849 states and 110384 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:40,771 INFO L93 Difference]: Finished difference Result 121571 states and 207352 transitions. [2025-02-05 15:40:40,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:40,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 205 [2025-02-05 15:40:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:41,249 INFO L225 Difference]: With dead ends: 121571 [2025-02-05 15:40:41,249 INFO L226 Difference]: Without dead ends: 121312 [2025-02-05 15:40:41,281 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:40:41,282 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 118 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:41,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1366 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121312 states. [2025-02-05 15:40:44,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121312 to 121304. [2025-02-05 15:40:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121304 states, 102649 states have (on average 1.621564749778371) internal successors, (166452), 102656 states have internal predecessors, (166452), 18621 states have call successors, (18621), 30 states have call predecessors, (18621), 33 states have return successors, (20812), 18619 states have call predecessors, (20812), 18620 states have call successors, (20812) [2025-02-05 15:40:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121304 states to 121304 states and 205885 transitions. [2025-02-05 15:40:45,001 INFO L78 Accepts]: Start accepts. Automaton has 121304 states and 205885 transitions. Word has length 205 [2025-02-05 15:40:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:45,001 INFO L471 AbstractCegarLoop]: Abstraction has 121304 states and 205885 transitions. [2025-02-05 15:40:45,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-02-05 15:40:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 121304 states and 205885 transitions. [2025-02-05 15:40:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 15:40:45,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:45,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:45,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:40:45,184 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:45,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1602582701, now seen corresponding path program 1 times [2025-02-05 15:40:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:45,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676590824] [2025-02-05 15:40:45,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:45,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 15:40:45,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 15:40:45,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:45,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-05 15:40:45,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676590824] [2025-02-05 15:40:45,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676590824] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736117939] [2025-02-05 15:40:45,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:45,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:45,828 INFO L229 MonitoredProcess]: Starting monitored process 8 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:40:45,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:40:46,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 15:40:46,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 15:40:46,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:46,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:40:46,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:40:46,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:40:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:40:46,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736117939] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:40:46,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:40:46,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-02-05 15:40:46,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075651383] [2025-02-05 15:40:46,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:40:46,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 15:40:46,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:46,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 15:40:46,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:40:46,612 INFO L87 Difference]: Start difference. First operand 121304 states and 205885 transitions. Second operand has 28 states, 26 states have (on average 10.423076923076923) internal successors, (271), 24 states have internal predecessors, (271), 9 states have call successors, (56), 8 states have call predecessors, (56), 12 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) [2025-02-05 15:41:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:02,687 INFO L93 Difference]: Finished difference Result 483727 states and 844928 transitions. [2025-02-05 15:41:02,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-02-05 15:41:02,687 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 10.423076923076923) internal successors, (271), 24 states have internal predecessors, (271), 9 states have call successors, (56), 8 states have call predecessors, (56), 12 states have return successors, (49), 11 states have call predecessors, (49), 9 states have call successors, (49) Word has length 187 [2025-02-05 15:41:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:04,985 INFO L225 Difference]: With dead ends: 483727 [2025-02-05 15:41:04,985 INFO L226 Difference]: Without dead ends: 483476 [2025-02-05 15:41:05,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1363, Invalid=11293, Unknown=0, NotChecked=0, Total=12656 [2025-02-05 15:41:05,166 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 8597 mSDsluCounter, 5784 mSDsCounter, 0 mSdLazyCounter, 15324 mSolverCounterSat, 2788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8673 SdHoareTripleChecker+Valid, 6052 SdHoareTripleChecker+Invalid, 18112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2788 IncrementalHoareTripleChecker+Valid, 15324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:05,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8673 Valid, 6052 Invalid, 18112 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2788 Valid, 15324 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 15:41:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483476 states.