./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe4506e3d5e012e1662dc0aa7741c8e3f8f99dc7c5ccf1f202c2f95071bfbf64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:22:45,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:22:45,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:22:45,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:22:45,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:22:45,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:22:45,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:22:45,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:22:45,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:22:45,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:22:45,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:22:45,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:22:45,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:22:45,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:45,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:22:45,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:22:45,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:22:45,953 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/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 -> fe4506e3d5e012e1662dc0aa7741c8e3f8f99dc7c5ccf1f202c2f95071bfbf64 [2025-03-03 14:22:46,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:22:46,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:22:46,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:22:46,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:22:46,195 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:22:46,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c [2025-03-03 14:22:47,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba0cf8fe/c53c9f9a5e6f4110a4fbb4aad1ee4c91/FLAG347e7630b [2025-03-03 14:22:47,655 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:22:47,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c [2025-03-03 14:22:47,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba0cf8fe/c53c9f9a5e6f4110a4fbb4aad1ee4c91/FLAG347e7630b [2025-03-03 14:22:47,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba0cf8fe/c53c9f9a5e6f4110a4fbb4aad1ee4c91 [2025-03-03 14:22:47,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:22:47,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:22:47,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:47,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:22:47,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:22:47,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:47" (1/1) ... [2025-03-03 14:22:47,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:47, skipping insertion in model container [2025-03-03 14:22:47,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:47" (1/1) ... [2025-03-03 14:22:47,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:22:48,187 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c[11237,11250] [2025-03-03 14:22:48,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:48,427 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:22:48,433 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-03 14:22:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [414] [2025-03-03 14:22:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [423] [2025-03-03 14:22:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [441] [2025-03-03 14:22:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [561] [2025-03-03 14:22:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1641] [2025-03-03 14:22:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [1918] [2025-03-03 14:22:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1952] [2025-03-03 14:22:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2362] [2025-03-03 14:22:48,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2922] [2025-03-03 14:22:48,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [3271] [2025-03-03 14:22:48,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c[11237,11250] [2025-03-03 14:22:48,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:48,558 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:22:48,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48 WrapperNode [2025-03-03 14:22:48,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:48,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:48,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:22:48,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:22:48,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,620 INFO L138 Inliner]: procedures = 151, calls = 264, calls flagged for inlining = 66, calls inlined = 63, statements flattened = 1306 [2025-03-03 14:22:48,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:48,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:22:48,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:22:48,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:22:48,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,668 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-03-03 14:22:48,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:22:48,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:22:48,716 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:22:48,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:22:48,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (1/1) ... [2025-03-03 14:22:48,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:48,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:48,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:22:48,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:22:48,771 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:22:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:22:48,771 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-03 14:22:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-03 14:22:48,771 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-03 14:22:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-03 14:22:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:22:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:22:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:22:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:22:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:22:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:22:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:22:48,773 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:22:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-03 14:22:48,773 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-03 14:22:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:22:48,773 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:22:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-03 14:22:48,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-03 14:22:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:22:48,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:22:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:22:48,774 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:22:48,774 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:22:48,775 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:22:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-03 14:22:48,775 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-03 14:22:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-03 14:22:48,775 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-03 14:22:48,775 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:22:48,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-03 14:22:48,776 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:22:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:22:48,777 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-03 14:22:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-03 14:22:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-03 14:22:48,780 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-03 14:22:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:22:48,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:22:48,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:22:48,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:22:48,967 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:22:48,973 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:22:49,003 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3410: #res := ~retValue_acc~40; [2025-03-03 14:22:49,015 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2269: #res := ~retValue_acc~31; [2025-03-03 14:22:49,025 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2806: #res := ~retValue_acc~38; [2025-03-03 14:22:49,037 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1183: #res := ~retValue_acc~15; [2025-03-03 14:22:49,093 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: #res := ~retValue_acc~9; [2025-03-03 14:22:49,117 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2006-1: getEmailId_#res#1 := getEmailId_~retValue_acc~24#1; [2025-03-03 14:22:49,153 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2232: #res := ~retValue_acc~30; [2025-03-03 14:22:49,199 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2080: #res := ~retValue_acc~26; [2025-03-03 14:22:49,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3448: #res#1 := ~retValue_acc~42#1; [2025-03-03 14:22:49,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3430-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~41#1; [2025-03-03 14:22:49,315 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2343: #res := ~retValue_acc~33; [2025-03-03 14:22:49,332 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1275: #res#1 := ~retValue_acc~17#1; [2025-03-03 14:22:49,332 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1230-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~16#1; [2025-03-03 14:22:49,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1499: #res := ~retValue_acc~20; [2025-03-03 14:22:49,374 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3472-1: createEmail_#res#1 := createEmail_~retValue_acc~44#1; [2025-03-03 14:22:49,379 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2195: #res := ~retValue_acc~29; [2025-03-03 14:22:49,405 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618-1: getClientId_#res#1 := getClientId_~retValue_acc~22#1; [2025-03-03 14:22:49,433 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1571-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~21#1; [2025-03-03 14:22:49,437 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2306: #res := ~retValue_acc~32; [2025-03-03 14:22:49,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L463: #res := ~retValue_acc~4; [2025-03-03 14:22:49,477 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1053: #res := ~retValue_acc~13; [2025-03-03 14:22:49,493 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1136-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~14#1; [2025-03-03 14:22:49,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2763-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~35#1; [2025-03-03 14:22:49,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~37#1; [2025-03-03 14:22:49,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1445-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~19#1; [2025-03-03 14:22:49,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-03-03 14:22:49,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~36#1; [2025-03-03 14:22:49,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1338-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~18#1; [2025-03-03 14:22:49,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2043: #res := ~retValue_acc~25; [2025-03-03 14:22:49,891 INFO L? ?]: Removed 625 outVars from TransFormulas that were not future-live. [2025-03-03 14:22:49,891 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:22:49,912 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:22:49,912 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:22:49,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:49 BoogieIcfgContainer [2025-03-03 14:22:49,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:22:49,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:22:49,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:22:49,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:22:49,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:22:47" (1/3) ... [2025-03-03 14:22:49,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68539ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:49, skipping insertion in model container [2025-03-03 14:22:49,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:48" (2/3) ... [2025-03-03 14:22:49,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68539ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:49, skipping insertion in model container [2025-03-03 14:22:49,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:49" (3/3) ... [2025-03-03 14:22:49,923 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_productSimulator.cil.c [2025-03-03 14:22:49,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:22:49,940 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_productSimulator.cil.c that has 45 procedures, 607 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:22:50,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:22:50,028 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;@290fdfcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:22:50,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:22:50,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 607 states, 449 states have (on average 1.512249443207127) internal successors, (679), 469 states have internal predecessors, (679), 112 states have call successors, (112), 44 states have call predecessors, (112), 44 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-03 14:22:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 14:22:50,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:50,063 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:50,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:50,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:50,068 INFO L85 PathProgramCache]: Analyzing trace with hash 618584970, now seen corresponding path program 1 times [2025-03-03 14:22:50,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541177419] [2025-03-03 14:22:50,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:50,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:22:50,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:22:50,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:50,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:22:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541177419] [2025-03-03 14:22:50,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541177419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:50,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:50,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:22:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495485547] [2025-03-03 14:22:50,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:50,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:22:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:50,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:22:50,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:22:50,415 INFO L87 Difference]: Start difference. First operand has 607 states, 449 states have (on average 1.512249443207127) internal successors, (679), 469 states have internal predecessors, (679), 112 states have call successors, (112), 44 states have call predecessors, (112), 44 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:22:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:50,482 INFO L93 Difference]: Finished difference Result 946 states and 1395 transitions. [2025-03-03 14:22:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:22:50,486 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 158 [2025-03-03 14:22:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:50,502 INFO L225 Difference]: With dead ends: 946 [2025-03-03 14:22:50,502 INFO L226 Difference]: Without dead ends: 600 [2025-03-03 14:22:50,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:22:50,510 INFO L435 NwaCegarLoop]: 900 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, 900 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-03-03 14:22:50,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-03 14:22:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-03-03 14:22:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 443 states have (on average 1.510158013544018) internal successors, (669), 462 states have internal predecessors, (669), 112 states have call successors, (112), 44 states have call predecessors, (112), 44 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 14:22:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 892 transitions. [2025-03-03 14:22:50,576 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 892 transitions. Word has length 158 [2025-03-03 14:22:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:50,579 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 892 transitions. [2025-03-03 14:22:50,580 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, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:22:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 892 transitions. [2025-03-03 14:22:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 14:22:50,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:50,588 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:50,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:22:50,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:50,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1148814221, now seen corresponding path program 1 times [2025-03-03 14:22:50,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:50,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130312382] [2025-03-03 14:22:50,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:50,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:50,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:22:50,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:22:50,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:50,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:22:50,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:50,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130312382] [2025-03-03 14:22:50,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130312382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:50,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:50,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:50,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782115064] [2025-03-03 14:22:50,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:50,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:50,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:50,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:50,889 INFO L87 Difference]: Start difference. First operand 600 states and 892 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:22:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:50,977 INFO L93 Difference]: Finished difference Result 1164 states and 1728 transitions. [2025-03-03 14:22:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:50,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2025-03-03 14:22:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:50,989 INFO L225 Difference]: With dead ends: 1164 [2025-03-03 14:22:50,990 INFO L226 Difference]: Without dead ends: 600 [2025-03-03 14:22:50,992 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-03-03 14:22:50,992 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 0 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3548 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:50,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3548 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-03 14:22:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-03-03 14:22:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 443 states have (on average 1.4943566591422122) internal successors, (662), 462 states have internal predecessors, (662), 112 states have call successors, (112), 44 states have call predecessors, (112), 44 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 14:22:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 885 transitions. [2025-03-03 14:22:51,056 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 885 transitions. Word has length 159 [2025-03-03 14:22:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:51,057 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 885 transitions. [2025-03-03 14:22:51,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:22:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 885 transitions. [2025-03-03 14:22:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 14:22:51,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:51,062 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:51,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:22:51,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:51,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:51,063 INFO L85 PathProgramCache]: Analyzing trace with hash 622582667, now seen corresponding path program 1 times [2025-03-03 14:22:51,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:51,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107951823] [2025-03-03 14:22:51,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:51,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 14:22:51,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 14:22:51,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:51,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:22:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:51,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107951823] [2025-03-03 14:22:51,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107951823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:51,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:51,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:51,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810371696] [2025-03-03 14:22:51,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:51,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:51,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:51,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:51,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:51,216 INFO L87 Difference]: Start difference. First operand 600 states and 885 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-03 14:22:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:51,275 INFO L93 Difference]: Finished difference Result 1168 states and 1736 transitions. [2025-03-03 14:22:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:51,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 164 [2025-03-03 14:22:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:51,284 INFO L225 Difference]: With dead ends: 1168 [2025-03-03 14:22:51,284 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 14:22:51,286 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-03-03 14:22:51,286 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 847 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:51,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 900 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 14:22:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 14:22:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 445 states have (on average 1.4853932584269662) internal successors, (661), 462 states have internal predecessors, (661), 110 states have call successors, (110), 45 states have call predecessors, (110), 45 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-03 14:22:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 880 transitions. [2025-03-03 14:22:51,331 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 880 transitions. Word has length 164 [2025-03-03 14:22:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:51,331 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 880 transitions. [2025-03-03 14:22:51,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-03 14:22:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 880 transitions. [2025-03-03 14:22:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 14:22:51,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:51,337 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:51,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:22:51,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:51,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1254742411, now seen corresponding path program 1 times [2025-03-03 14:22:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:51,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755584843] [2025-03-03 14:22:51,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:51,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 14:22:51,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 14:22:51,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:51,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:22:51,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:51,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755584843] [2025-03-03 14:22:51,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755584843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:51,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:51,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:51,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240950939] [2025-03-03 14:22:51,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:51,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:51,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:51,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:51,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:51,470 INFO L87 Difference]: Start difference. First operand 601 states and 880 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:22:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:51,565 INFO L93 Difference]: Finished difference Result 1715 states and 2547 transitions. [2025-03-03 14:22:51,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:51,566 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 185 [2025-03-03 14:22:51,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:51,574 INFO L225 Difference]: With dead ends: 1715 [2025-03-03 14:22:51,575 INFO L226 Difference]: Without dead ends: 1148 [2025-03-03 14:22:51,577 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-03-03 14:22:51,578 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 834 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:51,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1741 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-03 14:22:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1146. [2025-03-03 14:22:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 851 states have (on average 1.4923619271445359) internal successors, (1270), 881 states have internal predecessors, (1270), 205 states have call successors, (205), 89 states have call predecessors, (205), 89 states have return successors, (216), 202 states have call predecessors, (216), 203 states have call successors, (216) [2025-03-03 14:22:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1691 transitions. [2025-03-03 14:22:51,658 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1691 transitions. Word has length 185 [2025-03-03 14:22:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:51,659 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1691 transitions. [2025-03-03 14:22:51,659 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 14:22:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1691 transitions. [2025-03-03 14:22:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 14:22:51,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:51,665 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:51,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:22:51,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:51,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:51,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2081937694, now seen corresponding path program 1 times [2025-03-03 14:22:51,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:51,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488816940] [2025-03-03 14:22:51,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:51,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:51,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 14:22:51,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 14:22:51,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:51,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-03 14:22:51,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488816940] [2025-03-03 14:22:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488816940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:51,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:51,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:51,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027388747] [2025-03-03 14:22:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:51,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:51,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:51,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:51,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:51,774 INFO L87 Difference]: Start difference. First operand 1146 states and 1691 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:51,833 INFO L93 Difference]: Finished difference Result 1148 states and 1692 transitions. [2025-03-03 14:22:51,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:51,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2025-03-03 14:22:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:51,841 INFO L225 Difference]: With dead ends: 1148 [2025-03-03 14:22:51,841 INFO L226 Difference]: Without dead ends: 602 [2025-03-03 14:22:51,843 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-03-03 14:22:51,844 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 827 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:51,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 903 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-03 14:22:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2025-03-03 14:22:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 447 states have (on average 1.4742729306487696) internal successors, (659), 462 states have internal predecessors, (659), 108 states have call successors, (108), 46 states have call predecessors, (108), 46 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-03 14:22:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 874 transitions. [2025-03-03 14:22:51,876 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 874 transitions. Word has length 179 [2025-03-03 14:22:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:51,876 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 874 transitions. [2025-03-03 14:22:51,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 874 transitions. [2025-03-03 14:22:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 14:22:51,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:51,879 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:51,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:22:51,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:51,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:51,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1442037398, now seen corresponding path program 1 times [2025-03-03 14:22:51,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:51,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125892674] [2025-03-03 14:22:51,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:51,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:51,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:22:51,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:22:51,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:51,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 14:22:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:51,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125892674] [2025-03-03 14:22:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125892674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:51,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:51,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657204943] [2025-03-03 14:22:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:51,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:51,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:52,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:52,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:52,000 INFO L87 Difference]: Start difference. First operand 602 states and 874 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:22:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:52,058 INFO L93 Difference]: Finished difference Result 1158 states and 1688 transitions. [2025-03-03 14:22:52,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:52,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 195 [2025-03-03 14:22:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:52,063 INFO L225 Difference]: With dead ends: 1158 [2025-03-03 14:22:52,063 INFO L226 Difference]: Without dead ends: 605 [2025-03-03 14:22:52,064 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-03-03 14:22:52,065 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 809 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:52,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 888 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-03 14:22:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 599. [2025-03-03 14:22:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 447 states have (on average 1.4496644295302012) internal successors, (648), 457 states have internal predecessors, (648), 105 states have call successors, (105), 46 states have call predecessors, (105), 46 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-03 14:22:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 857 transitions. [2025-03-03 14:22:52,099 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 857 transitions. Word has length 195 [2025-03-03 14:22:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:52,099 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 857 transitions. [2025-03-03 14:22:52,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 14:22:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 857 transitions. [2025-03-03 14:22:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 14:22:52,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:52,102 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:22:52,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:52,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash 709422820, now seen corresponding path program 1 times [2025-03-03 14:22:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676172448] [2025-03-03 14:22:52,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:52,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 14:22:52,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 14:22:52,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:52,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 14:22:52,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:52,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676172448] [2025-03-03 14:22:52,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676172448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:52,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268591198] [2025-03-03 14:22:52,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:52,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:52,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:52,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:52,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:22:52,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 14:22:52,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 14:22:52,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:52,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:52,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:22:52,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:22:52,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:52,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268591198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:52,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:52,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:22:52,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501572232] [2025-03-03 14:22:52,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:52,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:52,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:52,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:52,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:52,841 INFO L87 Difference]: Start difference. First operand 599 states and 857 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, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:22:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:52,875 INFO L93 Difference]: Finished difference Result 930 states and 1313 transitions. [2025-03-03 14:22:52,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:52,876 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, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 206 [2025-03-03 14:22:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:52,880 INFO L225 Difference]: With dead ends: 930 [2025-03-03 14:22:52,880 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 14:22:52,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:52,881 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1702 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-03-03 14:22:52,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1702 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 14:22:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 14:22:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 449 states have (on average 1.447661469933185) internal successors, (650), 459 states have internal predecessors, (650), 105 states have call successors, (105), 46 states have call predecessors, (105), 46 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-03 14:22:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 859 transitions. [2025-03-03 14:22:52,913 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 859 transitions. Word has length 206 [2025-03-03 14:22:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:52,914 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 859 transitions. [2025-03-03 14:22:52,914 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, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:22:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 859 transitions. [2025-03-03 14:22:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 14:22:52,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:52,917 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:52,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:22:53,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:53,122 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:53,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 857719371, now seen corresponding path program 1 times [2025-03-03 14:22:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415926678] [2025-03-03 14:22:53,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:53,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 14:22:53,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 14:22:53,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:53,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:22:53,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:53,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415926678] [2025-03-03 14:22:53,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415926678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:53,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344841130] [2025-03-03 14:22:53,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:53,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:53,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:53,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:53,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:22:53,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 14:22:53,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 14:22:53,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:53,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:53,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1595 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:53,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:22:53,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:53,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344841130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:53,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:53,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:22:53,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309947119] [2025-03-03 14:22:53,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:53,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:53,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:53,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:53,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:53,863 INFO L87 Difference]: Start difference. First operand 601 states and 859 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, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:22:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:53,905 INFO L93 Difference]: Finished difference Result 1218 states and 1776 transitions. [2025-03-03 14:22:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:53,906 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, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 213 [2025-03-03 14:22:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:53,910 INFO L225 Difference]: With dead ends: 1218 [2025-03-03 14:22:53,910 INFO L226 Difference]: Without dead ends: 698 [2025-03-03 14:22:53,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:53,913 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 165 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1665 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-03-03 14:22:53,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1665 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-03 14:22:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 690. [2025-03-03 14:22:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 524 states have (on average 1.463740458015267) internal successors, (767), 534 states have internal predecessors, (767), 119 states have call successors, (119), 46 states have call predecessors, (119), 46 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-03 14:22:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1004 transitions. [2025-03-03 14:22:53,950 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1004 transitions. Word has length 213 [2025-03-03 14:22:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:53,950 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1004 transitions. [2025-03-03 14:22:53,950 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, (36), 2 states have call predecessors, (36), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:22:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1004 transitions. [2025-03-03 14:22:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 14:22:53,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:53,955 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:53,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:54,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 14:22:54,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:54,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:54,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1945368212, now seen corresponding path program 1 times [2025-03-03 14:22:54,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:54,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218694062] [2025-03-03 14:22:54,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:54,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 14:22:54,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 14:22:54,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:54,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:22:54,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218694062] [2025-03-03 14:22:54,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218694062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:54,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968467083] [2025-03-03 14:22:54,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:54,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:54,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:54,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:22:54,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 14:22:54,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 14:22:54,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:54,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:54,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:54,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:22:54,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968467083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:54,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:54,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:22:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020305832] [2025-03-03 14:22:54,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:54,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:54,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:54,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:54,812 INFO L87 Difference]: Start difference. First operand 690 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 14:22:54,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:54,904 INFO L93 Difference]: Finished difference Result 1887 states and 2812 transitions. [2025-03-03 14:22:54,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:54,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 214 [2025-03-03 14:22:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:54,912 INFO L225 Difference]: With dead ends: 1887 [2025-03-03 14:22:54,912 INFO L226 Difference]: Without dead ends: 1278 [2025-03-03 14:22:54,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:54,915 INFO L435 NwaCegarLoop]: 1149 mSDtfsCounter, 688 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:54,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1981 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-03 14:22:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1276. [2025-03-03 14:22:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 973 states have (on average 1.4799588900308325) internal successors, (1440), 991 states have internal predecessors, (1440), 216 states have call successors, (216), 86 states have call predecessors, (216), 86 states have return successors, (228), 212 states have call predecessors, (228), 214 states have call successors, (228) [2025-03-03 14:22:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1884 transitions. [2025-03-03 14:22:54,984 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1884 transitions. Word has length 214 [2025-03-03 14:22:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:54,984 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1884 transitions. [2025-03-03 14:22:54,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 14:22:54,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1884 transitions. [2025-03-03 14:22:54,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 14:22:54,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:54,990 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:54,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:22:55,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:55,191 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:55,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1058456978, now seen corresponding path program 1 times [2025-03-03 14:22:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:55,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225622439] [2025-03-03 14:22:55,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:55,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 14:22:55,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 14:22:55,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:55,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 14:22:55,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:55,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225622439] [2025-03-03 14:22:55,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225622439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:55,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767728510] [2025-03-03 14:22:55,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:55,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:55,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:55,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:55,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:22:55,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 14:22:55,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 14:22:55,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:55,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:55,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:55,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:22:55,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767728510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:55,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:55,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 14:22:55,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078951355] [2025-03-03 14:22:55,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:55,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:55,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:55,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:55,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:55,893 INFO L87 Difference]: Start difference. First operand 1276 states and 1884 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-03 14:22:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:56,008 INFO L93 Difference]: Finished difference Result 3110 states and 4602 transitions. [2025-03-03 14:22:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:56,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 221 [2025-03-03 14:22:56,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:56,024 INFO L225 Difference]: With dead ends: 3110 [2025-03-03 14:22:56,025 INFO L226 Difference]: Without dead ends: 2484 [2025-03-03 14:22:56,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:56,028 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 721 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:56,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1690 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2025-03-03 14:22:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2482. [2025-03-03 14:22:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 1905 states have (on average 1.48503937007874) internal successors, (2829), 1935 states have internal predecessors, (2829), 408 states have call successors, (408), 168 states have call predecessors, (408), 168 states have return successors, (457), 400 states have call predecessors, (457), 404 states have call successors, (457) [2025-03-03 14:22:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3694 transitions. [2025-03-03 14:22:56,141 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3694 transitions. Word has length 221 [2025-03-03 14:22:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:56,142 INFO L471 AbstractCegarLoop]: Abstraction has 2482 states and 3694 transitions. [2025-03-03 14:22:56,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-03 14:22:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3694 transitions. [2025-03-03 14:22:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 14:22:56,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:56,151 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:56,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:22:56,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:56,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:56,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1951903316, now seen corresponding path program 1 times [2025-03-03 14:22:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:56,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740730222] [2025-03-03 14:22:56,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:56,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:56,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 14:22:56,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 14:22:56,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:56,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:22:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740730222] [2025-03-03 14:22:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740730222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526333588] [2025-03-03 14:22:56,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:56,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:56,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:56,550 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:56,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:22:56,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 14:22:56,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 14:22:56,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:56,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:56,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:22:56,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 14:22:57,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:57,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526333588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:57,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:57,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-03 14:22:57,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920122517] [2025-03-03 14:22:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:57,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:57,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:57,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:57,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:22:57,009 INFO L87 Difference]: Start difference. First operand 2482 states and 3694 transitions. Second operand has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 14:22:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:57,161 INFO L93 Difference]: Finished difference Result 4882 states and 7296 transitions. [2025-03-03 14:22:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:22:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 214 [2025-03-03 14:22:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:57,175 INFO L225 Difference]: With dead ends: 4882 [2025-03-03 14:22:57,175 INFO L226 Difference]: Without dead ends: 2486 [2025-03-03 14:22:57,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:22:57,184 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 4 mSDsluCounter, 5035 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5877 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:57,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5877 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-03 14:22:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2025-03-03 14:22:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 1907 states have (on average 1.4845306764551651) internal successors, (2831), 1939 states have internal predecessors, (2831), 408 states have call successors, (408), 168 states have call predecessors, (408), 170 states have return successors, (461), 400 states have call predecessors, (461), 404 states have call successors, (461) [2025-03-03 14:22:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3700 transitions. [2025-03-03 14:22:57,274 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3700 transitions. Word has length 214 [2025-03-03 14:22:57,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:57,274 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3700 transitions. [2025-03-03 14:22:57,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 14:22:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3700 transitions. [2025-03-03 14:22:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 14:22:57,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:57,282 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:57,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:57,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:22:57,486 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:57,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash 538758033, now seen corresponding path program 1 times [2025-03-03 14:22:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:57,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966409616] [2025-03-03 14:22:57,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:57,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:57,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 14:22:57,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 14:22:57,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:57,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:22:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966409616] [2025-03-03 14:22:57,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966409616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:57,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502926592] [2025-03-03 14:22:57,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:57,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:57,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:57,641 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:57,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:22:57,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 14:22:57,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 14:22:57,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:57,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:57,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1601 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:22:57,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 14:22:58,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:58,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502926592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:58,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:58,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 14:22:58,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097780178] [2025-03-03 14:22:58,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:58,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:22:58,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:58,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:22:58,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:22:58,030 INFO L87 Difference]: Start difference. First operand 2486 states and 3700 transitions. Second operand has 6 states, 5 states have (on average 26.4) internal successors, (132), 6 states have internal predecessors, (132), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 14:22:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:58,143 INFO L93 Difference]: Finished difference Result 4888 states and 7312 transitions. [2025-03-03 14:22:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:22:58,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.4) internal successors, (132), 6 states have internal predecessors, (132), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 215 [2025-03-03 14:22:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:58,156 INFO L225 Difference]: With dead ends: 4888 [2025-03-03 14:22:58,156 INFO L226 Difference]: Without dead ends: 2494 [2025-03-03 14:22:58,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:22:58,163 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 2 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4193 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:58,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4193 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2494 states. [2025-03-03 14:22:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2494 to 2490. [2025-03-03 14:22:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 1909 states have (on average 1.4840230487166055) internal successors, (2833), 1943 states have internal predecessors, (2833), 408 states have call successors, (408), 168 states have call predecessors, (408), 172 states have return successors, (471), 400 states have call predecessors, (471), 404 states have call successors, (471) [2025-03-03 14:22:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 3712 transitions. [2025-03-03 14:22:58,249 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 3712 transitions. Word has length 215 [2025-03-03 14:22:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:58,249 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 3712 transitions. [2025-03-03 14:22:58,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.4) internal successors, (132), 6 states have internal predecessors, (132), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 14:22:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 3712 transitions. [2025-03-03 14:22:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 14:22:58,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:58,257 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:58,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:22:58,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:58,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:58,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash -564831568, now seen corresponding path program 1 times [2025-03-03 14:22:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:58,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759236257] [2025-03-03 14:22:58,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:58,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 14:22:58,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 14:22:58,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:58,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:22:58,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:58,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759236257] [2025-03-03 14:22:58,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759236257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:58,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954501070] [2025-03-03 14:22:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:58,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:58,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:58,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:58,673 INFO L87 Difference]: Start difference. First operand 2490 states and 3712 transitions. Second operand has 8 states, 6 states have (on average 21.333333333333332) internal successors, (128), 8 states have internal predecessors, (128), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 14:22:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:58,838 INFO L93 Difference]: Finished difference Result 4860 states and 7278 transitions. [2025-03-03 14:22:58,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:22:58,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.333333333333332) internal successors, (128), 8 states have internal predecessors, (128), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 216 [2025-03-03 14:22:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:58,853 INFO L225 Difference]: With dead ends: 4860 [2025-03-03 14:22:58,853 INFO L226 Difference]: Without dead ends: 2490 [2025-03-03 14:22:58,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:58,860 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 4 mSDsluCounter, 5041 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5884 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:58,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5884 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2025-03-03 14:22:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2490. [2025-03-03 14:22:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 1909 states have (on average 1.4840230487166055) internal successors, (2833), 1943 states have internal predecessors, (2833), 408 states have call successors, (408), 168 states have call predecessors, (408), 172 states have return successors, (469), 400 states have call predecessors, (469), 404 states have call successors, (469) [2025-03-03 14:22:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 3710 transitions. [2025-03-03 14:22:58,948 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 3710 transitions. Word has length 216 [2025-03-03 14:22:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:58,950 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 3710 transitions. [2025-03-03 14:22:58,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.333333333333332) internal successors, (128), 8 states have internal predecessors, (128), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 14:22:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 3710 transitions. [2025-03-03 14:22:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 14:22:58,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:58,959 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:58,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:22:58,959 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:58,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash 462302249, now seen corresponding path program 2 times [2025-03-03 14:22:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:58,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487880241] [2025-03-03 14:22:58,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:58,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:58,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 217 statements into 2 equivalence classes. [2025-03-03 14:22:58,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 105 of 217 statements. [2025-03-03 14:22:58,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:22:58,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-03 14:22:59,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:59,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487880241] [2025-03-03 14:22:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487880241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:59,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:59,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:22:59,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860996063] [2025-03-03 14:22:59,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:59,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:22:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:59,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:22:59,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:59,095 INFO L87 Difference]: Start difference. First operand 2490 states and 3710 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 8 states have internal predecessors, (125), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:22:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:59,230 INFO L93 Difference]: Finished difference Result 3724 states and 5521 transitions. [2025-03-03 14:22:59,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:22:59,231 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 8 states have internal predecessors, (125), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) Word has length 217 [2025-03-03 14:22:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:59,246 INFO L225 Difference]: With dead ends: 3724 [2025-03-03 14:22:59,246 INFO L226 Difference]: Without dead ends: 2506 [2025-03-03 14:22:59,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:59,251 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 0 mSDsluCounter, 6763 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7610 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:59,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7610 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2025-03-03 14:22:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506. [2025-03-03 14:22:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 1921 states have (on average 1.4809994794377928) internal successors, (2845), 1955 states have internal predecessors, (2845), 408 states have call successors, (408), 168 states have call predecessors, (408), 176 states have return successors, (477), 404 states have call predecessors, (477), 404 states have call successors, (477) [2025-03-03 14:22:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 3730 transitions. [2025-03-03 14:22:59,331 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 3730 transitions. Word has length 217 [2025-03-03 14:22:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:59,331 INFO L471 AbstractCegarLoop]: Abstraction has 2506 states and 3730 transitions. [2025-03-03 14:22:59,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 8 states have internal predecessors, (125), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 14:22:59,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3730 transitions. [2025-03-03 14:22:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 14:22:59,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:59,338 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:59,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:22:59,338 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:59,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash 317994052, now seen corresponding path program 1 times [2025-03-03 14:22:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:59,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379219151] [2025-03-03 14:22:59,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:59,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:59,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 14:22:59,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 14:22:59,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:59,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:22:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:59,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379219151] [2025-03-03 14:22:59,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379219151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:59,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:59,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:59,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401494197] [2025-03-03 14:22:59,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:59,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:59,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:59,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:59,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:59,496 INFO L87 Difference]: Start difference. First operand 2506 states and 3730 transitions. Second operand has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 14:22:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:59,605 INFO L93 Difference]: Finished difference Result 4896 states and 7324 transitions. [2025-03-03 14:22:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:22:59,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 220 [2025-03-03 14:22:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:59,618 INFO L225 Difference]: With dead ends: 4896 [2025-03-03 14:22:59,618 INFO L226 Difference]: Without dead ends: 2510 [2025-03-03 14:22:59,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:59,626 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 3 mSDsluCounter, 5046 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5890 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:59,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5890 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2025-03-03 14:22:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2510. [2025-03-03 14:22:59,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2510 states, 1923 states have (on average 1.4804992199687987) internal successors, (2847), 1959 states have internal predecessors, (2847), 408 states have call successors, (408), 168 states have call predecessors, (408), 178 states have return successors, (481), 404 states have call predecessors, (481), 404 states have call successors, (481) [2025-03-03 14:22:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3736 transitions. [2025-03-03 14:22:59,736 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3736 transitions. Word has length 220 [2025-03-03 14:22:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:59,736 INFO L471 AbstractCegarLoop]: Abstraction has 2510 states and 3736 transitions. [2025-03-03 14:22:59,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.0) internal successors, (132), 8 states have internal predecessors, (132), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 14:22:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3736 transitions. [2025-03-03 14:22:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 14:22:59,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:59,743 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:22:59,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:22:59,743 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:59,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2067274752, now seen corresponding path program 1 times [2025-03-03 14:22:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:59,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859933070] [2025-03-03 14:22:59,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:59,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 14:22:59,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 14:22:59,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:59,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:22:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:59,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859933070] [2025-03-03 14:22:59,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859933070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:59,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:59,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:22:59,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255326460] [2025-03-03 14:22:59,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:59,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:22:59,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:59,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:22:59,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:59,903 INFO L87 Difference]: Start difference. First operand 2510 states and 3736 transitions. Second operand has 9 states, 7 states have (on average 19.428571428571427) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 14:23:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:00,073 INFO L93 Difference]: Finished difference Result 4894 states and 7320 transitions. [2025-03-03 14:23:00,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:23:00,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 19.428571428571427) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 221 [2025-03-03 14:23:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:00,086 INFO L225 Difference]: With dead ends: 4894 [2025-03-03 14:23:00,086 INFO L226 Difference]: Without dead ends: 2514 [2025-03-03 14:23:00,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:00,093 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 7 mSDsluCounter, 5822 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6658 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:00,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6658 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2025-03-03 14:23:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2510. [2025-03-03 14:23:00,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2510 states, 1923 states have (on average 1.4804992199687987) internal successors, (2847), 1959 states have internal predecessors, (2847), 408 states have call successors, (408), 168 states have call predecessors, (408), 178 states have return successors, (479), 404 states have call predecessors, (479), 404 states have call successors, (479) [2025-03-03 14:23:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3734 transitions. [2025-03-03 14:23:00,221 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3734 transitions. Word has length 221 [2025-03-03 14:23:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:00,222 INFO L471 AbstractCegarLoop]: Abstraction has 2510 states and 3734 transitions. [2025-03-03 14:23:00,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 19.428571428571427) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 14:23:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3734 transitions. [2025-03-03 14:23:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 14:23:00,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:00,229 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:00,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:23:00,229 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:00,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash -783633069, now seen corresponding path program 2 times [2025-03-03 14:23:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:00,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565949748] [2025-03-03 14:23:00,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:23:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:00,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 222 statements into 2 equivalence classes. [2025-03-03 14:23:00,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 110 of 222 statements. [2025-03-03 14:23:00,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:23:00,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 14:23:00,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:00,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565949748] [2025-03-03 14:23:00,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565949748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:00,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:00,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:23:00,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296865309] [2025-03-03 14:23:00,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:00,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:23:00,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:00,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:23:00,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:23:00,284 INFO L87 Difference]: Start difference. First operand 2510 states and 3734 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 4 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 14:23:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:00,782 INFO L93 Difference]: Finished difference Result 6089 states and 9201 transitions. [2025-03-03 14:23:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:23:00,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 4 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 222 [2025-03-03 14:23:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:00,802 INFO L225 Difference]: With dead ends: 6089 [2025-03-03 14:23:00,802 INFO L226 Difference]: Without dead ends: 3615 [2025-03-03 14:23:00,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:23:00,810 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1477 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:00,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 2788 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:23:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2025-03-03 14:23:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 3613. [2025-03-03 14:23:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3613 states, 2790 states have (on average 1.4795698924731182) internal successors, (4128), 2829 states have internal predecessors, (4128), 570 states have call successors, (570), 243 states have call predecessors, (570), 252 states have return successors, (645), 558 states have call predecessors, (645), 564 states have call successors, (645) [2025-03-03 14:23:00,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 5343 transitions. [2025-03-03 14:23:00,926 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 5343 transitions. Word has length 222 [2025-03-03 14:23:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:00,927 INFO L471 AbstractCegarLoop]: Abstraction has 3613 states and 5343 transitions. [2025-03-03 14:23:00,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 4 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-03 14:23:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 5343 transitions. [2025-03-03 14:23:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 14:23:00,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:00,937 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:00,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:23:00,937 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:00,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1455764898, now seen corresponding path program 1 times [2025-03-03 14:23:00,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:00,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356660861] [2025-03-03 14:23:00,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:00,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:00,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 14:23:00,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 14:23:00,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:00,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-03-03 14:23:01,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:01,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356660861] [2025-03-03 14:23:01,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356660861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:01,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:01,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:23:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103166749] [2025-03-03 14:23:01,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:01,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:23:01,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:01,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:23:01,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:23:01,139 INFO L87 Difference]: Start difference. First operand 3613 states and 5343 transitions. Second operand has 9 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 14:23:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:01,376 INFO L93 Difference]: Finished difference Result 7058 states and 10504 transitions. [2025-03-03 14:23:01,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:23:01,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 226 [2025-03-03 14:23:01,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:01,399 INFO L225 Difference]: With dead ends: 7058 [2025-03-03 14:23:01,399 INFO L226 Difference]: Without dead ends: 3625 [2025-03-03 14:23:01,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:01,410 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 4 mSDsluCounter, 5836 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6674 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:01,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6674 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2025-03-03 14:23:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 3619. [2025-03-03 14:23:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3619 states, 2793 states have (on average 1.4790547798066596) internal successors, (4131), 2835 states have internal predecessors, (4131), 570 states have call successors, (570), 243 states have call predecessors, (570), 255 states have return successors, (660), 558 states have call predecessors, (660), 564 states have call successors, (660) [2025-03-03 14:23:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 3619 states and 5361 transitions. [2025-03-03 14:23:01,571 INFO L78 Accepts]: Start accepts. Automaton has 3619 states and 5361 transitions. Word has length 226 [2025-03-03 14:23:01,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:01,571 INFO L471 AbstractCegarLoop]: Abstraction has 3619 states and 5361 transitions. [2025-03-03 14:23:01,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 19.857142857142858) internal successors, (139), 8 states have internal predecessors, (139), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-03 14:23:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3619 states and 5361 transitions. [2025-03-03 14:23:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 14:23:01,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:01,580 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:01,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:23:01,580 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:01,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1401072716, now seen corresponding path program 1 times [2025-03-03 14:23:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:01,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155653969] [2025-03-03 14:23:01,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:01,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:01,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 14:23:01,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 14:23:01,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:01,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:01,688 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:01,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:01,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155653969] [2025-03-03 14:23:01,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155653969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:01,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641681362] [2025-03-03 14:23:01,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:01,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:01,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:01,690 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:01,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:23:01,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 14:23:01,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 14:23:01,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:01,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:02,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:02,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:02,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:23:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:02,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641681362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:23:02,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:23:02,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:23:02,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468840913] [2025-03-03 14:23:02,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:23:02,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:23:02,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:02,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:23:02,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:23:02,141 INFO L87 Difference]: Start difference. First operand 3619 states and 5361 transitions. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-03 14:23:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:02,366 INFO L93 Difference]: Finished difference Result 8069 states and 12198 transitions. [2025-03-03 14:23:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:23:02,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 227 [2025-03-03 14:23:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:02,391 INFO L225 Difference]: With dead ends: 8069 [2025-03-03 14:23:02,391 INFO L226 Difference]: Without dead ends: 6307 [2025-03-03 14:23:02,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:23:02,399 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 637 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:02,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 3881 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6307 states. [2025-03-03 14:23:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6307 to 6169. [2025-03-03 14:23:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6169 states, 4962 states have (on average 1.5199516324062878) internal successors, (7542), 5004 states have internal predecessors, (7542), 951 states have call successors, (951), 243 states have call predecessors, (951), 255 states have return successors, (1071), 939 states have call predecessors, (1071), 945 states have call successors, (1071) [2025-03-03 14:23:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6169 states to 6169 states and 9564 transitions. [2025-03-03 14:23:02,575 INFO L78 Accepts]: Start accepts. Automaton has 6169 states and 9564 transitions. Word has length 227 [2025-03-03 14:23:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:02,575 INFO L471 AbstractCegarLoop]: Abstraction has 6169 states and 9564 transitions. [2025-03-03 14:23:02,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-03 14:23:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 6169 states and 9564 transitions. [2025-03-03 14:23:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 14:23:02,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:02,593 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:02,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:23:02,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:02,794 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:02,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 789414647, now seen corresponding path program 1 times [2025-03-03 14:23:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:02,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088362463] [2025-03-03 14:23:02,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:02,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:02,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 14:23:02,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 14:23:02,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:02,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:02,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:02,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088362463] [2025-03-03 14:23:02,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088362463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:02,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:02,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:02,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647263352] [2025-03-03 14:23:02,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:02,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:02,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:02,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:02,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:02,864 INFO L87 Difference]: Start difference. First operand 6169 states and 9564 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:03,050 INFO L93 Difference]: Finished difference Result 14312 states and 22468 transitions. [2025-03-03 14:23:03,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:03,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 231 [2025-03-03 14:23:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:03,081 INFO L225 Difference]: With dead ends: 14312 [2025-03-03 14:23:03,081 INFO L226 Difference]: Without dead ends: 9082 [2025-03-03 14:23:03,094 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-03-03 14:23:03,096 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 163 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1705 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-03-03 14:23:03,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1705 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:03,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9082 states. [2025-03-03 14:23:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9082 to 9034. [2025-03-03 14:23:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9034 states, 7362 states have (on average 1.5338223308883456) internal successors, (11292), 7404 states have internal predecessors, (11292), 1416 states have call successors, (1416), 243 states have call predecessors, (1416), 255 states have return successors, (1566), 1404 states have call predecessors, (1566), 1410 states have call successors, (1566) [2025-03-03 14:23:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9034 states to 9034 states and 14274 transitions. [2025-03-03 14:23:03,343 INFO L78 Accepts]: Start accepts. Automaton has 9034 states and 14274 transitions. Word has length 231 [2025-03-03 14:23:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:03,344 INFO L471 AbstractCegarLoop]: Abstraction has 9034 states and 14274 transitions. [2025-03-03 14:23:03,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 9034 states and 14274 transitions. [2025-03-03 14:23:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 14:23:03,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:03,368 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:03,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:23:03,368 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:03,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1373500519, now seen corresponding path program 1 times [2025-03-03 14:23:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:03,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413511687] [2025-03-03 14:23:03,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:03,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:03,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 14:23:03,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 14:23:03,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:03,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:03,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:03,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413511687] [2025-03-03 14:23:03,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413511687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:03,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:03,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:03,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533327414] [2025-03-03 14:23:03,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:03,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:03,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:03,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:03,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:03,427 INFO L87 Difference]: Start difference. First operand 9034 states and 14274 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:03,678 INFO L93 Difference]: Finished difference Result 21560 states and 34369 transitions. [2025-03-03 14:23:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:03,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 232 [2025-03-03 14:23:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:03,722 INFO L225 Difference]: With dead ends: 21560 [2025-03-03 14:23:03,723 INFO L226 Difference]: Without dead ends: 13258 [2025-03-03 14:23:03,742 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-03-03 14:23:03,743 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 161 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1698 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-03-03 14:23:03,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1698 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13258 states. [2025-03-03 14:23:04,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13258 to 13210. [2025-03-03 14:23:04,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13210 states, 10911 states have (on average 1.5449546329392356) internal successors, (16857), 10953 states have internal predecessors, (16857), 2043 states have call successors, (2043), 243 states have call predecessors, (2043), 255 states have return successors, (2193), 2031 states have call predecessors, (2193), 2037 states have call successors, (2193) [2025-03-03 14:23:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13210 states to 13210 states and 21093 transitions. [2025-03-03 14:23:04,238 INFO L78 Accepts]: Start accepts. Automaton has 13210 states and 21093 transitions. Word has length 232 [2025-03-03 14:23:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:04,239 INFO L471 AbstractCegarLoop]: Abstraction has 13210 states and 21093 transitions. [2025-03-03 14:23:04,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 13210 states and 21093 transitions. [2025-03-03 14:23:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 14:23:04,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:04,277 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:04,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:23:04,278 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:04,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:04,278 INFO L85 PathProgramCache]: Analyzing trace with hash -601199722, now seen corresponding path program 1 times [2025-03-03 14:23:04,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:04,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699781130] [2025-03-03 14:23:04,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:04,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:04,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 14:23:04,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 14:23:04,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:04,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:04,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:04,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699781130] [2025-03-03 14:23:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699781130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:04,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:04,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204000806] [2025-03-03 14:23:04,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:04,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:04,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:04,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:04,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:04,364 INFO L87 Difference]: Start difference. First operand 13210 states and 21093 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:04,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:04,877 INFO L93 Difference]: Finished difference Result 31328 states and 50443 transitions. [2025-03-03 14:23:04,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:04,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 233 [2025-03-03 14:23:04,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:04,939 INFO L225 Difference]: With dead ends: 31328 [2025-03-03 14:23:04,939 INFO L226 Difference]: Without dead ends: 19702 [2025-03-03 14:23:04,959 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-03-03 14:23:04,962 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 159 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1693 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-03-03 14:23:04,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1693 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19702 states. [2025-03-03 14:23:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19702 to 19654. [2025-03-03 14:23:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19654 states, 16497 states have (on average 1.5548281505728314) internal successors, (25650), 16539 states have internal predecessors, (25650), 2901 states have call successors, (2901), 243 states have call predecessors, (2901), 255 states have return successors, (3099), 2889 states have call predecessors, (3099), 2895 states have call successors, (3099) [2025-03-03 14:23:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19654 states to 19654 states and 31650 transitions. [2025-03-03 14:23:05,470 INFO L78 Accepts]: Start accepts. Automaton has 19654 states and 31650 transitions. Word has length 233 [2025-03-03 14:23:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:05,470 INFO L471 AbstractCegarLoop]: Abstraction has 19654 states and 31650 transitions. [2025-03-03 14:23:05,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19654 states and 31650 transitions. [2025-03-03 14:23:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 14:23:05,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:05,524 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:05,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:23:05,524 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:05,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash -828183590, now seen corresponding path program 1 times [2025-03-03 14:23:05,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:05,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578781174] [2025-03-03 14:23:05,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:05,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:05,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 14:23:05,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 14:23:05,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:05,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:05,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:05,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578781174] [2025-03-03 14:23:05,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578781174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:05,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:05,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:05,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63977410] [2025-03-03 14:23:05,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:05,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:05,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:05,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:05,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:05,642 INFO L87 Difference]: Start difference. First operand 19654 states and 31650 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:06,176 INFO L93 Difference]: Finished difference Result 47129 states and 76522 transitions. [2025-03-03 14:23:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:06,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 234 [2025-03-03 14:23:06,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:06,275 INFO L225 Difference]: With dead ends: 47129 [2025-03-03 14:23:06,275 INFO L226 Difference]: Without dead ends: 30319 [2025-03-03 14:23:06,302 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-03-03 14:23:06,303 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 157 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1693 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-03-03 14:23:06,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1693 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:06,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30319 states. [2025-03-03 14:23:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30319 to 30271. [2025-03-03 14:23:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30271 states, 25791 states have (on average 1.5641502849831337) internal successors, (40341), 25833 states have internal predecessors, (40341), 4224 states have call successors, (4224), 243 states have call predecessors, (4224), 255 states have return successors, (4500), 4212 states have call predecessors, (4500), 4218 states have call successors, (4500) [2025-03-03 14:23:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30271 states to 30271 states and 49065 transitions. [2025-03-03 14:23:07,304 INFO L78 Accepts]: Start accepts. Automaton has 30271 states and 49065 transitions. Word has length 234 [2025-03-03 14:23:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:07,305 INFO L471 AbstractCegarLoop]: Abstraction has 30271 states and 49065 transitions. [2025-03-03 14:23:07,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 30271 states and 49065 transitions. [2025-03-03 14:23:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-03 14:23:07,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:07,401 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:07,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:23:07,402 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:07,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:07,402 INFO L85 PathProgramCache]: Analyzing trace with hash 189204181, now seen corresponding path program 1 times [2025-03-03 14:23:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:07,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074087781] [2025-03-03 14:23:07,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:07,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-03 14:23:07,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-03 14:23:07,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:07,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:07,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:07,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074087781] [2025-03-03 14:23:07,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074087781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:07,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:07,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770319229] [2025-03-03 14:23:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:07,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:07,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:07,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:07,487 INFO L87 Difference]: Start difference. First operand 30271 states and 49065 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:08,537 INFO L93 Difference]: Finished difference Result 74195 states and 121003 transitions. [2025-03-03 14:23:08,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 235 [2025-03-03 14:23:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:08,699 INFO L225 Difference]: With dead ends: 74195 [2025-03-03 14:23:08,700 INFO L226 Difference]: Without dead ends: 48559 [2025-03-03 14:23:08,759 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-03-03 14:23:08,760 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 155 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1708 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-03-03 14:23:08,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1708 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:08,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48559 states. [2025-03-03 14:23:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48559 to 48511. [2025-03-03 14:23:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48511 states, 41298 states have (on average 1.562254830742409) internal successors, (64518), 41340 states have internal predecessors, (64518), 6957 states have call successors, (6957), 243 states have call predecessors, (6957), 255 states have return successors, (7365), 6945 states have call predecessors, (7365), 6951 states have call successors, (7365) [2025-03-03 14:23:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48511 states to 48511 states and 78840 transitions. [2025-03-03 14:23:10,149 INFO L78 Accepts]: Start accepts. Automaton has 48511 states and 78840 transitions. Word has length 235 [2025-03-03 14:23:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:10,150 INFO L471 AbstractCegarLoop]: Abstraction has 48511 states and 78840 transitions. [2025-03-03 14:23:10,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 48511 states and 78840 transitions. [2025-03-03 14:23:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-03 14:23:10,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:10,278 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:10,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:23:10,278 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:10,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1994758299, now seen corresponding path program 1 times [2025-03-03 14:23:10,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:10,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831242164] [2025-03-03 14:23:10,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:10,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:10,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-03 14:23:10,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-03 14:23:10,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:10,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:10,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831242164] [2025-03-03 14:23:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831242164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:10,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:10,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331356631] [2025-03-03 14:23:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:10,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:10,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:10,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:10,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:10,338 INFO L87 Difference]: Start difference. First operand 48511 states and 78840 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:12,182 INFO L93 Difference]: Finished difference Result 123947 states and 203113 transitions. [2025-03-03 14:23:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:12,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 236 [2025-03-03 14:23:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:12,465 INFO L225 Difference]: With dead ends: 123947 [2025-03-03 14:23:12,466 INFO L226 Difference]: Without dead ends: 82174 [2025-03-03 14:23:12,580 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-03-03 14:23:12,581 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 153 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1696 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-03-03 14:23:12,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1696 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82174 states. [2025-03-03 14:23:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82174 to 82126. [2025-03-03 14:23:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82126 states, 70239 states have (on average 1.5690001281339427) internal successors, (110205), 70281 states have internal predecessors, (110205), 11631 states have call successors, (11631), 243 states have call predecessors, (11631), 255 states have return successors, (12273), 11619 states have call predecessors, (12273), 11625 states have call successors, (12273) [2025-03-03 14:23:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82126 states to 82126 states and 134109 transitions. [2025-03-03 14:23:15,796 INFO L78 Accepts]: Start accepts. Automaton has 82126 states and 134109 transitions. Word has length 236 [2025-03-03 14:23:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:15,797 INFO L471 AbstractCegarLoop]: Abstraction has 82126 states and 134109 transitions. [2025-03-03 14:23:15,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 82126 states and 134109 transitions. [2025-03-03 14:23:15,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-03 14:23:15,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:15,970 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 14:23:15,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:23:15,970 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:15,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash 35157428, now seen corresponding path program 1 times [2025-03-03 14:23:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:15,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116338126] [2025-03-03 14:23:15,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:15,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-03 14:23:15,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-03 14:23:15,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:15,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 14:23:16,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:16,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116338126] [2025-03-03 14:23:16,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116338126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:16,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:16,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:16,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061502790] [2025-03-03 14:23:16,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:16,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:16,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:16,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:16,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:16,029 INFO L87 Difference]: Start difference. First operand 82126 states and 134109 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 14:23:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:19,397 INFO L93 Difference]: Finished difference Result 202271 states and 328633 transitions. [2025-03-03 14:23:19,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:19,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 237 [2025-03-03 14:23:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:19,877 INFO L225 Difference]: With dead ends: 202271 [2025-03-03 14:23:19,877 INFO L226 Difference]: Without dead ends: 131674 [2025-03-03 14:23:20,034 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-03-03 14:23:20,035 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 151 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1681 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-03-03 14:23:20,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1681 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:20,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131674 states.