./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product32.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 6b54f48e5606af61de5b12570bc2e15a173e4036917e2e3bdec28cef1386724b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:22:37,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:22:37,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:22:37,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:22:37,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:22:37,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:22:37,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:22:37,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:22:37,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:22:37,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:22:37,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:22:37,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:22:37,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:22:37,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:22:37,967 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:22:37,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:22:37,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:22:37,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:37,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:22:37,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:22:37,969 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 -> 6b54f48e5606af61de5b12570bc2e15a173e4036917e2e3bdec28cef1386724b [2025-03-03 14:22:38,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:22:38,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:22:38,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:22:38,226 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:22:38,226 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:22:38,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product32.cil.c [2025-03-03 14:22:39,393 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04538d27a/ed60d6548492485fb95a14ac7d407aa4/FLAG928db5472 [2025-03-03 14:22:39,691 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:22:39,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product32.cil.c [2025-03-03 14:22:39,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04538d27a/ed60d6548492485fb95a14ac7d407aa4/FLAG928db5472 [2025-03-03 14:22:39,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04538d27a/ed60d6548492485fb95a14ac7d407aa4 [2025-03-03 14:22:39,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:22:39,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:22:39,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:39,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:22:39,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:22:39,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:39" (1/1) ... [2025-03-03 14:22:39,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640ef0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:39, skipping insertion in model container [2025-03-03 14:22:39,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:39" (1/1) ... [2025-03-03 14:22:40,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:22:40,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product32.cil.c[27975,27988] [2025-03-03 14:22:40,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:40,436 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:22:40,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-03-03 14:22:40,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [1128] [2025-03-03 14:22:40,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1174] [2025-03-03 14:22:40,444 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1183] [2025-03-03 14:22:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1201] [2025-03-03 14:22:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1567] [2025-03-03 14:22:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1875] [2025-03-03 14:22:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2287] [2025-03-03 14:22:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2685] [2025-03-03 14:22:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2720] [2025-03-03 14:22:40,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2856] [2025-03-03 14:22:40,491 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product32.cil.c[27975,27988] [2025-03-03 14:22:40,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:40,565 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:22:40,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40 WrapperNode [2025-03-03 14:22:40,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:40,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:40,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:22:40,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:22:40,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,622 INFO L138 Inliner]: procedures = 134, calls = 220, calls flagged for inlining = 60, calls inlined = 53, statements flattened = 989 [2025-03-03 14:22:40,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:40,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:22:40,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:22:40,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:22:40,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,637 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,658 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:22:40,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:22:40,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:22:40,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:22:40,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:22:40,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (1/1) ... [2025-03-03 14:22:40,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:40,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:40,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:22:40,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:22:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:22:40,751 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:22:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:22:40,752 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:22:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:22:40,752 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:22:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:22:40,752 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:22:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:22:40,753 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:22:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:22:40,753 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:22:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:22:40,754 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:22:40,754 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:22:40,754 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:22:40,754 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:22:40,755 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:22:40,755 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:22:40,756 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:22:40,756 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:22:40,756 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:22:40,756 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:22:40,756 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:22:40,756 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:22:40,757 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:22:40,757 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:22:40,757 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:22:40,757 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:22:40,757 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:22:40,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:22:40,758 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:22:40,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:22:40,758 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:22:40,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:22:40,758 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:22:40,758 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:22:40,758 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:22:40,758 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:22:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:22:40,759 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:22:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:22:40,759 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:22:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-03 14:22:40,759 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-03 14:22:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:22:40,759 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:22:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:22:40,759 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:22:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:22:40,759 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:22:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:22:40,759 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:22:40,759 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:22:40,759 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:22:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:22:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:22:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:22:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:22:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:22:40,760 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:22:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:22:40,760 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:22:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:22:40,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:22:40,911 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:22:40,913 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:22:40,988 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2592: #res := ~retValue_acc~35; [2025-03-03 14:22:40,999 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2666: #res := ~retValue_acc~37; [2025-03-03 14:22:41,007 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2183: #res := ~retValue_acc~26; [2025-03-03 14:22:41,039 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: #res#1 := ~retValue_acc~11#1; [2025-03-03 14:22:41,039 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~10#1; [2025-03-03 14:22:41,061 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: #res := ~retValue_acc~14; [2025-03-03 14:22:41,068 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: #res := ~retValue_acc~9; [2025-03-03 14:22:41,078 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2853-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2025-03-03 14:22:41,087 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: #res := ~retValue_acc~3; [2025-03-03 14:22:41,100 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2518: #res := ~retValue_acc~33; [2025-03-03 14:22:41,127 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555: #res := ~retValue_acc~34; [2025-03-03 14:22:41,132 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2629: #res := ~retValue_acc~36; [2025-03-03 14:22:41,157 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2403: #res := ~retValue_acc~30; [2025-03-03 14:22:41,209 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: #res := ~retValue_acc~7; [2025-03-03 14:22:41,333 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L623-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~8#1; [2025-03-03 14:22:41,334 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1105-1: getClientId_#res#1 := getClientId_~retValue_acc~16#1; [2025-03-03 14:22:41,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~13#1; [2025-03-03 14:22:41,547 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2717-1: valid_product_#res#1 := valid_product_~retValue_acc~39#1; [2025-03-03 14:22:41,547 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2140-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~23#1; [2025-03-03 14:22:41,547 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2158-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~25#1; [2025-03-03 14:22:41,547 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~12#1; [2025-03-03 14:22:41,547 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2149-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~24#1; [2025-03-03 14:22:41,552 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2366: #res := ~retValue_acc~29; [2025-03-03 14:22:41,558 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2829: #res#1 := ~retValue_acc~41#1; [2025-03-03 14:22:41,558 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2809-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~40#1; [2025-03-03 14:22:41,693 INFO L? ?]: Removed 544 outVars from TransFormulas that were not future-live. [2025-03-03 14:22:41,694 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:22:41,712 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:22:41,713 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:22:41,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:41 BoogieIcfgContainer [2025-03-03 14:22:41,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:22:41,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:22:41,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:22:41,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:22:41,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:22:39" (1/3) ... [2025-03-03 14:22:41,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774989fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:41, skipping insertion in model container [2025-03-03 14:22:41,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:40" (2/3) ... [2025-03-03 14:22:41,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774989fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:41, skipping insertion in model container [2025-03-03 14:22:41,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:41" (3/3) ... [2025-03-03 14:22:41,722 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product32.cil.c [2025-03-03 14:22:41,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:22:41,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product32.cil.c that has 30 procedures, 431 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:22:41,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:22:41,799 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;@1086f657, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:22:41,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:22:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 431 states, 334 states have (on average 1.5479041916167664) internal successors, (517), 339 states have internal predecessors, (517), 66 states have call successors, (66), 29 states have call predecessors, (66), 29 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 14:22:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:22:41,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:41,821 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2025-03-03 14:22:41,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:41,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash -700520914, now seen corresponding path program 1 times [2025-03-03 14:22:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:41,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497976712] [2025-03-03 14:22:41,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:41,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:41,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:22:42,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:22:42,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:42,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:22:42,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:42,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497976712] [2025-03-03 14:22:42,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497976712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587506735] [2025-03-03 14:22:42,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:42,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:42,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:42,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:42,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:22:42,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:22:42,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:22:42,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:42,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:42,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:22:42,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:42,985 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:22:42,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:42,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587506735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:42,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:42,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:22:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139636353] [2025-03-03 14:22:42,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:42,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:22:42,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:43,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:22:43,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:43,013 INFO L87 Difference]: Start difference. First operand has 431 states, 334 states have (on average 1.5479041916167664) internal successors, (517), 339 states have internal predecessors, (517), 66 states have call successors, (66), 29 states have call predecessors, (66), 29 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:43,069 INFO L93 Difference]: Finished difference Result 670 states and 990 transitions. [2025-03-03 14:22:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:22:43,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2025-03-03 14:22:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:43,086 INFO L225 Difference]: With dead ends: 670 [2025-03-03 14:22:43,086 INFO L226 Difference]: Without dead ends: 424 [2025-03-03 14:22:43,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:43,095 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:43,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:43,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-03 14:22:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2025-03-03 14:22:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 328 states have (on average 1.545731707317073) internal successors, (507), 332 states have internal predecessors, (507), 66 states have call successors, (66), 29 states have call predecessors, (66), 29 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-03 14:22:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 638 transitions. [2025-03-03 14:22:43,152 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 638 transitions. Word has length 151 [2025-03-03 14:22:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:43,156 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 638 transitions. [2025-03-03 14:22:43,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.5) internal successors, (83), 2 states have internal predecessors, (83), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 638 transitions. [2025-03-03 14:22:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 14:22:43,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:43,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:43,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:22:43,361 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-03 14:22:43,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:43,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash 864291797, now seen corresponding path program 1 times [2025-03-03 14:22:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:43,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860546324] [2025-03-03 14:22:43,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:43,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:22:43,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:22:43,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:43,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 14:22:43,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:43,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860546324] [2025-03-03 14:22:43,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860546324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252488034] [2025-03-03 14:22:43,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:43,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:43,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:43,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:43,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:22:43,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:22:43,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:22:43,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:43,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:43,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:22:44,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:22:44,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:44,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252488034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:44,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:44,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:44,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834249316] [2025-03-03 14:22:44,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:44,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:44,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:44,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:44,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:44,040 INFO L87 Difference]: Start difference. First operand 424 states and 638 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:44,084 INFO L93 Difference]: Finished difference Result 659 states and 968 transitions. [2025-03-03 14:22:44,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:44,085 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2025-03-03 14:22:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:44,088 INFO L225 Difference]: With dead ends: 659 [2025-03-03 14:22:44,090 INFO L226 Difference]: Without dead ends: 426 [2025-03-03 14:22:44,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 171 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-03 14:22:44,091 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 0 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:44,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1272 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-03 14:22:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-03-03 14:22:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 330 states have (on average 1.5424242424242425) internal successors, (509), 334 states have internal predecessors, (509), 66 states have call successors, (66), 29 states have call predecessors, (66), 29 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-03 14:22:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 640 transitions. [2025-03-03 14:22:44,122 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 640 transitions. Word has length 171 [2025-03-03 14:22:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:44,122 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 640 transitions. [2025-03-03 14:22:44,122 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 640 transitions. [2025-03-03 14:22:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 14:22:44,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:44,127 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:44,136 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-03 14:22:44,328 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-03 14:22:44,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:44,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:44,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1967479928, now seen corresponding path program 1 times [2025-03-03 14:22:44,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:44,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759157231] [2025-03-03 14:22:44,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:44,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:44,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:22:44,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:22:44,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:44,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:22:44,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759157231] [2025-03-03 14:22:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759157231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147307045] [2025-03-03 14:22:44,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:44,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:44,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:44,574 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:44,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:22:44,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:22:44,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:22:44,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:44,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:44,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:44,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 14:22:44,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:44,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147307045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:44,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:44,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:44,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784549952] [2025-03-03 14:22:44,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:44,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:44,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:44,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:44,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:44,891 INFO L87 Difference]: Start difference. First operand 426 states and 640 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:44,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:44,937 INFO L93 Difference]: Finished difference Result 899 states and 1371 transitions. [2025-03-03 14:22:44,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:44,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-03-03 14:22:44,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:44,942 INFO L225 Difference]: With dead ends: 899 [2025-03-03 14:22:44,943 INFO L226 Difference]: Without dead ends: 500 [2025-03-03 14:22:44,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 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-03 14:22:44,946 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 134 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:44,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1239 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-03 14:22:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 492. [2025-03-03 14:22:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 382 states have (on average 1.5628272251308901) internal successors, (597), 386 states have internal predecessors, (597), 80 states have call successors, (80), 29 states have call predecessors, (80), 29 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-03 14:22:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 756 transitions. [2025-03-03 14:22:44,980 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 756 transitions. Word has length 160 [2025-03-03 14:22:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:44,980 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 756 transitions. [2025-03-03 14:22:44,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 756 transitions. [2025-03-03 14:22:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 14:22:44,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:44,983 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:44,992 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-03 14:22:45,184 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-03 14:22:45,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:45,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1190245350, now seen corresponding path program 1 times [2025-03-03 14:22:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:45,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695868335] [2025-03-03 14:22:45,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:45,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:45,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:22:45,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:22:45,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:45,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:22:45,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695868335] [2025-03-03 14:22:45,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695868335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:45,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737265512] [2025-03-03 14:22:45,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:45,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:45,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:45,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:45,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:22:45,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 14:22:45,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 14:22:45,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:45,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:45,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:22:45,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:45,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:45,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737265512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:45,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:45,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:45,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447468878] [2025-03-03 14:22:45,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:45,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:45,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:45,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:45,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:45,716 INFO L87 Difference]: Start difference. First operand 492 states and 756 transitions. Second operand has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:22:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:45,779 INFO L93 Difference]: Finished difference Result 975 states and 1502 transitions. [2025-03-03 14:22:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:45,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 161 [2025-03-03 14:22:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:45,783 INFO L225 Difference]: With dead ends: 975 [2025-03-03 14:22:45,784 INFO L226 Difference]: Without dead ends: 494 [2025-03-03 14:22:45,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 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-03 14:22:45,787 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 2 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2509 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-03 14:22:45,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2509 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-03 14:22:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2025-03-03 14:22:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 383 states have (on average 1.5613577023498695) internal successors, (598), 388 states have internal predecessors, (598), 80 states have call successors, (80), 29 states have call predecessors, (80), 30 states have return successors, (81), 78 states have call predecessors, (81), 79 states have call successors, (81) [2025-03-03 14:22:45,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 759 transitions. [2025-03-03 14:22:45,803 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 759 transitions. Word has length 161 [2025-03-03 14:22:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:45,804 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 759 transitions. [2025-03-03 14:22:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.25) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:22:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 759 transitions. [2025-03-03 14:22:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 14:22:45,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:45,806 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:45,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:22:46,007 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-03 14:22:46,007 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:46,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -729313459, now seen corresponding path program 1 times [2025-03-03 14:22:46,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:46,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112754767] [2025-03-03 14:22:46,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:46,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:46,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 14:22:46,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 14:22:46,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:46,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:46,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112754767] [2025-03-03 14:22:46,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112754767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827478142] [2025-03-03 14:22:46,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:46,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:46,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:46,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:46,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:22:46,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 14:22:46,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 14:22:46,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:46,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:46,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1375 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:46,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:22:46,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:46,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827478142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:46,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:46,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:22:46,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407793571] [2025-03-03 14:22:46,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:46,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:46,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:46,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:46,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:46,510 INFO L87 Difference]: Start difference. First operand 494 states and 759 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:46,590 INFO L93 Difference]: Finished difference Result 977 states and 1507 transitions. [2025-03-03 14:22:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:46,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 181 [2025-03-03 14:22:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:46,593 INFO L225 Difference]: With dead ends: 977 [2025-03-03 14:22:46,595 INFO L226 Difference]: Without dead ends: 496 [2025-03-03 14:22:46,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 179 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-03 14:22:46,597 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 2 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2495 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-03 14:22:46,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2495 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-03 14:22:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-03 14:22:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 384 states have (on average 1.5598958333333333) internal successors, (599), 390 states have internal predecessors, (599), 80 states have call successors, (80), 29 states have call predecessors, (80), 31 states have return successors, (86), 78 states have call predecessors, (86), 79 states have call successors, (86) [2025-03-03 14:22:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 765 transitions. [2025-03-03 14:22:46,616 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 765 transitions. Word has length 181 [2025-03-03 14:22:46,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:46,616 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 765 transitions. [2025-03-03 14:22:46,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 765 transitions. [2025-03-03 14:22:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 14:22:46,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:46,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:46,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:46,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:46,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:46,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:46,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1215027463, now seen corresponding path program 1 times [2025-03-03 14:22:46,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:46,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250629737] [2025-03-03 14:22:46,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:46,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:46,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:22:46,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:22:46,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:46,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:22:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250629737] [2025-03-03 14:22:46,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250629737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:46,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:46,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:46,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307458840] [2025-03-03 14:22:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:46,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:46,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:46,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:46,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:46,958 INFO L87 Difference]: Start difference. First operand 496 states and 765 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:22:47,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:47,000 INFO L93 Difference]: Finished difference Result 969 states and 1498 transitions. [2025-03-03 14:22:47,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:47,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 163 [2025-03-03 14:22:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:47,004 INFO L225 Difference]: With dead ends: 969 [2025-03-03 14:22:47,005 INFO L226 Difference]: Without dead ends: 496 [2025-03-03 14:22:47,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:47,007 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 2 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2513 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-03 14:22:47,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2513 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-03 14:22:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-03 14:22:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 384 states have (on average 1.5598958333333333) internal successors, (599), 390 states have internal predecessors, (599), 80 states have call successors, (80), 29 states have call predecessors, (80), 31 states have return successors, (85), 78 states have call predecessors, (85), 79 states have call successors, (85) [2025-03-03 14:22:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 764 transitions. [2025-03-03 14:22:47,027 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 764 transitions. Word has length 163 [2025-03-03 14:22:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:47,027 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 764 transitions. [2025-03-03 14:22:47,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:22:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 764 transitions. [2025-03-03 14:22:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 14:22:47,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:47,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:47,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:22:47,030 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:47,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash -629474312, now seen corresponding path program 1 times [2025-03-03 14:22:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513978404] [2025-03-03 14:22:47,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:47,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:47,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-03 14:22:47,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 14:22:47,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:47,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:47,161 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 14:22:47,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:47,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513978404] [2025-03-03 14:22:47,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513978404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:47,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:47,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:47,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053431430] [2025-03-03 14:22:47,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:47,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:47,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:47,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:47,163 INFO L87 Difference]: Start difference. First operand 496 states and 764 transitions. Second operand has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:47,229 INFO L93 Difference]: Finished difference Result 971 states and 1501 transitions. [2025-03-03 14:22:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:47,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 183 [2025-03-03 14:22:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:47,234 INFO L225 Difference]: With dead ends: 971 [2025-03-03 14:22:47,234 INFO L226 Difference]: Without dead ends: 498 [2025-03-03 14:22:47,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:47,235 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 1 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2516 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-03 14:22:47,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2516 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-03 14:22:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-03-03 14:22:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 385 states have (on average 1.5584415584415585) internal successors, (600), 392 states have internal predecessors, (600), 80 states have call successors, (80), 29 states have call predecessors, (80), 32 states have return successors, (87), 78 states have call predecessors, (87), 79 states have call successors, (87) [2025-03-03 14:22:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 767 transitions. [2025-03-03 14:22:47,251 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 767 transitions. Word has length 183 [2025-03-03 14:22:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:47,251 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 767 transitions. [2025-03-03 14:22:47,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.75) internal successors, (107), 5 states have internal predecessors, (107), 3 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 14:22:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 767 transitions. [2025-03-03 14:22:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 14:22:47,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:47,254 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:47,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:22:47,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:47,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:47,255 INFO L85 PathProgramCache]: Analyzing trace with hash 149733471, now seen corresponding path program 1 times [2025-03-03 14:22:47,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:47,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757871301] [2025-03-03 14:22:47,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:47,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:47,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 14:22:47,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 14:22:47,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:47,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757871301] [2025-03-03 14:22:47,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757871301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:47,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:47,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:47,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853479068] [2025-03-03 14:22:47,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:47,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:47,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:47,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:47,404 INFO L87 Difference]: Start difference. First operand 498 states and 767 transitions. Second operand has 8 states, 7 states have (on average 15.857142857142858) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:22:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:47,514 INFO L93 Difference]: Finished difference Result 973 states and 1500 transitions. [2025-03-03 14:22:47,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:47,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.857142857142858) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 184 [2025-03-03 14:22:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:47,518 INFO L225 Difference]: With dead ends: 973 [2025-03-03 14:22:47,518 INFO L226 Difference]: Without dead ends: 500 [2025-03-03 14:22:47,519 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-03 14:22:47,520 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 7 mSDsluCounter, 3703 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4325 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-03 14:22:47,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4325 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:47,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-03 14:22:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-03-03 14:22:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 387 states have (on average 1.5555555555555556) internal successors, (602), 393 states have internal predecessors, (602), 80 states have call successors, (80), 30 states have call predecessors, (80), 32 states have return successors, (86), 78 states have call predecessors, (86), 79 states have call successors, (86) [2025-03-03 14:22:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 768 transitions. [2025-03-03 14:22:47,534 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 768 transitions. Word has length 184 [2025-03-03 14:22:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:47,534 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 768 transitions. [2025-03-03 14:22:47,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.857142857142858) internal successors, (111), 8 states have internal predecessors, (111), 4 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-03 14:22:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 768 transitions. [2025-03-03 14:22:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 14:22:47,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:47,537 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:47,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:22:47,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:47,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash 153496631, now seen corresponding path program 1 times [2025-03-03 14:22:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:47,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39411927] [2025-03-03 14:22:47,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:47,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:47,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 14:22:47,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 14:22:47,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:47,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:22:47,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:47,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39411927] [2025-03-03 14:22:47,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39411927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:47,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:47,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:47,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148637060] [2025-03-03 14:22:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:47,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:47,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:47,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:47,673 INFO L87 Difference]: Start difference. First operand 500 states and 768 transitions. Second operand has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 14:22:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:47,816 INFO L93 Difference]: Finished difference Result 976 states and 1507 transitions. [2025-03-03 14:22:47,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:47,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 166 [2025-03-03 14:22:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:47,820 INFO L225 Difference]: With dead ends: 976 [2025-03-03 14:22:47,821 INFO L226 Difference]: Without dead ends: 503 [2025-03-03 14:22:47,823 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-03 14:22:47,823 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 5 mSDsluCounter, 3715 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4339 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-03 14:22:47,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4339 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-03 14:22:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-03-03 14:22:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 389 states have (on average 1.5526992287917738) internal successors, (604), 396 states have internal predecessors, (604), 80 states have call successors, (80), 30 states have call predecessors, (80), 33 states have return successors, (91), 78 states have call predecessors, (91), 79 states have call successors, (91) [2025-03-03 14:22:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 775 transitions. [2025-03-03 14:22:47,844 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 775 transitions. Word has length 166 [2025-03-03 14:22:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:47,844 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 775 transitions. [2025-03-03 14:22:47,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 14:22:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 775 transitions. [2025-03-03 14:22:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 14:22:47,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:47,847 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:47,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:22:47,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:47,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash -114139809, now seen corresponding path program 1 times [2025-03-03 14:22:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:47,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263919618] [2025-03-03 14:22:47,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:47,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:47,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:22:47,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:22:47,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:47,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:22:48,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:48,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263919618] [2025-03-03 14:22:48,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263919618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:48,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607506212] [2025-03-03 14:22:48,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:48,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:48,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:48,004 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:48,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:22:48,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:22:48,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:22:48,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:48,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:48,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:48,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:48,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:22:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607506212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:22:48,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:22:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:22:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820254793] [2025-03-03 14:22:48,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:22:48,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:22:48,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:48,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:22:48,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:48,392 INFO L87 Difference]: Start difference. First operand 503 states and 775 transitions. Second operand has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 4 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-03 14:22:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:49,012 INFO L93 Difference]: Finished difference Result 1413 states and 2277 transitions. [2025-03-03 14:22:49,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:22:49,013 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 4 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) Word has length 167 [2025-03-03 14:22:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:49,019 INFO L225 Difference]: With dead ends: 1413 [2025-03-03 14:22:49,019 INFO L226 Difference]: Without dead ends: 942 [2025-03-03 14:22:49,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 331 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-03 14:22:49,022 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 1312 mSDsluCounter, 4452 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 5085 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:49,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 5085 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:22:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-03-03 14:22:49,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 918. [2025-03-03 14:22:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 725 states have (on average 1.609655172413793) internal successors, (1167), 731 states have internal predecessors, (1167), 159 states have call successors, (159), 31 states have call predecessors, (159), 33 states have return successors, (180), 157 states have call predecessors, (180), 158 states have call successors, (180) [2025-03-03 14:22:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1506 transitions. [2025-03-03 14:22:49,060 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1506 transitions. Word has length 167 [2025-03-03 14:22:49,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:49,060 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1506 transitions. [2025-03-03 14:22:49,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.6) internal successors, (166), 11 states have internal predecessors, (166), 4 states have call successors, (41), 2 states have call predecessors, (41), 3 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-03 14:22:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1506 transitions. [2025-03-03 14:22:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 14:22:49,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:49,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:49,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:49,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:49,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:49,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:49,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1515674057, now seen corresponding path program 1 times [2025-03-03 14:22:49,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:49,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162373356] [2025-03-03 14:22:49,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:49,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:49,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 14:22:49,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 14:22:49,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:49,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 14:22:49,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:49,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162373356] [2025-03-03 14:22:49,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162373356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:49,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:49,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224543298] [2025-03-03 14:22:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:49,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:49,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:49,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:49,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:49,330 INFO L87 Difference]: Start difference. First operand 918 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:49,368 INFO L93 Difference]: Finished difference Result 2148 states and 3587 transitions. [2025-03-03 14:22:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 189 [2025-03-03 14:22:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:49,375 INFO L225 Difference]: With dead ends: 2148 [2025-03-03 14:22:49,375 INFO L226 Difference]: Without dead ends: 1311 [2025-03-03 14:22:49,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:49,378 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 131 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:49,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1278 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2025-03-03 14:22:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1303. [2025-03-03 14:22:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1031 states have (on average 1.6314258001939865) internal successors, (1682), 1037 states have internal predecessors, (1682), 238 states have call successors, (238), 31 states have call predecessors, (238), 33 states have return successors, (269), 236 states have call predecessors, (269), 237 states have call successors, (269) [2025-03-03 14:22:49,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 2189 transitions. [2025-03-03 14:22:49,428 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 2189 transitions. Word has length 189 [2025-03-03 14:22:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:49,428 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 2189 transitions. [2025-03-03 14:22:49,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:49,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 2189 transitions. [2025-03-03 14:22:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 14:22:49,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:49,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:49,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:22:49,436 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:49,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1005488970, now seen corresponding path program 1 times [2025-03-03 14:22:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239473226] [2025-03-03 14:22:49,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:49,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:49,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 14:22:49,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 14:22:49,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:49,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 14:22:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239473226] [2025-03-03 14:22:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239473226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:49,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:49,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:49,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698663862] [2025-03-03 14:22:49,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:49,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:49,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:49,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:49,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:49,494 INFO L87 Difference]: Start difference. First operand 1303 states and 2189 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:49,544 INFO L93 Difference]: Finished difference Result 3111 states and 5269 transitions. [2025-03-03 14:22:49,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:49,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-03-03 14:22:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:49,570 INFO L225 Difference]: With dead ends: 3111 [2025-03-03 14:22:49,570 INFO L226 Difference]: Without dead ends: 1940 [2025-03-03 14:22:49,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:49,573 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 129 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:49,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1266 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2025-03-03 14:22:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1932. [2025-03-03 14:22:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1541 states have (on average 1.6430889033095393) internal successors, (2532), 1547 states have internal predecessors, (2532), 357 states have call successors, (357), 31 states have call predecessors, (357), 33 states have return successors, (388), 355 states have call predecessors, (388), 356 states have call successors, (388) [2025-03-03 14:22:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 3277 transitions. [2025-03-03 14:22:49,657 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 3277 transitions. Word has length 190 [2025-03-03 14:22:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:49,658 INFO L471 AbstractCegarLoop]: Abstraction has 1932 states and 3277 transitions. [2025-03-03 14:22:49,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 3277 transitions. [2025-03-03 14:22:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 14:22:49,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:49,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:49,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:22:49,668 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:49,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash -190509741, now seen corresponding path program 1 times [2025-03-03 14:22:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:49,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515412524] [2025-03-03 14:22:49,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:49,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:49,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 14:22:49,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 14:22:49,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:49,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515412524] [2025-03-03 14:22:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515412524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:49,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:49,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:49,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500451164] [2025-03-03 14:22:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:49,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:49,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:49,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:49,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:49,734 INFO L87 Difference]: Start difference. First operand 1932 states and 3277 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:49,809 INFO L93 Difference]: Finished difference Result 4573 states and 7828 transitions. [2025-03-03 14:22:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:49,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 172 [2025-03-03 14:22:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:49,824 INFO L225 Difference]: With dead ends: 4573 [2025-03-03 14:22:49,825 INFO L226 Difference]: Without dead ends: 2905 [2025-03-03 14:22:49,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:49,833 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 127 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:49,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1263 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:49,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2025-03-03 14:22:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2897. [2025-03-03 14:22:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2344 states have (on average 1.6523037542662116) internal successors, (3873), 2350 states have internal predecessors, (3873), 519 states have call successors, (519), 31 states have call predecessors, (519), 33 states have return successors, (566), 517 states have call predecessors, (566), 518 states have call successors, (566) [2025-03-03 14:22:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 4958 transitions. [2025-03-03 14:22:49,952 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 4958 transitions. Word has length 172 [2025-03-03 14:22:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:49,952 INFO L471 AbstractCegarLoop]: Abstraction has 2897 states and 4958 transitions. [2025-03-03 14:22:49,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4958 transitions. [2025-03-03 14:22:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 14:22:49,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:49,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:49,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:22:49,966 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:49,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:49,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1491706160, now seen corresponding path program 1 times [2025-03-03 14:22:49,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:49,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660925493] [2025-03-03 14:22:49,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:49,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:49,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 14:22:49,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 14:22:49,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:49,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:50,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:50,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660925493] [2025-03-03 14:22:50,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660925493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:50,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:50,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:50,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439447854] [2025-03-03 14:22:50,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:50,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:50,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:50,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:50,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:50,029 INFO L87 Difference]: Start difference. First operand 2897 states and 4958 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:50,141 INFO L93 Difference]: Finished difference Result 6881 states and 11875 transitions. [2025-03-03 14:22:50,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:50,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 173 [2025-03-03 14:22:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:50,165 INFO L225 Difference]: With dead ends: 6881 [2025-03-03 14:22:50,165 INFO L226 Difference]: Without dead ends: 4463 [2025-03-03 14:22:50,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:50,175 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 125 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:50,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1263 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4463 states. [2025-03-03 14:22:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4463 to 4455. [2025-03-03 14:22:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4455 states, 3657 states have (on average 1.659010117582718) internal successors, (6067), 3663 states have internal predecessors, (6067), 764 states have call successors, (764), 31 states have call predecessors, (764), 33 states have return successors, (837), 762 states have call predecessors, (837), 763 states have call successors, (837) [2025-03-03 14:22:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 7668 transitions. [2025-03-03 14:22:50,359 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 7668 transitions. Word has length 173 [2025-03-03 14:22:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:50,360 INFO L471 AbstractCegarLoop]: Abstraction has 4455 states and 7668 transitions. [2025-03-03 14:22:50,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 7668 transitions. [2025-03-03 14:22:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 14:22:50,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:50,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:50,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:22:50,378 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:50,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1978831540, now seen corresponding path program 1 times [2025-03-03 14:22:50,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:50,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985831417] [2025-03-03 14:22:50,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:50,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 14:22:50,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 14:22:50,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:50,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:50,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985831417] [2025-03-03 14:22:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985831417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:50,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:50,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214350081] [2025-03-03 14:22:50,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:50,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:50,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:50,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:50,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:50,431 INFO L87 Difference]: Start difference. First operand 4455 states and 7668 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:50,600 INFO L93 Difference]: Finished difference Result 10996 states and 19048 transitions. [2025-03-03 14:22:50,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:50,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 174 [2025-03-03 14:22:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:50,641 INFO L225 Difference]: With dead ends: 10996 [2025-03-03 14:22:50,642 INFO L226 Difference]: Without dead ends: 7267 [2025-03-03 14:22:50,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:50,657 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 123 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:50,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1279 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:50,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7267 states. [2025-03-03 14:22:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7267 to 7259. [2025-03-03 14:22:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7259 states, 5968 states have (on average 1.6566689008042896) internal successors, (9887), 5974 states have internal predecessors, (9887), 1257 states have call successors, (1257), 31 states have call predecessors, (1257), 33 states have return successors, (1374), 1255 states have call predecessors, (1374), 1256 states have call successors, (1374) [2025-03-03 14:22:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 12518 transitions. [2025-03-03 14:22:50,963 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 12518 transitions. Word has length 174 [2025-03-03 14:22:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:50,964 INFO L471 AbstractCegarLoop]: Abstraction has 7259 states and 12518 transitions. [2025-03-03 14:22:50,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 12518 transitions. [2025-03-03 14:22:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 14:22:50,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:50,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:50,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:22:50,988 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:50,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1210900625, now seen corresponding path program 1 times [2025-03-03 14:22:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122575564] [2025-03-03 14:22:50,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:51,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 14:22:51,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 14:22:51,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:51,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:51,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122575564] [2025-03-03 14:22:51,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122575564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:51,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:51,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:51,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825869128] [2025-03-03 14:22:51,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:51,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:51,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:51,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:51,045 INFO L87 Difference]: Start difference. First operand 7259 states and 12518 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:51,321 INFO L93 Difference]: Finished difference Result 18311 states and 31796 transitions. [2025-03-03 14:22:51,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:51,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 175 [2025-03-03 14:22:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:51,381 INFO L225 Difference]: With dead ends: 18311 [2025-03-03 14:22:51,381 INFO L226 Difference]: Without dead ends: 12174 [2025-03-03 14:22:51,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:51,405 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 121 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:51,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1268 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12174 states. [2025-03-03 14:22:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12174 to 12166. [2025-03-03 14:22:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12166 states, 10053 states have (on average 1.6578135879836864) internal successors, (16666), 10059 states have internal predecessors, (16666), 2079 states have call successors, (2079), 31 states have call predecessors, (2079), 33 states have return successors, (2274), 2077 states have call predecessors, (2274), 2078 states have call successors, (2274) [2025-03-03 14:22:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12166 states to 12166 states and 21019 transitions. [2025-03-03 14:22:52,020 INFO L78 Accepts]: Start accepts. Automaton has 12166 states and 21019 transitions. Word has length 175 [2025-03-03 14:22:52,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:52,020 INFO L471 AbstractCegarLoop]: Abstraction has 12166 states and 21019 transitions. [2025-03-03 14:22:52,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 12166 states and 21019 transitions. [2025-03-03 14:22:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 14:22:52,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:52,064 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:52,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:22:52,065 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:52,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1604139194, now seen corresponding path program 1 times [2025-03-03 14:22:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088102599] [2025-03-03 14:22:52,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:52,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:22:52,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:22:52,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:52,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 14:22:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:52,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088102599] [2025-03-03 14:22:52,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088102599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:52,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:52,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:52,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566365277] [2025-03-03 14:22:52,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:52,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:52,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:52,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:52,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:52,121 INFO L87 Difference]: Start difference. First operand 12166 states and 21019 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:52,504 INFO L93 Difference]: Finished difference Result 29067 states and 50173 transitions. [2025-03-03 14:22:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:52,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 195 [2025-03-03 14:22:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:52,586 INFO L225 Difference]: With dead ends: 29067 [2025-03-03 14:22:52,587 INFO L226 Difference]: Without dead ends: 18990 [2025-03-03 14:22:52,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:52,617 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 119 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:52,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1246 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18990 states. [2025-03-03 14:22:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18990 to 18982. [2025-03-03 14:22:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18982 states, 15666 states have (on average 1.6340482573726542) internal successors, (25599), 15672 states have internal predecessors, (25599), 3282 states have call successors, (3282), 31 states have call predecessors, (3282), 33 states have return successors, (3621), 3280 states have call predecessors, (3621), 3281 states have call successors, (3621) [2025-03-03 14:22:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18982 states to 18982 states and 32502 transitions. [2025-03-03 14:22:53,251 INFO L78 Accepts]: Start accepts. Automaton has 18982 states and 32502 transitions. Word has length 195 [2025-03-03 14:22:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:53,251 INFO L471 AbstractCegarLoop]: Abstraction has 18982 states and 32502 transitions. [2025-03-03 14:22:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 18982 states and 32502 transitions. [2025-03-03 14:22:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 14:22:53,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:53,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:53,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:22:53,299 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:53,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:53,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1024679090, now seen corresponding path program 1 times [2025-03-03 14:22:53,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:53,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119761605] [2025-03-03 14:22:53,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:53,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:53,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 14:22:53,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 14:22:53,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:53,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:53,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:53,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119761605] [2025-03-03 14:22:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119761605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:53,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:53,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:53,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860863348] [2025-03-03 14:22:53,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:53,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:53,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:53,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:53,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:53,356 INFO L87 Difference]: Start difference. First operand 18982 states and 32502 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:54,193 INFO L93 Difference]: Finished difference Result 50104 states and 86156 transitions. [2025-03-03 14:22:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:54,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 177 [2025-03-03 14:22:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:54,332 INFO L225 Difference]: With dead ends: 50104 [2025-03-03 14:22:54,332 INFO L226 Difference]: Without dead ends: 33845 [2025-03-03 14:22:54,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:54,388 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 117 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:54,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1266 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33845 states. [2025-03-03 14:22:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33845 to 33837. [2025-03-03 14:22:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33837 states, 28071 states have (on average 1.6315414484699513) internal successors, (45799), 28077 states have internal predecessors, (45799), 5732 states have call successors, (5732), 31 states have call predecessors, (5732), 33 states have return successors, (6345), 5730 states have call predecessors, (6345), 5731 states have call successors, (6345) [2025-03-03 14:22:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33837 states to 33837 states and 57876 transitions. [2025-03-03 14:22:55,583 INFO L78 Accepts]: Start accepts. Automaton has 33837 states and 57876 transitions. Word has length 177 [2025-03-03 14:22:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:55,583 INFO L471 AbstractCegarLoop]: Abstraction has 33837 states and 57876 transitions. [2025-03-03 14:22:55,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:22:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 33837 states and 57876 transitions. [2025-03-03 14:22:55,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 14:22:55,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:55,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:55,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:22:55,648 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:55,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash 616645381, now seen corresponding path program 1 times [2025-03-03 14:22:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:55,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632636417] [2025-03-03 14:22:55,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:55,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 14:22:55,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 14:22:55,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:55,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 14:22:55,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:55,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632636417] [2025-03-03 14:22:55,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632636417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:55,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:55,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:55,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948727333] [2025-03-03 14:22:55,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:55,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:55,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:55,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:55,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:55,706 INFO L87 Difference]: Start difference. First operand 33837 states and 57876 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:56,913 INFO L93 Difference]: Finished difference Result 92196 states and 158243 transitions. [2025-03-03 14:22:56,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 197 [2025-03-03 14:22:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:57,153 INFO L225 Difference]: With dead ends: 92196 [2025-03-03 14:22:57,153 INFO L226 Difference]: Without dead ends: 61989 [2025-03-03 14:22:57,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:57,225 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 115 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:57,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1267 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61989 states. [2025-03-03 14:22:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61989 to 61981. [2025-03-03 14:22:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61981 states, 51702 states have (on average 1.6278093690766315) internal successors, (84161), 51708 states have internal predecessors, (84161), 10245 states have call successors, (10245), 31 states have call predecessors, (10245), 33 states have return successors, (11390), 10243 states have call predecessors, (11390), 10244 states have call successors, (11390) [2025-03-03 14:22:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61981 states to 61981 states and 105796 transitions. [2025-03-03 14:22:59,712 INFO L78 Accepts]: Start accepts. Automaton has 61981 states and 105796 transitions. Word has length 197 [2025-03-03 14:22:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:59,713 INFO L471 AbstractCegarLoop]: Abstraction has 61981 states and 105796 transitions. [2025-03-03 14:22:59,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 14:22:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 61981 states and 105796 transitions. [2025-03-03 14:22:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 14:22:59,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:59,852 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:59,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:22:59,853 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:59,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash -951352691, now seen corresponding path program 1 times [2025-03-03 14:22:59,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:59,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521928587] [2025-03-03 14:22:59,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:59,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 14:22:59,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 14:22:59,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:59,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 14:22:59,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:59,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521928587] [2025-03-03 14:22:59,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521928587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:59,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:59,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260428394] [2025-03-03 14:22:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:59,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:59,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:59,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:59,926 INFO L87 Difference]: Start difference. First operand 61981 states and 105796 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:23:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:01,979 INFO L93 Difference]: Finished difference Result 116062 states and 198541 transitions. [2025-03-03 14:23:01,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:01,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 179 [2025-03-03 14:23:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:02,391 INFO L225 Difference]: With dead ends: 116062 [2025-03-03 14:23:02,391 INFO L226 Difference]: Without dead ends: 115829 [2025-03-03 14:23:02,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:02,455 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 110 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1272 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-03 14:23:02,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1272 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:02,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115829 states. [2025-03-03 14:23:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115829 to 115821. [2025-03-03 14:23:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115821 states, 97174 states have (on average 1.6228209191759113) internal successors, (157696), 97180 states have internal predecessors, (157696), 18613 states have call successors, (18613), 31 states have call predecessors, (18613), 33 states have return successors, (20804), 18611 states have call predecessors, (20804), 18612 states have call successors, (20804) [2025-03-03 14:23:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115821 states to 115821 states and 197113 transitions. [2025-03-03 14:23:06,737 INFO L78 Accepts]: Start accepts. Automaton has 115821 states and 197113 transitions. Word has length 179 [2025-03-03 14:23:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:06,737 INFO L471 AbstractCegarLoop]: Abstraction has 115821 states and 197113 transitions. [2025-03-03 14:23:06,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:23:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 115821 states and 197113 transitions. [2025-03-03 14:23:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 14:23:06,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:06,900 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:06,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:23:06,900 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:06,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1974079991, now seen corresponding path program 1 times [2025-03-03 14:23:06,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:06,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32312837] [2025-03-03 14:23:06,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:06,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:06,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 14:23:06,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 14:23:06,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:06,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:23:07,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32312837] [2025-03-03 14:23:07,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32312837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:07,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496982476] [2025-03-03 14:23:07,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:07,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:07,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:07,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:23:07,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 14:23:07,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 14:23:07,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:07,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:07,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:23:07,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:23:07,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:23:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 14:23:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496982476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:23:08,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:23:08,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-03-03 14:23:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68038051] [2025-03-03 14:23:08,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:23:08,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:23:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:08,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:23:08,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:23:08,223 INFO L87 Difference]: Start difference. First operand 115821 states and 197113 transitions. Second operand has 28 states, 26 states have (on average 10.5) internal successors, (273), 24 states have internal predecessors, (273), 9 states have call successors, (58), 8 states have call predecessors, (58), 12 states have return successors, (51), 11 states have call predecessors, (51), 9 states have call successors, (51) [2025-03-03 14:23:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:23,821 INFO L93 Difference]: Finished difference Result 461737 states and 809757 transitions. [2025-03-03 14:23:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-03 14:23:23,822 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 10.5) internal successors, (273), 24 states have internal predecessors, (273), 9 states have call successors, (58), 8 states have call predecessors, (58), 12 states have return successors, (51), 11 states have call predecessors, (51), 9 states have call successors, (51) Word has length 180 [2025-03-03 14:23:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:26,032 INFO L225 Difference]: With dead ends: 461737 [2025-03-03 14:23:26,032 INFO L226 Difference]: Without dead ends: 461512 [2025-03-03 14:23:26,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1363, Invalid=11293, Unknown=0, NotChecked=0, Total=12656 [2025-03-03 14:23:26,193 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 7918 mSDsluCounter, 5471 mSDsCounter, 0 mSdLazyCounter, 12807 mSolverCounterSat, 2368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7985 SdHoareTripleChecker+Valid, 5731 SdHoareTripleChecker+Invalid, 15175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2368 IncrementalHoareTripleChecker+Valid, 12807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:26,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7985 Valid, 5731 Invalid, 15175 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2368 Valid, 12807 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-03 14:23:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461512 states.