./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec6_product20.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4216ddf014ff953368f9c10444517e5ad475a960f2c91abb81cda95e6b2b3bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:46:16,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:46:16,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:46:16,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:46:16,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:46:16,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:46:16,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:46:16,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:46:16,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:46:16,592 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:46:16,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:46:16,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:46:16,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:46:16,593 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:46:16,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:46:16,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:46:16,594 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d4216ddf014ff953368f9c10444517e5ad475a960f2c91abb81cda95e6b2b3bf [2025-02-05 15:46:16,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:46:16,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:46:16,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:46:16,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:46:16,868 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:46:16,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product20.cil.c [2025-02-05 15:46:18,002 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40c354fba/59ffaabc98584a14bbc9c9f065860a78/FLAG719ebf421 [2025-02-05 15:46:18,442 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:46:18,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product20.cil.c [2025-02-05 15:46:18,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40c354fba/59ffaabc98584a14bbc9c9f065860a78/FLAG719ebf421 [2025-02-05 15:46:18,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40c354fba/59ffaabc98584a14bbc9c9f065860a78 [2025-02-05 15:46:18,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:46:18,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:46:18,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:46:18,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:46:18,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:46:18,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:46:18" (1/1) ... [2025-02-05 15:46:18,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@babff97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:18, skipping insertion in model container [2025-02-05 15:46:18,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:46:18" (1/1) ... [2025-02-05 15:46:18,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:46:19,067 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product20.cil.c[56376,56389] [2025-02-05 15:46:19,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:46:19,117 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:46:19,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-02-05 15:46:19,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [97] [2025-02-05 15:46:19,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [326] [2025-02-05 15:46:19,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1406] [2025-02-05 15:46:19,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1772] [2025-02-05 15:46:19,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [2184] [2025-02-05 15:46:19,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2234] [2025-02-05 15:46:19,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2528] [2025-02-05 15:46:19,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2537] [2025-02-05 15:46:19,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2846] [2025-02-05 15:46:19,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2863] [2025-02-05 15:46:19,203 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product20.cil.c[56376,56389] [2025-02-05 15:46:19,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:46:19,244 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:46:19,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19 WrapperNode [2025-02-05 15:46:19,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:46:19,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:46:19,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:46:19,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:46:19,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,309 INFO L138 Inliner]: procedures = 129, calls = 202, calls flagged for inlining = 54, calls inlined = 47, statements flattened = 937 [2025-02-05 15:46:19,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:46:19,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:46:19,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:46:19,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:46:19,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,340 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:46:19,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:46:19,359 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:46:19,359 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:46:19,359 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:46:19,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (1/1) ... [2025-02-05 15:46:19,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:46:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:19,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:46:19,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:46:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:46:19,433 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:46:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:46:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:46:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:46:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:46:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:46:19,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:46:19,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:46:19,626 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:46:19,628 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:46:19,696 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2811: #res := ~retValue_acc~38; [2025-02-05 15:46:19,734 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1040: #res#1 := ~retValue_acc~13#1; [2025-02-05 15:46:19,734 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L995-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~12#1; [2025-02-05 15:46:19,742 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L948: #res := ~retValue_acc~11; [2025-02-05 15:46:19,750 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2025-02-05 15:46:19,759 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L492: #res := ~retValue_acc~5; [2025-02-05 15:46:19,769 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2017: #res := ~retValue_acc~28; [2025-02-05 15:46:19,804 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2054: #res := ~retValue_acc~29; [2025-02-05 15:46:19,823 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1902: #res := ~retValue_acc~25; [2025-02-05 15:46:19,869 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L818: #res := ~retValue_acc~9; [2025-02-05 15:46:19,961 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1383-1: getClientId_#res#1 := getClientId_~retValue_acc~18#1; [2025-02-05 15:46:19,961 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1264-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~16#1; [2025-02-05 15:46:19,961 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L901-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~10#1; [2025-02-05 15:46:20,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~36#1; [2025-02-05 15:46:20,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~15#1; [2025-02-05 15:46:20,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2768-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~35#1; [2025-02-05 15:46:20,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2786-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~37#1; [2025-02-05 15:46:20,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:46:20,187 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1103-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~14#1; [2025-02-05 15:46:20,193 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865: #res := ~retValue_acc~24; [2025-02-05 15:46:20,381 INFO L? ?]: Removed 478 outVars from TransFormulas that were not future-live. [2025-02-05 15:46:20,381 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:46:20,392 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:46:20,392 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:46:20,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:46:20 BoogieIcfgContainer [2025-02-05 15:46:20,393 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:46:20,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:46:20,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:46:20,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:46:20,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:46:18" (1/3) ... [2025-02-05 15:46:20,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a98e187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:46:20, skipping insertion in model container [2025-02-05 15:46:20,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:46:19" (2/3) ... [2025-02-05 15:46:20,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a98e187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:46:20, skipping insertion in model container [2025-02-05 15:46:20,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:46:20" (3/3) ... [2025-02-05 15:46:20,400 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product20.cil.c [2025-02-05 15:46:20,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:46:20,411 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product20.cil.c that has 25 procedures, 376 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:46:20,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:46:20,459 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;@69827d8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:46:20,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:46:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 292 states have (on average 1.5650684931506849) internal successors, (457), 297 states have internal predecessors, (457), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 15:46:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:46:20,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:20,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:46:20,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:20,487 INFO L85 PathProgramCache]: Analyzing trace with hash -833135926, now seen corresponding path program 1 times [2025-02-05 15:46:20,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:20,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359306075] [2025-02-05 15:46:20,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:20,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:20,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:46:20,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:46:20,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:20,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:46:21,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:21,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359306075] [2025-02-05 15:46:21,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359306075] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:21,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127278271] [2025-02-05 15:46:21,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:21,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:21,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:21,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:21,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:46:21,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:46:21,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:46:21,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:21,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:21,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:46:21,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:21,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:21,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127278271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:21,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:21,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:46:21,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966089750] [2025-02-05 15:46:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:21,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:46:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:21,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:46:21,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:21,440 INFO L87 Difference]: Start difference. First operand has 376 states, 292 states have (on average 1.5650684931506849) internal successors, (457), 297 states have internal predecessors, (457), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:21,487 INFO L93 Difference]: Finished difference Result 560 states and 838 transitions. [2025-02-05 15:46:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:46:21,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 123 [2025-02-05 15:46:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:21,498 INFO L225 Difference]: With dead ends: 560 [2025-02-05 15:46:21,498 INFO L226 Difference]: Without dead ends: 369 [2025-02-05 15:46:21,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:21,507 INFO L435 NwaCegarLoop]: 570 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, 570 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:21,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-05 15:46:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-02-05 15:46:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 286 states have (on average 1.562937062937063) internal successors, (447), 290 states have internal predecessors, (447), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-05 15:46:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 562 transitions. [2025-02-05 15:46:21,562 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 562 transitions. Word has length 123 [2025-02-05 15:46:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:21,563 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 562 transitions. [2025-02-05 15:46:21,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 562 transitions. [2025-02-05 15:46:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 15:46:21,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:21,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-02-05 15:46:21,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:46:21,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:46:21,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:21,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:21,774 INFO L85 PathProgramCache]: Analyzing trace with hash -482994163, now seen corresponding path program 1 times [2025-02-05 15:46:21,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:21,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044356520] [2025-02-05 15:46:21,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:21,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:21,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:46:21,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:46:21,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:21,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:46:22,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:22,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044356520] [2025-02-05 15:46:22,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044356520] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:22,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976471067] [2025-02-05 15:46:22,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:22,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:22,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:22,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:22,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:46:22,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:46:22,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:46:22,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:22,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:22,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:46:22,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 15:46:22,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:22,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976471067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:22,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:22,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:46:22,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505883746] [2025-02-05 15:46:22,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:22,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:22,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:22,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:22,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:22,383 INFO L87 Difference]: Start difference. First operand 369 states and 562 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:22,427 INFO L93 Difference]: Finished difference Result 549 states and 816 transitions. [2025-02-05 15:46:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:22,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 143 [2025-02-05 15:46:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:22,431 INFO L225 Difference]: With dead ends: 549 [2025-02-05 15:46:22,432 INFO L226 Difference]: Without dead ends: 371 [2025-02-05 15:46:22,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:22,433 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:22,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-05 15:46:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-02-05 15:46:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 288 states have (on average 1.5590277777777777) internal successors, (449), 292 states have internal predecessors, (449), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-05 15:46:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 564 transitions. [2025-02-05 15:46:22,454 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 564 transitions. Word has length 143 [2025-02-05 15:46:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:22,454 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 564 transitions. [2025-02-05 15:46:22,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 564 transitions. [2025-02-05 15:46:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:46:22,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:22,457 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:46:22,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:46:22,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:22,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:22,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1132324324, now seen corresponding path program 1 times [2025-02-05 15:46:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:22,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164932071] [2025-02-05 15:46:22,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:22,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:46:22,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:46:22,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:22,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:46:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164932071] [2025-02-05 15:46:22,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164932071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227416117] [2025-02-05 15:46:22,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:22,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:22,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:22,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:22,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:46:23,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:46:23,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:46:23,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:23,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:23,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:46:23,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:23,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227416117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:23,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:23,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:46:23,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796515989] [2025-02-05 15:46:23,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:23,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:23,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:23,154 INFO L87 Difference]: Start difference. First operand 371 states and 564 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:23,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:23,186 INFO L93 Difference]: Finished difference Result 789 states and 1219 transitions. [2025-02-05 15:46:23,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:23,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2025-02-05 15:46:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:23,196 INFO L225 Difference]: With dead ends: 789 [2025-02-05 15:46:23,196 INFO L226 Difference]: Without dead ends: 445 [2025-02-05 15:46:23,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:46:23,198 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 134 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:23,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1081 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-02-05 15:46:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 437. [2025-02-05 15:46:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 340 states have (on average 1.5794117647058823) internal successors, (537), 344 states have internal predecessors, (537), 72 states have call successors, (72), 24 states have call predecessors, (72), 24 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-02-05 15:46:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 680 transitions. [2025-02-05 15:46:23,239 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 680 transitions. Word has length 132 [2025-02-05 15:46:23,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:23,241 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 680 transitions. [2025-02-05 15:46:23,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 680 transitions. [2025-02-05 15:46:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 15:46:23,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:23,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-05 15:46:23,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:46:23,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:23,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:23,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2086908355, now seen corresponding path program 1 times [2025-02-05 15:46:23,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:23,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398769921] [2025-02-05 15:46:23,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:23,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:23,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:46:23,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:46:23,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:23,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:46:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398769921] [2025-02-05 15:46:23,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398769921] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804072500] [2025-02-05 15:46:23,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:23,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:23,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:23,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:23,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:46:23,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:46:23,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:46:23,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:23,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:23,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:46:23,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:46:23,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804072500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:23,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:23,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:46:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52765514] [2025-02-05 15:46:23,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:23,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:23,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:23,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:23,956 INFO L87 Difference]: Start difference. First operand 437 states and 680 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:46:24,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:24,037 INFO L93 Difference]: Finished difference Result 865 states and 1350 transitions. [2025-02-05 15:46:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:24,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 152 [2025-02-05 15:46:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:24,041 INFO L225 Difference]: With dead ends: 865 [2025-02-05 15:46:24,041 INFO L226 Difference]: Without dead ends: 439 [2025-02-05 15:46:24,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:46:24,042 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:24,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2205 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-02-05 15:46:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2025-02-05 15:46:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 341 states have (on average 1.5777126099706744) internal successors, (538), 346 states have internal predecessors, (538), 72 states have call successors, (72), 24 states have call predecessors, (72), 25 states have return successors, (73), 70 states have call predecessors, (73), 71 states have call successors, (73) [2025-02-05 15:46:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 683 transitions. [2025-02-05 15:46:24,057 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 683 transitions. Word has length 152 [2025-02-05 15:46:24,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:24,057 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 683 transitions. [2025-02-05 15:46:24,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:46:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 683 transitions. [2025-02-05 15:46:24,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 15:46:24,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:24,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:24,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:46:24,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:24,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:24,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:24,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1508926270, now seen corresponding path program 1 times [2025-02-05 15:46:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065725587] [2025-02-05 15:46:24,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:24,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:46:24,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:46:24,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:24,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:24,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065725587] [2025-02-05 15:46:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065725587] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029335852] [2025-02-05 15:46:24,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:24,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:24,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:24,411 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:24,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:46:24,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:46:24,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:46:24,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:24,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:24,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:46:24,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:46:24,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:24,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029335852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:24,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:24,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:46:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313159878] [2025-02-05 15:46:24,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:24,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:24,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:24,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:24,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:24,727 INFO L87 Difference]: Start difference. First operand 439 states and 683 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:46:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:24,795 INFO L93 Difference]: Finished difference Result 867 states and 1355 transitions. [2025-02-05 15:46:24,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:24,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-02-05 15:46:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:24,799 INFO L225 Difference]: With dead ends: 867 [2025-02-05 15:46:24,799 INFO L226 Difference]: Without dead ends: 441 [2025-02-05 15:46:24,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:24,803 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 2 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:24,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2191 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-02-05 15:46:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-02-05 15:46:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 342 states have (on average 1.5760233918128654) internal successors, (539), 348 states have internal predecessors, (539), 72 states have call successors, (72), 24 states have call predecessors, (72), 26 states have return successors, (78), 70 states have call predecessors, (78), 71 states have call successors, (78) [2025-02-05 15:46:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 689 transitions. [2025-02-05 15:46:24,826 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 689 transitions. Word has length 153 [2025-02-05 15:46:24,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:24,826 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 689 transitions. [2025-02-05 15:46:24,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:46:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 689 transitions. [2025-02-05 15:46:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:46:24,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:24,829 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:24,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:46:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:25,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1112108205, now seen corresponding path program 1 times [2025-02-05 15:46:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47844100] [2025-02-05 15:46:25,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:25,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:25,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:46:25,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:46:25,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:25,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:46:25,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:25,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47844100] [2025-02-05 15:46:25,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47844100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:25,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:25,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:25,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336171888] [2025-02-05 15:46:25,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:25,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:25,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:25,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:25,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:25,163 INFO L87 Difference]: Start difference. First operand 441 states and 689 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:25,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:25,206 INFO L93 Difference]: Finished difference Result 859 states and 1346 transitions. [2025-02-05 15:46:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:25,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 135 [2025-02-05 15:46:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:25,211 INFO L225 Difference]: With dead ends: 859 [2025-02-05 15:46:25,211 INFO L226 Difference]: Without dead ends: 441 [2025-02-05 15:46:25,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:25,214 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 2 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:25,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2209 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-02-05 15:46:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-02-05 15:46:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 342 states have (on average 1.5760233918128654) internal successors, (539), 348 states have internal predecessors, (539), 72 states have call successors, (72), 24 states have call predecessors, (72), 26 states have return successors, (77), 70 states have call predecessors, (77), 71 states have call successors, (77) [2025-02-05 15:46:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 688 transitions. [2025-02-05 15:46:25,237 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 688 transitions. Word has length 135 [2025-02-05 15:46:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:25,237 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 688 transitions. [2025-02-05 15:46:25,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 688 transitions. [2025-02-05 15:46:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:46:25,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:25,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:25,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:46:25,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:25,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:25,242 INFO L85 PathProgramCache]: Analyzing trace with hash -58533394, now seen corresponding path program 2 times [2025-02-05 15:46:25,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:25,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625168973] [2025-02-05 15:46:25,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:46:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:25,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-02-05 15:46:25,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:46:25,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:46:25,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:46:25,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625168973] [2025-02-05 15:46:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625168973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092980054] [2025-02-05 15:46:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:25,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:25,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:25,380 INFO L87 Difference]: Start difference. First operand 441 states and 688 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:25,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:25,430 INFO L93 Difference]: Finished difference Result 857 states and 1341 transitions. [2025-02-05 15:46:25,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:25,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 136 [2025-02-05 15:46:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:25,433 INFO L225 Difference]: With dead ends: 857 [2025-02-05 15:46:25,433 INFO L226 Difference]: Without dead ends: 441 [2025-02-05 15:46:25,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:25,437 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 2 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:25,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2195 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-02-05 15:46:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-02-05 15:46:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 342 states have (on average 1.5760233918128654) internal successors, (539), 348 states have internal predecessors, (539), 72 states have call successors, (72), 24 states have call predecessors, (72), 26 states have return successors, (76), 70 states have call predecessors, (76), 71 states have call successors, (76) [2025-02-05 15:46:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 687 transitions. [2025-02-05 15:46:25,484 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 687 transitions. Word has length 136 [2025-02-05 15:46:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:25,485 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 687 transitions. [2025-02-05 15:46:25,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 687 transitions. [2025-02-05 15:46:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:46:25,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:25,488 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:25,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:46:25,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:25,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash -563564836, now seen corresponding path program 3 times [2025-02-05 15:46:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:25,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778935221] [2025-02-05 15:46:25,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:46:25,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:25,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 137 statements into 3 equivalence classes. [2025-02-05 15:46:25,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 125 of 137 statements. [2025-02-05 15:46:25,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:46:25,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:46:25,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:25,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778935221] [2025-02-05 15:46:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778935221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:25,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603369416] [2025-02-05 15:46:25,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:25,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:25,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:25,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:25,602 INFO L87 Difference]: Start difference. First operand 441 states and 687 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:25,649 INFO L93 Difference]: Finished difference Result 859 states and 1347 transitions. [2025-02-05 15:46:25,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:25,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 137 [2025-02-05 15:46:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:25,652 INFO L225 Difference]: With dead ends: 859 [2025-02-05 15:46:25,652 INFO L226 Difference]: Without dead ends: 443 [2025-02-05 15:46:25,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:25,654 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:25,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2206 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:25,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-02-05 15:46:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-02-05 15:46:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 343 states have (on average 1.5743440233236152) internal successors, (540), 350 states have internal predecessors, (540), 72 states have call successors, (72), 24 states have call predecessors, (72), 27 states have return successors, (81), 70 states have call predecessors, (81), 71 states have call successors, (81) [2025-02-05 15:46:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 693 transitions. [2025-02-05 15:46:25,668 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 693 transitions. Word has length 137 [2025-02-05 15:46:25,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:25,668 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 693 transitions. [2025-02-05 15:46:25,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:25,668 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 693 transitions. [2025-02-05 15:46:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 15:46:25,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:25,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:25,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:46:25,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:25,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1602213839, now seen corresponding path program 1 times [2025-02-05 15:46:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:25,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194533546] [2025-02-05 15:46:25,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:25,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:25,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 15:46:25,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 15:46:25,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:25,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 15:46:25,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:25,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194533546] [2025-02-05 15:46:25,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194533546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:25,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:25,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:25,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204148831] [2025-02-05 15:46:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:25,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:25,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:25,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:25,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:25,780 INFO L87 Difference]: Start difference. First operand 443 states and 693 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:25,817 INFO L93 Difference]: Finished difference Result 865 states and 1357 transitions. [2025-02-05 15:46:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:25,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 138 [2025-02-05 15:46:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:25,820 INFO L225 Difference]: With dead ends: 865 [2025-02-05 15:46:25,820 INFO L226 Difference]: Without dead ends: 445 [2025-02-05 15:46:25,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:25,822 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:25,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2212 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-02-05 15:46:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-02-05 15:46:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 344 states have (on average 1.572674418604651) internal successors, (541), 352 states have internal predecessors, (541), 72 states have call successors, (72), 24 states have call predecessors, (72), 28 states have return successors, (83), 70 states have call predecessors, (83), 71 states have call successors, (83) [2025-02-05 15:46:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 696 transitions. [2025-02-05 15:46:25,835 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 696 transitions. Word has length 138 [2025-02-05 15:46:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:25,836 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 696 transitions. [2025-02-05 15:46:25,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:46:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 696 transitions. [2025-02-05 15:46:25,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 15:46:25,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:25,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:25,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:46:25,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:25,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:25,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1671424875, now seen corresponding path program 1 times [2025-02-05 15:46:25,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:25,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995829953] [2025-02-05 15:46:25,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:25,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:25,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:46:25,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:46:25,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:25,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:46:25,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:25,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995829953] [2025-02-05 15:46:25,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995829953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:25,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:25,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:46:25,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776588078] [2025-02-05 15:46:25,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:25,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:46:25,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:25,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:46:25,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:25,967 INFO L87 Difference]: Start difference. First operand 445 states and 696 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:46:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:26,011 INFO L93 Difference]: Finished difference Result 867 states and 1360 transitions. [2025-02-05 15:46:26,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:46:26,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 158 [2025-02-05 15:46:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:26,014 INFO L225 Difference]: With dead ends: 867 [2025-02-05 15:46:26,014 INFO L226 Difference]: Without dead ends: 447 [2025-02-05 15:46:26,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:46:26,016 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:26,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2205 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-02-05 15:46:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2025-02-05 15:46:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 344 states have (on average 1.572674418604651) internal successors, (541), 352 states have internal predecessors, (541), 72 states have call successors, (72), 24 states have call predecessors, (72), 28 states have return successors, (83), 70 states have call predecessors, (83), 71 states have call successors, (83) [2025-02-05 15:46:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 696 transitions. [2025-02-05 15:46:26,031 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 696 transitions. Word has length 158 [2025-02-05 15:46:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:26,031 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 696 transitions. [2025-02-05 15:46:26,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-02-05 15:46:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 696 transitions. [2025-02-05 15:46:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:46:26,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:26,033 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:26,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:46:26,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:26,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:26,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1310153517, now seen corresponding path program 1 times [2025-02-05 15:46:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:26,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195720129] [2025-02-05 15:46:26,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:26,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:26,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:46:26,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:46:26,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:26,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:46:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195720129] [2025-02-05 15:46:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195720129] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:26,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313402993] [2025-02-05 15:46:26,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:26,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:26,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:26,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:26,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:46:26,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:46:26,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:46:26,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:26,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:26,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:46:26,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:26,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:46:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:26,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313402993] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:46:26,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:46:26,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:46:26,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439579323] [2025-02-05 15:46:26,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:46:26,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:46:26,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:26,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:46:26,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:46:26,594 INFO L87 Difference]: Start difference. First operand 445 states and 696 transitions. Second operand has 11 states, 10 states have (on average 14.5) internal successors, (145), 11 states have internal predecessors, (145), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-05 15:46:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:27,199 INFO L93 Difference]: Finished difference Result 1300 states and 2122 transitions. [2025-02-05 15:46:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:46:27,199 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.5) internal successors, (145), 11 states have internal predecessors, (145), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) Word has length 139 [2025-02-05 15:46:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:27,204 INFO L225 Difference]: With dead ends: 1300 [2025-02-05 15:46:27,204 INFO L226 Difference]: Without dead ends: 884 [2025-02-05 15:46:27,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:46:27,206 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 1509 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 3581 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:27,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 3581 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:46:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-02-05 15:46:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 860. [2025-02-05 15:46:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 680 states have (on average 1.6235294117647059) internal successors, (1104), 687 states have internal predecessors, (1104), 151 states have call successors, (151), 25 states have call predecessors, (151), 28 states have return successors, (172), 149 states have call predecessors, (172), 150 states have call successors, (172) [2025-02-05 15:46:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1427 transitions. [2025-02-05 15:46:27,239 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1427 transitions. Word has length 139 [2025-02-05 15:46:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:27,239 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1427 transitions. [2025-02-05 15:46:27,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.5) internal successors, (145), 11 states have internal predecessors, (145), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-05 15:46:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1427 transitions. [2025-02-05 15:46:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 15:46:27,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:27,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:27,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:46:27,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:46:27,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:27,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:27,444 INFO L85 PathProgramCache]: Analyzing trace with hash -595750055, now seen corresponding path program 1 times [2025-02-05 15:46:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:27,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658402331] [2025-02-05 15:46:27,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:27,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:27,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 15:46:27,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 15:46:27,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:27,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:27,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:27,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658402331] [2025-02-05 15:46:27,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658402331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:27,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:27,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:27,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32667903] [2025-02-05 15:46:27,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:27,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:27,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:27,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:27,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:27,490 INFO L87 Difference]: Start difference. First operand 860 states and 1427 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:27,524 INFO L93 Difference]: Finished difference Result 2035 states and 3432 transitions. [2025-02-05 15:46:27,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:27,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2025-02-05 15:46:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:27,530 INFO L225 Difference]: With dead ends: 2035 [2025-02-05 15:46:27,530 INFO L226 Difference]: Without dead ends: 1253 [2025-02-05 15:46:27,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:27,532 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 131 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:27,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1117 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-02-05 15:46:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1245. [2025-02-05 15:46:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 986 states have (on average 1.6419878296146044) internal successors, (1619), 993 states have internal predecessors, (1619), 230 states have call successors, (230), 25 states have call predecessors, (230), 28 states have return successors, (261), 228 states have call predecessors, (261), 229 states have call successors, (261) [2025-02-05 15:46:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 2110 transitions. [2025-02-05 15:46:27,580 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 2110 transitions. Word has length 161 [2025-02-05 15:46:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:27,581 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 2110 transitions. [2025-02-05 15:46:27,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:27,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 2110 transitions. [2025-02-05 15:46:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 15:46:27,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:27,587 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:27,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:46:27,587 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:27,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash 841277050, now seen corresponding path program 1 times [2025-02-05 15:46:27,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:27,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098467939] [2025-02-05 15:46:27,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:27,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:27,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 15:46:27,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 15:46:27,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:27,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:27,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098467939] [2025-02-05 15:46:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098467939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:27,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:27,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:27,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122847052] [2025-02-05 15:46:27,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:27,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:27,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:27,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:27,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:27,640 INFO L87 Difference]: Start difference. First operand 1245 states and 2110 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:27,687 INFO L93 Difference]: Finished difference Result 2998 states and 5114 transitions. [2025-02-05 15:46:27,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:27,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2025-02-05 15:46:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:27,696 INFO L225 Difference]: With dead ends: 2998 [2025-02-05 15:46:27,696 INFO L226 Difference]: Without dead ends: 1882 [2025-02-05 15:46:27,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:27,700 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 129 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:27,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2025-02-05 15:46:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1874. [2025-02-05 15:46:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1496 states have (on average 1.6504010695187166) internal successors, (2469), 1503 states have internal predecessors, (2469), 349 states have call successors, (349), 25 states have call predecessors, (349), 28 states have return successors, (380), 347 states have call predecessors, (380), 348 states have call successors, (380) [2025-02-05 15:46:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 3198 transitions. [2025-02-05 15:46:27,824 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 3198 transitions. Word has length 162 [2025-02-05 15:46:27,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:27,827 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 3198 transitions. [2025-02-05 15:46:27,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 3198 transitions. [2025-02-05 15:46:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 15:46:27,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:27,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:27,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:46:27,848 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:27,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash -676538440, now seen corresponding path program 1 times [2025-02-05 15:46:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:27,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440271938] [2025-02-05 15:46:27,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:27,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 15:46:27,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 15:46:27,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:27,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:27,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:27,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440271938] [2025-02-05 15:46:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440271938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:27,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:27,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:27,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646088054] [2025-02-05 15:46:27,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:27,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:27,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:27,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:27,943 INFO L87 Difference]: Start difference. First operand 1874 states and 3198 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:28,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:28,089 INFO L93 Difference]: Finished difference Result 4460 states and 7673 transitions. [2025-02-05 15:46:28,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:28,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 163 [2025-02-05 15:46:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:28,117 INFO L225 Difference]: With dead ends: 4460 [2025-02-05 15:46:28,118 INFO L226 Difference]: Without dead ends: 2847 [2025-02-05 15:46:28,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:28,131 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 127 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:28,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2025-02-05 15:46:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2839. [2025-02-05 15:46:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2299 states have (on average 1.6572422792518486) internal successors, (3810), 2306 states have internal predecessors, (3810), 511 states have call successors, (511), 25 states have call predecessors, (511), 28 states have return successors, (558), 509 states have call predecessors, (558), 510 states have call successors, (558) [2025-02-05 15:46:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4879 transitions. [2025-02-05 15:46:28,311 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4879 transitions. Word has length 163 [2025-02-05 15:46:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:28,312 INFO L471 AbstractCegarLoop]: Abstraction has 2839 states and 4879 transitions. [2025-02-05 15:46:28,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4879 transitions. [2025-02-05 15:46:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 15:46:28,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:28,330 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:28,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:46:28,330 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:28,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash -718345285, now seen corresponding path program 1 times [2025-02-05 15:46:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:28,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627500725] [2025-02-05 15:46:28,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:28,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 15:46:28,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 15:46:28,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:28,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:28,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:28,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627500725] [2025-02-05 15:46:28,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627500725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:28,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:28,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:28,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754160682] [2025-02-05 15:46:28,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:28,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:28,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:28,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:28,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:28,391 INFO L87 Difference]: Start difference. First operand 2839 states and 4879 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:28,523 INFO L93 Difference]: Finished difference Result 6768 states and 11720 transitions. [2025-02-05 15:46:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:28,524 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 164 [2025-02-05 15:46:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:28,545 INFO L225 Difference]: With dead ends: 6768 [2025-02-05 15:46:28,545 INFO L226 Difference]: Without dead ends: 4405 [2025-02-05 15:46:28,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:28,554 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 125 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:28,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4405 states. [2025-02-05 15:46:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4405 to 4397. [2025-02-05 15:46:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 3612 states have (on average 1.6622369878183831) internal successors, (6004), 3619 states have internal predecessors, (6004), 756 states have call successors, (756), 25 states have call predecessors, (756), 28 states have return successors, (829), 754 states have call predecessors, (829), 755 states have call successors, (829) [2025-02-05 15:46:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7589 transitions. [2025-02-05 15:46:28,753 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7589 transitions. Word has length 164 [2025-02-05 15:46:28,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:28,754 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7589 transitions. [2025-02-05 15:46:28,754 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, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:28,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7589 transitions. [2025-02-05 15:46:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:46:28,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:28,772 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:28,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:46:28,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:28,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1900755512, now seen corresponding path program 1 times [2025-02-05 15:46:28,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:28,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715768826] [2025-02-05 15:46:28,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:28,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:28,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:46:28,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:46:28,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:28,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:28,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715768826] [2025-02-05 15:46:28,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715768826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:28,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:28,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:28,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11363815] [2025-02-05 15:46:28,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:28,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:28,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:28,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:28,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:28,816 INFO L87 Difference]: Start difference. First operand 4397 states and 7589 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:29,029 INFO L93 Difference]: Finished difference Result 10883 states and 18893 transitions. [2025-02-05 15:46:29,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:29,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-02-05 15:46:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:29,066 INFO L225 Difference]: With dead ends: 10883 [2025-02-05 15:46:29,066 INFO L226 Difference]: Without dead ends: 7209 [2025-02-05 15:46:29,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:29,083 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 123 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:29,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7209 states. [2025-02-05 15:46:29,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7209 to 7201. [2025-02-05 15:46:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7201 states, 5923 states have (on average 1.6586189431031573) internal successors, (9824), 5930 states have internal predecessors, (9824), 1249 states have call successors, (1249), 25 states have call predecessors, (1249), 28 states have return successors, (1366), 1247 states have call predecessors, (1366), 1248 states have call successors, (1366) [2025-02-05 15:46:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7201 states to 7201 states and 12439 transitions. [2025-02-05 15:46:29,366 INFO L78 Accepts]: Start accepts. Automaton has 7201 states and 12439 transitions. Word has length 146 [2025-02-05 15:46:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:29,367 INFO L471 AbstractCegarLoop]: Abstraction has 7201 states and 12439 transitions. [2025-02-05 15:46:29,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 7201 states and 12439 transitions. [2025-02-05 15:46:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 15:46:29,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:29,391 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:29,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:46:29,391 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:29,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1278875588, now seen corresponding path program 1 times [2025-02-05 15:46:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:29,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466656792] [2025-02-05 15:46:29,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:29,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 15:46:29,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 15:46:29,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:29,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:29,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:29,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466656792] [2025-02-05 15:46:29,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466656792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:29,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:29,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:29,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019094971] [2025-02-05 15:46:29,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:29,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:29,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:29,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:29,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:29,482 INFO L87 Difference]: Start difference. First operand 7201 states and 12439 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:29,680 INFO L93 Difference]: Finished difference Result 18198 states and 31641 transitions. [2025-02-05 15:46:29,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:29,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 166 [2025-02-05 15:46:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:29,732 INFO L225 Difference]: With dead ends: 18198 [2025-02-05 15:46:29,732 INFO L226 Difference]: Without dead ends: 12116 [2025-02-05 15:46:29,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:29,757 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 121 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:29,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12116 states. [2025-02-05 15:46:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12116 to 12108. [2025-02-05 15:46:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12108 states, 10008 states have (on average 1.6589728217426059) internal successors, (16603), 10015 states have internal predecessors, (16603), 2071 states have call successors, (2071), 25 states have call predecessors, (2071), 28 states have return successors, (2266), 2069 states have call predecessors, (2266), 2070 states have call successors, (2266) [2025-02-05 15:46:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12108 states to 12108 states and 20940 transitions. [2025-02-05 15:46:30,205 INFO L78 Accepts]: Start accepts. Automaton has 12108 states and 20940 transitions. Word has length 166 [2025-02-05 15:46:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:30,205 INFO L471 AbstractCegarLoop]: Abstraction has 12108 states and 20940 transitions. [2025-02-05 15:46:30,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 12108 states and 20940 transitions. [2025-02-05 15:46:30,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:46:30,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:30,242 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:30,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:46:30,242 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:30,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:30,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1249677559, now seen corresponding path program 1 times [2025-02-05 15:46:30,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:30,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158910672] [2025-02-05 15:46:30,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:30,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:30,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:46:30,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:46:30,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:30,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:30,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:30,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158910672] [2025-02-05 15:46:30,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158910672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:30,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:30,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:30,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220160398] [2025-02-05 15:46:30,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:30,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:30,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:30,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:30,365 INFO L87 Difference]: Start difference. First operand 12108 states and 20940 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:30,800 INFO L93 Difference]: Finished difference Result 28954 states and 50018 transitions. [2025-02-05 15:46:30,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:30,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 148 [2025-02-05 15:46:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:30,877 INFO L225 Difference]: With dead ends: 28954 [2025-02-05 15:46:30,877 INFO L226 Difference]: Without dead ends: 18932 [2025-02-05 15:46:30,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:30,912 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 119 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:30,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1086 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2025-02-05 15:46:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 18924. [2025-02-05 15:46:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18924 states, 15621 states have (on average 1.634722488957173) internal successors, (25536), 15628 states have internal predecessors, (25536), 3274 states have call successors, (3274), 25 states have call predecessors, (3274), 28 states have return successors, (3613), 3272 states have call predecessors, (3613), 3273 states have call successors, (3613) [2025-02-05 15:46:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18924 states to 18924 states and 32423 transitions. [2025-02-05 15:46:31,803 INFO L78 Accepts]: Start accepts. Automaton has 18924 states and 32423 transitions. Word has length 148 [2025-02-05 15:46:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:31,804 INFO L471 AbstractCegarLoop]: Abstraction has 18924 states and 32423 transitions. [2025-02-05 15:46:31,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 18924 states and 32423 transitions. [2025-02-05 15:46:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:46:31,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:31,842 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:31,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:46:31,843 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:31,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1853467458, now seen corresponding path program 1 times [2025-02-05 15:46:31,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:31,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310307937] [2025-02-05 15:46:31,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:31,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:31,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:46:31,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:46:31,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:31,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 15:46:31,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:31,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310307937] [2025-02-05 15:46:31,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310307937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:31,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:31,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:31,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781444928] [2025-02-05 15:46:31,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:31,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:31,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:31,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:31,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:31,996 INFO L87 Difference]: Start difference. First operand 18924 states and 32423 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:32,674 INFO L93 Difference]: Finished difference Result 49991 states and 86001 transitions. [2025-02-05 15:46:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:32,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 149 [2025-02-05 15:46:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:32,793 INFO L225 Difference]: With dead ends: 49991 [2025-02-05 15:46:32,793 INFO L226 Difference]: Without dead ends: 33787 [2025-02-05 15:46:32,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:32,829 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 117 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:32,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:32,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33787 states. [2025-02-05 15:46:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33787 to 33779. [2025-02-05 15:46:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33779 states, 28026 states have (on average 1.6319132234353815) internal successors, (45736), 28033 states have internal predecessors, (45736), 5724 states have call successors, (5724), 25 states have call predecessors, (5724), 28 states have return successors, (6337), 5722 states have call predecessors, (6337), 5723 states have call successors, (6337) [2025-02-05 15:46:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33779 states to 33779 states and 57797 transitions. [2025-02-05 15:46:33,815 INFO L78 Accepts]: Start accepts. Automaton has 33779 states and 57797 transitions. Word has length 149 [2025-02-05 15:46:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:33,816 INFO L471 AbstractCegarLoop]: Abstraction has 33779 states and 57797 transitions. [2025-02-05 15:46:33,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:46:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 33779 states and 57797 transitions. [2025-02-05 15:46:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 15:46:33,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:33,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:33,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:46:33,859 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:33,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:33,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1571651221, now seen corresponding path program 1 times [2025-02-05 15:46:33,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:33,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347802574] [2025-02-05 15:46:33,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:33,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:33,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 15:46:33,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 15:46:33,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:33,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:33,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:33,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347802574] [2025-02-05 15:46:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347802574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:33,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:33,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621842513] [2025-02-05 15:46:33,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:33,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:33,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:33,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:33,913 INFO L87 Difference]: Start difference. First operand 33779 states and 57797 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:35,561 INFO L93 Difference]: Finished difference Result 92083 states and 158088 transitions. [2025-02-05 15:46:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:35,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 169 [2025-02-05 15:46:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:35,806 INFO L225 Difference]: With dead ends: 92083 [2025-02-05 15:46:35,807 INFO L226 Difference]: Without dead ends: 61931 [2025-02-05 15:46:35,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:35,878 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 115 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:35,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61931 states. [2025-02-05 15:46:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61931 to 61923. [2025-02-05 15:46:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61923 states, 51657 states have (on average 1.6280078208180886) internal successors, (84098), 51664 states have internal predecessors, (84098), 10237 states have call successors, (10237), 25 states have call predecessors, (10237), 28 states have return successors, (11382), 10235 states have call predecessors, (11382), 10236 states have call successors, (11382) [2025-02-05 15:46:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61923 states to 61923 states and 105717 transitions. [2025-02-05 15:46:37,861 INFO L78 Accepts]: Start accepts. Automaton has 61923 states and 105717 transitions. Word has length 169 [2025-02-05 15:46:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:37,861 INFO L471 AbstractCegarLoop]: Abstraction has 61923 states and 105717 transitions. [2025-02-05 15:46:37,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 61923 states and 105717 transitions. [2025-02-05 15:46:37,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 15:46:37,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:37,915 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:37,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:46:37,915 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:37,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash -906468514, now seen corresponding path program 1 times [2025-02-05 15:46:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:37,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031403931] [2025-02-05 15:46:37,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:37,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 15:46:37,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 15:46:37,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:37,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:46:37,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:37,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031403931] [2025-02-05 15:46:37,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031403931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:37,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:46:37,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:46:37,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311715505] [2025-02-05 15:46:37,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:37,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:46:37,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:37,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:46:37,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:37,969 INFO L87 Difference]: Start difference. First operand 61923 states and 105717 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:40,449 INFO L93 Difference]: Finished difference Result 115949 states and 198386 transitions. [2025-02-05 15:46:40,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:46:40,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 170 [2025-02-05 15:46:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:40,875 INFO L225 Difference]: With dead ends: 115949 [2025-02-05 15:46:40,875 INFO L226 Difference]: Without dead ends: 115771 [2025-02-05 15:46:40,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:46:40,923 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 110 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:40,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:46:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115771 states. [2025-02-05 15:46:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115771 to 115763. [2025-02-05 15:46:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115763 states, 97129 states have (on average 1.6229241524158593) internal successors, (157633), 97136 states have internal predecessors, (157633), 18605 states have call successors, (18605), 25 states have call predecessors, (18605), 28 states have return successors, (20796), 18603 states have call predecessors, (20796), 18604 states have call successors, (20796) [2025-02-05 15:46:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115763 states to 115763 states and 197034 transitions. [2025-02-05 15:46:44,649 INFO L78 Accepts]: Start accepts. Automaton has 115763 states and 197034 transitions. Word has length 170 [2025-02-05 15:46:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:46:44,649 INFO L471 AbstractCegarLoop]: Abstraction has 115763 states and 197034 transitions. [2025-02-05 15:46:44,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:46:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 115763 states and 197034 transitions. [2025-02-05 15:46:44,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 15:46:44,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:46:44,726 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:46:44,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:46:44,727 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:46:44,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:46:44,727 INFO L85 PathProgramCache]: Analyzing trace with hash -2015761525, now seen corresponding path program 1 times [2025-02-05 15:46:44,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:46:44,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245950034] [2025-02-05 15:46:44,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:46:44,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:46:44,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:46:44,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:44,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:46:45,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:46:45,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245950034] [2025-02-05 15:46:45,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245950034] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:46:45,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443227647] [2025-02-05 15:46:45,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:46:45,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:46:45,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:46:45,419 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:46:45,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:46:45,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:46:45,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:46:45,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:46:45,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:46:45,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 15:46:45,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:46:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:46:46,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:46:46,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443227647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:46:46,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:46:46,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-02-05 15:46:46,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658698936] [2025-02-05 15:46:46,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:46:46,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:46:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:46:46,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:46:46,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:46:46,030 INFO L87 Difference]: Start difference. First operand 115763 states and 197034 transitions. Second operand has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 9 states have internal predecessors, (111), 5 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2025-02-05 15:46:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:46:51,120 INFO L93 Difference]: Finished difference Result 230639 states and 398031 transitions. [2025-02-05 15:46:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:46:51,120 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.090909090909092) internal successors, (111), 9 states have internal predecessors, (111), 5 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 152 [2025-02-05 15:46:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:46:52,407 INFO L225 Difference]: With dead ends: 230639 [2025-02-05 15:46:52,407 INFO L226 Difference]: Without dead ends: 230467 [2025-02-05 15:46:52,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 15:46:52,530 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 895 mSDsluCounter, 5222 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 5877 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:46:52,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 5877 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:46:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230467 states.