./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec4_product35.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0684811b66680ff9a661ea21879b3502eab6dd1ae141cb77fa167c05dd5b0ff9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:34:26,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:34:26,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:34:26,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:34:26,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:34:26,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:34:26,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:34:26,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:34:26,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:34:26,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:34:26,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:34:26,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:34:26,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:34:26,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:34:26,858 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:34:26,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:34:26,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:34:26,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:34:26,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:34:26,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:34:26,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:34:26,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:34:26,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:34:26,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:34:26,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:34:26,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:34:26,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:34:26,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:34:26,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:34:26,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:34:26,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:34:26,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:34:26,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:34:26,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:34:26,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:34:26,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:34:26,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:34:26,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:34:26,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:34:26,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:34:26,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:34:26,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:34:26,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:34:26,860 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0684811b66680ff9a661ea21879b3502eab6dd1ae141cb77fa167c05dd5b0ff9 [2025-03-08 05:34:27,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:34:27,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:34:27,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:34:27,108 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:34:27,108 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:34:27,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product35.cil.c [2025-03-08 05:34:28,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9371052/5ecfd1ffbaf84724ad4b8c3d5f3b53ee/FLAG9ef10f8e0 [2025-03-08 05:34:28,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:34:28,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product35.cil.c [2025-03-08 05:34:28,731 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9371052/5ecfd1ffbaf84724ad4b8c3d5f3b53ee/FLAG9ef10f8e0 [2025-03-08 05:34:28,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b9371052/5ecfd1ffbaf84724ad4b8c3d5f3b53ee [2025-03-08 05:34:28,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:34:28,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:34:28,751 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:34:28,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:34:28,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:34:28,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:34:28" (1/1) ... [2025-03-08 05:34:28,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30be30f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:28, skipping insertion in model container [2025-03-08 05:34:28,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:34:28" (1/1) ... [2025-03-08 05:34:28,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:34:28,901 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product35.cil.c[1542,1555] [2025-03-08 05:34:29,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:34:29,147 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:34:29,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-08 05:34:29,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [57] [2025-03-08 05:34:29,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [75] [2025-03-08 05:34:29,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [487] [2025-03-08 05:34:29,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [536] [2025-03-08 05:34:29,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1616] [2025-03-08 05:34:29,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1754] [2025-03-08 05:34:29,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1987] [2025-03-08 05:34:29,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2353] [2025-03-08 05:34:29,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2658] [2025-03-08 05:34:29,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [3092] [2025-03-08 05:34:29,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product35.cil.c[1542,1555] [2025-03-08 05:34:29,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:34:29,282 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:34:29,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29 WrapperNode [2025-03-08 05:34:29,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:34:29,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:34:29,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:34:29,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:34:29,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,365 INFO L138 Inliner]: procedures = 137, calls = 227, calls flagged for inlining = 66, calls inlined = 63, statements flattened = 1150 [2025-03-08 05:34:29,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:34:29,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:34:29,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:34:29,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:34:29,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,405 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:34:29,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,421 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:34:29,434 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:34:29,434 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:34:29,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:34:29,435 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (1/1) ... [2025-03-08 05:34:29,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:34:29,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:29,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:34:29,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:34:29,487 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:34:29,487 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:34:29,487 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:34:29,487 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:34:29,487 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:34:29,487 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:34:29,487 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:34:29,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:34:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:34:29,488 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:34:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:34:29,488 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:34:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:34:29,488 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:34:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:34:29,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:34:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:34:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:34:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:34:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:34:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:34:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:34:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:34:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:34:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:34:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:34:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:34:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:34:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:34:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:34:29,490 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:34:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:34:29,491 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:34:29,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:34:29,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:34:29,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:34:29,683 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:34:29,686 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:34:29,774 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L394: #res := ~retValue_acc~9; [2025-03-08 05:34:29,788 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2976: #res := ~retValue_acc~43; [2025-03-08 05:34:29,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1205-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~24#1; [2025-03-08 05:34:29,852 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1250: #res#1 := ~retValue_acc~25#1; [2025-03-08 05:34:29,880 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1474: #res := ~retValue_acc~28; [2025-03-08 05:34:29,888 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1158: #res := ~retValue_acc~23; [2025-03-08 05:34:29,897 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1751-1: createEmail_#res#1 := createEmail_~retValue_acc~34#1; [2025-03-08 05:34:29,906 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L702: #res := ~retValue_acc~17; [2025-03-08 05:34:29,916 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L320: #res := ~retValue_acc~7; [2025-03-08 05:34:29,961 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: #res := ~retValue_acc~8; [2025-03-08 05:34:29,966 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L431: #res := ~retValue_acc~10; [2025-03-08 05:34:29,984 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L205: #res := ~retValue_acc~4; [2025-03-08 05:34:30,035 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028: #res := ~retValue_acc~21; [2025-03-08 05:34:30,154 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1111-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~22#1; [2025-03-08 05:34:30,154 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L468-1: isVerified_#res#1 := isVerified_~retValue_acc~11#1; [2025-03-08 05:34:30,154 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L131-1: getEmailId_#res#1 := getEmailId_~retValue_acc~2#1; [2025-03-08 05:34:30,154 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1593-1: getClientId_#res#1 := getClientId_~retValue_acc~30#1; [2025-03-08 05:34:30,154 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1546-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~29#1; [2025-03-08 05:34:30,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2942-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~41#1; [2025-03-08 05:34:30,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L533-1: valid_product_#res#1 := valid_product_~retValue_acc~13#1; [2025-03-08 05:34:30,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1313-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~26#1; [2025-03-08 05:34:30,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2933-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~40#1; [2025-03-08 05:34:30,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~42#1; [2025-03-08 05:34:30,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1420-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~27#1; [2025-03-08 05:34:30,340 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L168: #res := ~retValue_acc~3; [2025-03-08 05:34:30,351 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727: #res#1 := ~retValue_acc~32#1; [2025-03-08 05:34:30,351 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1707-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~31#1; [2025-03-08 05:34:30,516 INFO L? ?]: Removed 608 outVars from TransFormulas that were not future-live. [2025-03-08 05:34:30,516 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:34:30,536 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:34:30,538 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:34:30,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:34:30 BoogieIcfgContainer [2025-03-08 05:34:30,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:34:30,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:34:30,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:34:30,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:34:30,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:34:28" (1/3) ... [2025-03-08 05:34:30,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7785e2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:34:30, skipping insertion in model container [2025-03-08 05:34:30,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:34:29" (2/3) ... [2025-03-08 05:34:30,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7785e2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:34:30, skipping insertion in model container [2025-03-08 05:34:30,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:34:30" (3/3) ... [2025-03-08 05:34:30,547 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product35.cil.c [2025-03-08 05:34:30,560 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:34:30,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product35.cil.c that has 30 procedures, 464 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:34:30,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:34:30,639 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;@6e897d89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:34:30,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:34:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 464 states, 358 states have (on average 1.5363128491620113) internal successors, (550), 363 states have internal predecessors, (550), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-08 05:34:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:34:30,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:30,666 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:30,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:30,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:30,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1408181650, now seen corresponding path program 1 times [2025-03-08 05:34:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681590915] [2025-03-08 05:34:30,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:30,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:34:30,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:34:30,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:30,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:31,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:31,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681590915] [2025-03-08 05:34:31,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681590915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:31,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97999243] [2025-03-08 05:34:31,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:31,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:31,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:31,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:31,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:34:31,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:34:31,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:34:31,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:31,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:31,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:34:31,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 05:34:31,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:31,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97999243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:31,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:31,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:34:31,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212004223] [2025-03-08 05:34:31,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:31,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:31,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:31,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:31,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:34:31,678 INFO L87 Difference]: Start difference. First operand has 464 states, 358 states have (on average 1.5363128491620113) internal successors, (550), 363 states have internal predecessors, (550), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:34:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:31,762 INFO L93 Difference]: Finished difference Result 733 states and 1088 transitions. [2025-03-08 05:34:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:31,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2025-03-08 05:34:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:31,774 INFO L225 Difference]: With dead ends: 733 [2025-03-08 05:34:31,774 INFO L226 Difference]: Without dead ends: 458 [2025-03-08 05:34:31,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 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-03-08 05:34:31,780 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 0 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1389 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-03-08 05:34:31,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-08 05:34:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2025-03-08 05:34:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 353 states have (on average 1.5325779036827196) internal successors, (541), 357 states have internal predecessors, (541), 75 states have call successors, (75), 29 states have call predecessors, (75), 29 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 05:34:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 690 transitions. [2025-03-08 05:34:31,858 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 690 transitions. Word has length 135 [2025-03-08 05:34:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:31,860 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 690 transitions. [2025-03-08 05:34:31,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:34:31,860 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 690 transitions. [2025-03-08 05:34:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 05:34:31,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:31,867 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-03-08 05:34:31,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:32,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:34:32,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:32,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1986800771, now seen corresponding path program 1 times [2025-03-08 05:34:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:32,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88147682] [2025-03-08 05:34:32,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:32,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:34:32,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:34:32,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:32,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:32,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:32,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88147682] [2025-03-08 05:34:32,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88147682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:32,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784485392] [2025-03-08 05:34:32,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:32,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:32,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:32,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:32,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:34:32,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 05:34:32,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 05:34:32,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:32,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:32,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:34:32,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:34:32,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:32,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784485392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:32,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:32,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:34:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105994260] [2025-03-08 05:34:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:32,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:34:32,648 INFO L87 Difference]: Start difference. First operand 458 states and 690 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:32,706 INFO L93 Difference]: Finished difference Result 968 states and 1479 transitions. [2025-03-08 05:34:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:32,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-03-08 05:34:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:32,711 INFO L225 Difference]: With dead ends: 968 [2025-03-08 05:34:32,711 INFO L226 Difference]: Without dead ends: 536 [2025-03-08 05:34:32,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 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-03-08 05:34:32,715 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 142 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:32,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1336 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-08 05:34:32,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 528. [2025-03-08 05:34:32,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 409 states have (on average 1.5550122249388754) internal successors, (636), 413 states have internal predecessors, (636), 89 states have call successors, (89), 29 states have call predecessors, (89), 29 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-08 05:34:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 813 transitions. [2025-03-08 05:34:32,754 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 813 transitions. Word has length 123 [2025-03-08 05:34:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:32,754 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 813 transitions. [2025-03-08 05:34:32,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 813 transitions. [2025-03-08 05:34:32,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:34:32,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:32,759 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, 1] [2025-03-08 05:34:32,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:34:32,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:34:32,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:32,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:32,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1475010342, now seen corresponding path program 1 times [2025-03-08 05:34:32,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:32,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952122911] [2025-03-08 05:34:32,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:32,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:32,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:34:32,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:34:32,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:32,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:33,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:33,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952122911] [2025-03-08 05:34:33,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952122911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:33,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078168640] [2025-03-08 05:34:33,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:33,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:33,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:33,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:33,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:34:33,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:34:33,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:34:33,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:33,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:33,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:34:33,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:34:33,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:33,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078168640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:33,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:33,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:34:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489172806] [2025-03-08 05:34:33,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:33,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:33,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:33,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:33,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:33,455 INFO L87 Difference]: Start difference. First operand 528 states and 813 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:34:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:33,528 INFO L93 Difference]: Finished difference Result 1047 states and 1616 transitions. [2025-03-08 05:34:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:33,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-03-08 05:34:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:33,533 INFO L225 Difference]: With dead ends: 1047 [2025-03-08 05:34:33,533 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 05:34:33,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 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-03-08 05:34:33,537 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 2 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2713 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-03-08 05:34:33,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2713 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 05:34:33,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-08 05:34:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 410 states have (on average 1.553658536585366) internal successors, (637), 415 states have internal predecessors, (637), 89 states have call successors, (89), 29 states have call predecessors, (89), 30 states have return successors, (90), 87 states have call predecessors, (90), 88 states have call successors, (90) [2025-03-08 05:34:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 816 transitions. [2025-03-08 05:34:33,561 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 816 transitions. Word has length 124 [2025-03-08 05:34:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:33,562 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 816 transitions. [2025-03-08 05:34:33,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:34:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 816 transitions. [2025-03-08 05:34:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 05:34:33,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:33,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:33,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:33,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:33,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:33,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:33,770 INFO L85 PathProgramCache]: Analyzing trace with hash 933550449, now seen corresponding path program 1 times [2025-03-08 05:34:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:33,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196033157] [2025-03-08 05:34:33,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:33,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:34:33,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:34:33,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:33,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 05:34:33,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196033157] [2025-03-08 05:34:33,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196033157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:33,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179126169] [2025-03-08 05:34:33,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:33,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:33,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:33,957 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:33,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:34:34,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:34:34,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:34:34,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:34,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:34,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:34:34,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:34:34,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:34:34,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179126169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:34,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:34:34,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:34:34,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641035303] [2025-03-08 05:34:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:34,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:34,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:34,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:34,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:34:34,251 INFO L87 Difference]: Start difference. First operand 530 states and 816 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:34:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:34,315 INFO L93 Difference]: Finished difference Result 1049 states and 1621 transitions. [2025-03-08 05:34:34,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:34,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-03-08 05:34:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:34,319 INFO L225 Difference]: With dead ends: 1049 [2025-03-08 05:34:34,319 INFO L226 Difference]: Without dead ends: 532 [2025-03-08 05:34:34,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 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-03-08 05:34:34,323 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 2 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2699 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-03-08 05:34:34,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2699 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-08 05:34:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-08 05:34:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 411 states have (on average 1.5523114355231145) internal successors, (638), 417 states have internal predecessors, (638), 89 states have call successors, (89), 29 states have call predecessors, (89), 31 states have return successors, (95), 87 states have call predecessors, (95), 88 states have call successors, (95) [2025-03-08 05:34:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 822 transitions. [2025-03-08 05:34:34,345 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 822 transitions. Word has length 144 [2025-03-08 05:34:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:34,346 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 822 transitions. [2025-03-08 05:34:34,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:34:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 822 transitions. [2025-03-08 05:34:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:34:34,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:34,349 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] [2025-03-08 05:34:34,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:34,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:34,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:34,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash -467222362, now seen corresponding path program 1 times [2025-03-08 05:34:34,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:34,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262315412] [2025-03-08 05:34:34,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:34,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:34,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:34:34,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:34:34,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:34,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:34,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:34,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262315412] [2025-03-08 05:34:34,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262315412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:34,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:34,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:34:34,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042978740] [2025-03-08 05:34:34,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:34,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:34,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:34,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:34,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:34,690 INFO L87 Difference]: Start difference. First operand 532 states and 822 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:34:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:34,737 INFO L93 Difference]: Finished difference Result 1041 states and 1612 transitions. [2025-03-08 05:34:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:34,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2025-03-08 05:34:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:34,741 INFO L225 Difference]: With dead ends: 1041 [2025-03-08 05:34:34,741 INFO L226 Difference]: Without dead ends: 532 [2025-03-08 05:34:34,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:34,743 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 2 mSDsluCounter, 2035 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2717 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-03-08 05:34:34,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2717 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-08 05:34:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-08 05:34:34,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 411 states have (on average 1.5523114355231145) internal successors, (638), 417 states have internal predecessors, (638), 89 states have call successors, (89), 29 states have call predecessors, (89), 31 states have return successors, (94), 87 states have call predecessors, (94), 88 states have call successors, (94) [2025-03-08 05:34:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 821 transitions. [2025-03-08 05:34:34,761 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 821 transitions. Word has length 126 [2025-03-08 05:34:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:34,761 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 821 transitions. [2025-03-08 05:34:34,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:34:34,762 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 821 transitions. [2025-03-08 05:34:34,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:34:34,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:34,764 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:34,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:34:34,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:34,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1300921107, now seen corresponding path program 1 times [2025-03-08 05:34:34,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:34,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024044215] [2025-03-08 05:34:34,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:34,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:34,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:34:34,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:34:34,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:34,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:34:34,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024044215] [2025-03-08 05:34:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024044215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:34,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:34,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:34:34,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668175080] [2025-03-08 05:34:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:34,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:34:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:34,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:34:34,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:34,911 INFO L87 Difference]: Start difference. First operand 532 states and 821 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:34:34,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:34,950 INFO L93 Difference]: Finished difference Result 1043 states and 1615 transitions. [2025-03-08 05:34:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:34:34,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2025-03-08 05:34:34,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:34,954 INFO L225 Difference]: With dead ends: 1043 [2025-03-08 05:34:34,954 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:34:34,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:34:34,956 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 1 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2720 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-03-08 05:34:34,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2720 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:34,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:34:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-03-08 05:34:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 412 states have (on average 1.5509708737864079) internal successors, (639), 419 states have internal predecessors, (639), 89 states have call successors, (89), 29 states have call predecessors, (89), 32 states have return successors, (96), 87 states have call predecessors, (96), 88 states have call successors, (96) [2025-03-08 05:34:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 824 transitions. [2025-03-08 05:34:34,973 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 824 transitions. Word has length 146 [2025-03-08 05:34:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:34,973 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 824 transitions. [2025-03-08 05:34:34,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:34:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 824 transitions. [2025-03-08 05:34:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:34:34,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:34,976 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] [2025-03-08 05:34:34,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:34:34,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:34,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:34,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2079866109, now seen corresponding path program 1 times [2025-03-08 05:34:34,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:34,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664205465] [2025-03-08 05:34:34,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:34,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:34,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:34:34,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:34:34,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:34,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:34:35,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:35,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664205465] [2025-03-08 05:34:35,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664205465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:35,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:35,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:35,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112499468] [2025-03-08 05:34:35,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:35,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:35,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:35,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:35,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:35,122 INFO L87 Difference]: Start difference. First operand 534 states and 824 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:34:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:35,233 INFO L93 Difference]: Finished difference Result 1045 states and 1614 transitions. [2025-03-08 05:34:35,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:34:35,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2025-03-08 05:34:35,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:35,238 INFO L225 Difference]: With dead ends: 1045 [2025-03-08 05:34:35,238 INFO L226 Difference]: Without dead ends: 536 [2025-03-08 05:34:35,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:34:35,241 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 7 mSDsluCounter, 4009 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4682 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:35,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4682 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:34:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-08 05:34:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-03-08 05:34:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 414 states have (on average 1.5483091787439613) internal successors, (641), 420 states have internal predecessors, (641), 89 states have call successors, (89), 30 states have call predecessors, (89), 32 states have return successors, (95), 87 states have call predecessors, (95), 88 states have call successors, (95) [2025-03-08 05:34:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 825 transitions. [2025-03-08 05:34:35,283 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 825 transitions. Word has length 128 [2025-03-08 05:34:35,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:35,283 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 825 transitions. [2025-03-08 05:34:35,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:34:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 825 transitions. [2025-03-08 05:34:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 05:34:35,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:35,286 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:35,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:34:35,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:35,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1206174220, now seen corresponding path program 1 times [2025-03-08 05:34:35,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:35,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224953042] [2025-03-08 05:34:35,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:35,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:35,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:34:35,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:34:35,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:35,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 05:34:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224953042] [2025-03-08 05:34:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224953042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:35,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:35,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:34:35,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123295065] [2025-03-08 05:34:35,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:35,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:34:35,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:35,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:34:35,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:34:35,425 INFO L87 Difference]: Start difference. First operand 536 states and 825 transitions. Second operand has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 05:34:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:35,547 INFO L93 Difference]: Finished difference Result 1048 states and 1621 transitions. [2025-03-08 05:34:35,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:34:35,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 148 [2025-03-08 05:34:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:35,552 INFO L225 Difference]: With dead ends: 1048 [2025-03-08 05:34:35,552 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 05:34:35,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:34:35,553 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 5 mSDsluCounter, 4021 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4696 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:35,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4696 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:34:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 05:34:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-03-08 05:34:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 416 states have (on average 1.5456730769230769) internal successors, (643), 423 states have internal predecessors, (643), 89 states have call successors, (89), 30 states have call predecessors, (89), 33 states have return successors, (100), 87 states have call predecessors, (100), 88 states have call successors, (100) [2025-03-08 05:34:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 832 transitions. [2025-03-08 05:34:35,572 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 832 transitions. Word has length 148 [2025-03-08 05:34:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:35,573 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 832 transitions. [2025-03-08 05:34:35,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 05:34:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 832 transitions. [2025-03-08 05:34:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:34:35,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:35,575 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] [2025-03-08 05:34:35,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:34:35,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:35,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:35,576 INFO L85 PathProgramCache]: Analyzing trace with hash -906388640, now seen corresponding path program 1 times [2025-03-08 05:34:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40293419] [2025-03-08 05:34:35,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:35,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:34:35,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:34:35,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:35,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:34:35,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40293419] [2025-03-08 05:34:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40293419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:34:35,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687373189] [2025-03-08 05:34:35,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:35,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:35,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:34:35,734 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:34:35,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:34:35,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:34:35,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:34:35,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:35,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:35,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:34:35,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:34:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:36,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:34:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:36,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687373189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:34:36,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:34:36,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:34:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164641433] [2025-03-08 05:34:36,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:34:36,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:34:36,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:36,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:34:36,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:34:36,117 INFO L87 Difference]: Start difference. First operand 539 states and 832 transitions. Second operand has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-08 05:34:36,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:36,740 INFO L93 Difference]: Finished difference Result 1505 states and 2426 transitions. [2025-03-08 05:34:36,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:34:36,741 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) Word has length 130 [2025-03-08 05:34:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:36,747 INFO L225 Difference]: With dead ends: 1505 [2025-03-08 05:34:36,747 INFO L226 Difference]: Without dead ends: 997 [2025-03-08 05:34:36,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 257 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-03-08 05:34:36,750 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 1817 mSDsluCounter, 4204 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 4898 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:36,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 4898 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:34:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-03-08 05:34:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 973. [2025-03-08 05:34:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 771 states have (on average 1.608300907911803) internal successors, (1240), 777 states have internal predecessors, (1240), 168 states have call successors, (168), 31 states have call predecessors, (168), 33 states have return successors, (189), 166 states have call predecessors, (189), 167 states have call successors, (189) [2025-03-08 05:34:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1597 transitions. [2025-03-08 05:34:36,793 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1597 transitions. Word has length 130 [2025-03-08 05:34:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:36,794 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1597 transitions. [2025-03-08 05:34:36,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 4 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-08 05:34:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1597 transitions. [2025-03-08 05:34:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:34:36,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:36,799 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] [2025-03-08 05:34:36,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:34:36,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:34:37,000 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:37,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1118198556, now seen corresponding path program 1 times [2025-03-08 05:34:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:37,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102498289] [2025-03-08 05:34:37,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:37,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:34:37,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:34:37,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:37,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:37,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:37,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102498289] [2025-03-08 05:34:37,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102498289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:37,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:37,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:37,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449350978] [2025-03-08 05:34:37,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:37,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:37,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:37,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:37,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:37,065 INFO L87 Difference]: Start difference. First operand 973 states and 1597 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:37,110 INFO L93 Difference]: Finished difference Result 2278 states and 3804 transitions. [2025-03-08 05:34:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:37,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-08 05:34:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:37,120 INFO L225 Difference]: With dead ends: 2278 [2025-03-08 05:34:37,120 INFO L226 Difference]: Without dead ends: 1384 [2025-03-08 05:34:37,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:37,125 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 139 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:37,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:37,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-08 05:34:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1376. [2025-03-08 05:34:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1095 states have (on average 1.632876712328767) internal successors, (1788), 1101 states have internal predecessors, (1788), 247 states have call successors, (247), 31 states have call predecessors, (247), 33 states have return successors, (278), 245 states have call predecessors, (278), 246 states have call successors, (278) [2025-03-08 05:34:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2313 transitions. [2025-03-08 05:34:37,205 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2313 transitions. Word has length 134 [2025-03-08 05:34:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:37,206 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2313 transitions. [2025-03-08 05:34:37,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2313 transitions. [2025-03-08 05:34:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:34:37,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:37,214 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] [2025-03-08 05:34:37,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:34:37,214 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:37,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1747149280, now seen corresponding path program 1 times [2025-03-08 05:34:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:37,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399272571] [2025-03-08 05:34:37,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:37,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:37,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:34:37,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:34:37,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:37,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:37,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:37,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399272571] [2025-03-08 05:34:37,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399272571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:37,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:37,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:37,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543202921] [2025-03-08 05:34:37,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:37,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:37,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:37,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:37,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:37,277 INFO L87 Difference]: Start difference. First operand 1376 states and 2313 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:37,347 INFO L93 Difference]: Finished difference Result 3289 states and 5573 transitions. [2025-03-08 05:34:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:37,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-08 05:34:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:37,359 INFO L225 Difference]: With dead ends: 3289 [2025-03-08 05:34:37,360 INFO L226 Difference]: Without dead ends: 2041 [2025-03-08 05:34:37,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:37,365 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 137 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:37,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1376 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2025-03-08 05:34:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 2033. [2025-03-08 05:34:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 1633 states have (on average 1.6472749540722595) internal successors, (2690), 1639 states have internal predecessors, (2690), 366 states have call successors, (366), 31 states have call predecessors, (366), 33 states have return successors, (397), 364 states have call predecessors, (397), 365 states have call successors, (397) [2025-03-08 05:34:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 3453 transitions. [2025-03-08 05:34:37,468 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 3453 transitions. Word has length 135 [2025-03-08 05:34:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:37,468 INFO L471 AbstractCegarLoop]: Abstraction has 2033 states and 3453 transitions. [2025-03-08 05:34:37,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 3453 transitions. [2025-03-08 05:34:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:34:37,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:37,479 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] [2025-03-08 05:34:37,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:34:37,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:37,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash 560599579, now seen corresponding path program 1 times [2025-03-08 05:34:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664474003] [2025-03-08 05:34:37,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:37,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:34:37,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:34:37,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:37,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:37,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:37,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664474003] [2025-03-08 05:34:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664474003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968205376] [2025-03-08 05:34:37,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:37,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:37,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:37,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:37,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:37,531 INFO L87 Difference]: Start difference. First operand 2033 states and 3453 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:37,669 INFO L93 Difference]: Finished difference Result 4828 states and 8272 transitions. [2025-03-08 05:34:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:37,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-08 05:34:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:37,687 INFO L225 Difference]: With dead ends: 4828 [2025-03-08 05:34:37,687 INFO L226 Difference]: Without dead ends: 3051 [2025-03-08 05:34:37,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:37,693 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 135 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:37,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1365 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2025-03-08 05:34:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 3043. [2025-03-08 05:34:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 2481 states have (on average 1.6586054010479645) internal successors, (4115), 2487 states have internal predecessors, (4115), 528 states have call successors, (528), 31 states have call predecessors, (528), 33 states have return successors, (575), 526 states have call predecessors, (575), 527 states have call successors, (575) [2025-03-08 05:34:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 5218 transitions. [2025-03-08 05:34:37,821 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 5218 transitions. Word has length 136 [2025-03-08 05:34:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:37,822 INFO L471 AbstractCegarLoop]: Abstraction has 3043 states and 5218 transitions. [2025-03-08 05:34:37,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 5218 transitions. [2025-03-08 05:34:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:34:37,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:37,839 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] [2025-03-08 05:34:37,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:34:37,839 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:37,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:37,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1997435711, now seen corresponding path program 1 times [2025-03-08 05:34:37,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:37,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511351387] [2025-03-08 05:34:37,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:37,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:37,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:34:37,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:34:37,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:37,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:37,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:37,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511351387] [2025-03-08 05:34:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511351387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:37,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:37,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:37,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771132045] [2025-03-08 05:34:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:37,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:37,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:37,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:37,898 INFO L87 Difference]: Start difference. First operand 3043 states and 5218 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:38,022 INFO L93 Difference]: Finished difference Result 7265 states and 12553 transitions. [2025-03-08 05:34:38,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:38,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-08 05:34:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:38,051 INFO L225 Difference]: With dead ends: 7265 [2025-03-08 05:34:38,051 INFO L226 Difference]: Without dead ends: 4686 [2025-03-08 05:34:38,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:38,065 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 133 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:38,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1365 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:38,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4686 states. [2025-03-08 05:34:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4686 to 4678. [2025-03-08 05:34:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4678 states, 3871 states have (on average 1.666752777060191) internal successors, (6452), 3877 states have internal predecessors, (6452), 773 states have call successors, (773), 31 states have call predecessors, (773), 33 states have return successors, (846), 771 states have call predecessors, (846), 772 states have call successors, (846) [2025-03-08 05:34:38,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4678 states to 4678 states and 8071 transitions. [2025-03-08 05:34:38,312 INFO L78 Accepts]: Start accepts. Automaton has 4678 states and 8071 transitions. Word has length 137 [2025-03-08 05:34:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:38,312 INFO L471 AbstractCegarLoop]: Abstraction has 4678 states and 8071 transitions. [2025-03-08 05:34:38,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4678 states and 8071 transitions. [2025-03-08 05:34:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:34:38,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:38,334 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] [2025-03-08 05:34:38,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:34:38,334 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:38,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2008903110, now seen corresponding path program 1 times [2025-03-08 05:34:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:38,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943533365] [2025-03-08 05:34:38,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:38,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:34:38,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:34:38,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:38,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:38,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:38,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943533365] [2025-03-08 05:34:38,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943533365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:38,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:38,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858131913] [2025-03-08 05:34:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:38,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:38,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:38,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:38,389 INFO L87 Difference]: Start difference. First operand 4678 states and 8071 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:38,599 INFO L93 Difference]: Finished difference Result 11333 states and 19697 transitions. [2025-03-08 05:34:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:38,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-03-08 05:34:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:38,640 INFO L225 Difference]: With dead ends: 11333 [2025-03-08 05:34:38,641 INFO L226 Difference]: Without dead ends: 7435 [2025-03-08 05:34:38,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:38,661 INFO L435 NwaCegarLoop]: 692 mSDtfsCounter, 131 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:38,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1367 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2025-03-08 05:34:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7427. [2025-03-08 05:34:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 6127 states have (on average 1.667537130732822) internal successors, (10217), 6133 states have internal predecessors, (10217), 1266 states have call successors, (1266), 31 states have call predecessors, (1266), 33 states have return successors, (1383), 1264 states have call predecessors, (1383), 1265 states have call successors, (1383) [2025-03-08 05:34:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 12866 transitions. [2025-03-08 05:34:39,044 INFO L78 Accepts]: Start accepts. Automaton has 7427 states and 12866 transitions. Word has length 138 [2025-03-08 05:34:39,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:39,044 INFO L471 AbstractCegarLoop]: Abstraction has 7427 states and 12866 transitions. [2025-03-08 05:34:39,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 7427 states and 12866 transitions. [2025-03-08 05:34:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:34:39,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:39,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:39,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:34:39,073 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:39,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash 818533943, now seen corresponding path program 1 times [2025-03-08 05:34:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:39,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896118761] [2025-03-08 05:34:39,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:39,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:34:39,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:34:39,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:39,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:39,125 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 05:34:39,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:39,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896118761] [2025-03-08 05:34:39,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896118761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:39,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:39,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:39,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957847273] [2025-03-08 05:34:39,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:39,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:39,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:39,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:39,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:39,127 INFO L87 Difference]: Start difference. First operand 7427 states and 12866 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:34:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:39,408 INFO L93 Difference]: Finished difference Result 18710 states and 32624 transitions. [2025-03-08 05:34:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:39,409 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2025-03-08 05:34:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:39,468 INFO L225 Difference]: With dead ends: 18710 [2025-03-08 05:34:39,468 INFO L226 Difference]: Without dead ends: 12443 [2025-03-08 05:34:39,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:39,495 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 129 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:39,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1368 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12443 states. [2025-03-08 05:34:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12443 to 12435. [2025-03-08 05:34:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12435 states, 10313 states have (on average 1.6691554348880053) internal successors, (17214), 10319 states have internal predecessors, (17214), 2088 states have call successors, (2088), 31 states have call predecessors, (2088), 33 states have return successors, (2283), 2086 states have call predecessors, (2283), 2087 states have call successors, (2283) [2025-03-08 05:34:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12435 states to 12435 states and 21585 transitions. [2025-03-08 05:34:40,020 INFO L78 Accepts]: Start accepts. Automaton has 12435 states and 21585 transitions. Word has length 158 [2025-03-08 05:34:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:40,022 INFO L471 AbstractCegarLoop]: Abstraction has 12435 states and 21585 transitions. [2025-03-08 05:34:40,022 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:34:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 12435 states and 21585 transitions. [2025-03-08 05:34:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:34:40,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:40,062 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] [2025-03-08 05:34:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:34:40,062 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:40,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2096079751, now seen corresponding path program 1 times [2025-03-08 05:34:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184560061] [2025-03-08 05:34:40,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:40,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:34:40,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:34:40,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:40,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:40,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184560061] [2025-03-08 05:34:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184560061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946346842] [2025-03-08 05:34:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:40,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:40,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:40,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:40,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:40,117 INFO L87 Difference]: Start difference. First operand 12435 states and 21585 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:40,607 INFO L93 Difference]: Finished difference Result 29753 states and 51603 transitions. [2025-03-08 05:34:40,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:40,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-03-08 05:34:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:40,674 INFO L225 Difference]: With dead ends: 29753 [2025-03-08 05:34:40,674 INFO L226 Difference]: Without dead ends: 19453 [2025-03-08 05:34:40,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:40,707 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 127 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:40,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1340 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19453 states. [2025-03-08 05:34:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19453 to 19445. [2025-03-08 05:34:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19445 states, 16120 states have (on average 1.6474565756823822) internal successors, (26557), 16126 states have internal predecessors, (26557), 3291 states have call successors, (3291), 31 states have call predecessors, (3291), 33 states have return successors, (3630), 3289 states have call predecessors, (3630), 3290 states have call successors, (3630) [2025-03-08 05:34:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19445 states to 19445 states and 33478 transitions. [2025-03-08 05:34:41,647 INFO L78 Accepts]: Start accepts. Automaton has 19445 states and 33478 transitions. Word has length 140 [2025-03-08 05:34:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:41,647 INFO L471 AbstractCegarLoop]: Abstraction has 19445 states and 33478 transitions. [2025-03-08 05:34:41,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 19445 states and 33478 transitions. [2025-03-08 05:34:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 05:34:41,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:41,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:41,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:34:41,684 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:41,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:41,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1057671286, now seen corresponding path program 1 times [2025-03-08 05:34:41,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:41,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950395659] [2025-03-08 05:34:41,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:41,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:41,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:34:41,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:34:41,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:41,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 05:34:41,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:41,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950395659] [2025-03-08 05:34:41,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950395659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:41,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:41,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914657580] [2025-03-08 05:34:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:41,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:41,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:41,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:41,822 INFO L87 Difference]: Start difference. First operand 19445 states and 33478 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:34:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:42,458 INFO L93 Difference]: Finished difference Result 51360 states and 88762 transitions. [2025-03-08 05:34:42,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:42,459 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-03-08 05:34:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:42,599 INFO L225 Difference]: With dead ends: 51360 [2025-03-08 05:34:42,599 INFO L226 Difference]: Without dead ends: 34690 [2025-03-08 05:34:42,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:42,635 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 125 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:42,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1368 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34690 states. [2025-03-08 05:34:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34690 to 34682. [2025-03-08 05:34:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34682 states, 28907 states have (on average 1.6449302937004877) internal successors, (47550), 28913 states have internal predecessors, (47550), 5741 states have call successors, (5741), 31 states have call predecessors, (5741), 33 states have return successors, (6354), 5739 states have call predecessors, (6354), 5740 states have call successors, (6354) [2025-03-08 05:34:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34682 states to 34682 states and 59645 transitions. [2025-03-08 05:34:43,721 INFO L78 Accepts]: Start accepts. Automaton has 34682 states and 59645 transitions. Word has length 160 [2025-03-08 05:34:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:43,722 INFO L471 AbstractCegarLoop]: Abstraction has 34682 states and 59645 transitions. [2025-03-08 05:34:43,722 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:34:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 34682 states and 59645 transitions. [2025-03-08 05:34:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 05:34:43,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:43,768 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] [2025-03-08 05:34:43,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:34:43,769 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:43,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:43,770 INFO L85 PathProgramCache]: Analyzing trace with hash 462231000, now seen corresponding path program 1 times [2025-03-08 05:34:43,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:43,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836190876] [2025-03-08 05:34:43,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:43,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:43,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 05:34:43,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 05:34:43,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:43,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:43,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:43,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836190876] [2025-03-08 05:34:43,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836190876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:43,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:43,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:43,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803061110] [2025-03-08 05:34:43,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:43,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:43,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:43,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:43,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:43,831 INFO L87 Difference]: Start difference. First operand 34682 states and 59645 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:45,386 INFO L93 Difference]: Finished difference Result 94592 states and 163174 transitions. [2025-03-08 05:34:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:45,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-03-08 05:34:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:45,662 INFO L225 Difference]: With dead ends: 94592 [2025-03-08 05:34:45,662 INFO L226 Difference]: Without dead ends: 63595 [2025-03-08 05:34:45,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:45,777 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 123 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:34:45,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1378 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63595 states. [2025-03-08 05:34:47,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63595 to 63587. [2025-03-08 05:34:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63587 states, 53299 states have (on average 1.6411377324152423) internal successors, (87471), 53305 states have internal predecessors, (87471), 10254 states have call successors, (10254), 31 states have call predecessors, (10254), 33 states have return successors, (11399), 10252 states have call predecessors, (11399), 10253 states have call successors, (11399) [2025-03-08 05:34:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63587 states to 63587 states and 109124 transitions. [2025-03-08 05:34:48,117 INFO L78 Accepts]: Start accepts. Automaton has 63587 states and 109124 transitions. Word has length 142 [2025-03-08 05:34:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:48,117 INFO L471 AbstractCegarLoop]: Abstraction has 63587 states and 109124 transitions. [2025-03-08 05:34:48,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 05:34:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 63587 states and 109124 transitions. [2025-03-08 05:34:48,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 05:34:48,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:48,173 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:34:48,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:34:48,174 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:48,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:48,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1270792683, now seen corresponding path program 1 times [2025-03-08 05:34:48,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:48,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589096286] [2025-03-08 05:34:48,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:48,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:48,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 05:34:48,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 05:34:48,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:48,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 05:34:48,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:48,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589096286] [2025-03-08 05:34:48,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589096286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:48,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:48,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:34:48,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189096036] [2025-03-08 05:34:48,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:48,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:34:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:48,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:34:48,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:48,241 INFO L87 Difference]: Start difference. First operand 63587 states and 109124 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:34:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:34:50,693 INFO L93 Difference]: Finished difference Result 119224 states and 205009 transitions. [2025-03-08 05:34:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:34:50,694 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2025-03-08 05:34:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:34:51,284 INFO L225 Difference]: With dead ends: 119224 [2025-03-08 05:34:51,284 INFO L226 Difference]: Without dead ends: 118962 [2025-03-08 05:34:51,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:34:51,361 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 118 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1374 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-03-08 05:34:51,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1374 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:34:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118962 states. [2025-03-08 05:34:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118962 to 118954. [2025-03-08 05:34:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118954 states, 100298 states have (on average 1.636144290015753) internal successors, (164102), 100304 states have internal predecessors, (164102), 18622 states have call successors, (18622), 31 states have call predecessors, (18622), 33 states have return successors, (20813), 18620 states have call predecessors, (20813), 18621 states have call successors, (20813) [2025-03-08 05:34:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118954 states to 118954 states and 203537 transitions. [2025-03-08 05:34:55,509 INFO L78 Accepts]: Start accepts. Automaton has 118954 states and 203537 transitions. Word has length 162 [2025-03-08 05:34:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:34:55,510 INFO L471 AbstractCegarLoop]: Abstraction has 118954 states and 203537 transitions. [2025-03-08 05:34:55,510 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 05:34:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 118954 states and 203537 transitions. [2025-03-08 05:34:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 05:34:55,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:34:55,590 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] [2025-03-08 05:34:55,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:34:55,590 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:34:55,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:34:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2027208969, now seen corresponding path program 1 times [2025-03-08 05:34:55,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:34:55,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326641156] [2025-03-08 05:34:55,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:34:55,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:34:55,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:34:55,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:34:55,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:34:55,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:34:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:34:56,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:34:56,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326641156] [2025-03-08 05:34:56,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326641156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:34:56,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:34:56,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 05:34:56,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646975060] [2025-03-08 05:34:56,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:34:56,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:34:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:34:56,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:34:56,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:34:56,458 INFO L87 Difference]: Start difference. First operand 118954 states and 203537 transitions. Second operand has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-08 05:35:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:35:02,141 INFO L93 Difference]: Finished difference Result 237307 states and 411455 transitions. [2025-03-08 05:35:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 05:35:02,142 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 144 [2025-03-08 05:35:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:35:03,226 INFO L225 Difference]: With dead ends: 237307 [2025-03-08 05:35:03,226 INFO L226 Difference]: Without dead ends: 237053 [2025-03-08 05:35:03,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:35:03,328 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 2082 mSDsluCounter, 8481 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 9294 SdHoareTripleChecker+Invalid, 2650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:35:03,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 9294 Invalid, 2650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 05:35:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237053 states. [2025-03-08 05:35:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237053 to 236979. [2025-03-08 05:35:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236979 states, 199848 states have (on average 1.636533765661903) internal successors, (327058), 199756 states have internal predecessors, (327058), 37044 states have call successors, (37044), 79 states have call predecessors, (37044), 86 states have return successors, (44718), 37151 states have call predecessors, (44718), 37041 states have call successors, (44718) [2025-03-08 05:35:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236979 states to 236979 states and 408820 transitions. [2025-03-08 05:35:11,863 INFO L78 Accepts]: Start accepts. Automaton has 236979 states and 408820 transitions. Word has length 144 [2025-03-08 05:35:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:35:11,864 INFO L471 AbstractCegarLoop]: Abstraction has 236979 states and 408820 transitions. [2025-03-08 05:35:11,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 6 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2025-03-08 05:35:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 236979 states and 408820 transitions. [2025-03-08 05:35:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 05:35:11,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:35:11,993 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:35:11,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:35:11,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:35:11,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:35:11,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1531652478, now seen corresponding path program 1 times [2025-03-08 05:35:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:35:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885220867] [2025-03-08 05:35:11,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:35:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:35:12,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 05:35:12,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 05:35:12,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:35:12,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:35:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 05:35:12,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:35:12,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885220867] [2025-03-08 05:35:12,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885220867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:35:12,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:35:12,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:35:12,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472630412] [2025-03-08 05:35:12,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:35:12,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:35:12,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:35:12,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:35:12,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:35:12,106 INFO L87 Difference]: Start difference. First operand 236979 states and 408820 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18)