./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec11_product26.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 f29a19c3efa542dcf2ceb090606fb32840c0b6e985b77630bcd852a7818d8a39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:30:27,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:30:27,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:30:27,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:30:27,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:30:27,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:30:27,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:30:27,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:30:27,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:30:27,970 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:30:27,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:30:27,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:30:27,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:30:27,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:30:27,971 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:30:27,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:30:27,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:30:27,971 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:30:27,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:30:27,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:30:27,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:30:27,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:30:27,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:30:27,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:30:27,972 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:30:27,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:30:27,972 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:30:27,972 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:30:27,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:30:27,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:30:27,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:30:27,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:30:27,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:30:27,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:30:27,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:30:27,973 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:30:27,973 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:30:27,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:30:27,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:30:27,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:30:27,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:30:27,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:30:27,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:30:27,974 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 -> f29a19c3efa542dcf2ceb090606fb32840c0b6e985b77630bcd852a7818d8a39 [2025-03-08 05:30:28,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:30:28,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:30:28,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:30:28,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:30:28,240 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:30:28,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product26.cil.c [2025-03-08 05:30:29,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0875475e2/7a049eec07114ae9a03b2382ae0a7823/FLAGa8c2f2639 [2025-03-08 05:30:29,791 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:30:29,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product26.cil.c [2025-03-08 05:30:29,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0875475e2/7a049eec07114ae9a03b2382ae0a7823/FLAGa8c2f2639 [2025-03-08 05:30:29,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0875475e2/7a049eec07114ae9a03b2382ae0a7823 [2025-03-08 05:30:29,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:30:29,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:30:29,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:30:29,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:30:29,837 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:30:29,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:30:29" (1/1) ... [2025-03-08 05:30:29,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e22ffb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:29, skipping insertion in model container [2025-03-08 05:30:29,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:30:29" (1/1) ... [2025-03-08 05:30:29,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:30:30,298 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_spec11_product26.cil.c[63627,63640] [2025-03-08 05:30:30,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:30:30,331 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:30:30,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-03-08 05:30:30,341 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [460] [2025-03-08 05:30:30,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [577] [2025-03-08 05:30:30,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [615] [2025-03-08 05:30:30,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [636] [2025-03-08 05:30:30,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [964] [2025-03-08 05:30:30,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1330] [2025-03-08 05:30:30,342 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1552] [2025-03-08 05:30:30,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2620] [2025-03-08 05:30:30,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2960] [2025-03-08 05:30:30,343 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2969] [2025-03-08 05:30:30,429 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_spec11_product26.cil.c[63627,63640] [2025-03-08 05:30:30,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:30:30,468 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:30:30,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30 WrapperNode [2025-03-08 05:30:30,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:30:30,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:30:30,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:30:30,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:30:30,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,537 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 59, calls inlined = 56, statements flattened = 1089 [2025-03-08 05:30:30,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:30:30,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:30:30,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:30:30,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:30:30,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,578 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:30:30,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:30:30,632 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:30:30,632 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:30:30,632 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:30:30,633 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (1/1) ... [2025-03-08 05:30:30,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:30:30,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:30,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:30:30,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:30:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:30:30,686 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:30:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:30:30,686 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:30:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:30:30,686 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:30:30,686 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:30:30,686 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:30:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:30:30,687 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:30:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:30:30,687 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:30:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:30:30,687 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:30:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:30:30,687 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:30:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:30:30,687 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:30:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:30:30,687 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:30:30,687 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:30:30,687 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:30:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:30:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:30:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:30:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:30:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:30:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:30:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:30:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:30:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:30:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:30:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:30:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:30:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:30:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:30:30,688 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:30:30,688 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:30:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:30:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:30:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:30:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:30:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:30:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:30:30,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:30:30,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:30:30,875 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:30:30,879 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:30:30,997 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2209-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~31#1; [2025-03-08 05:30:30,997 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2254: #res#1 := ~retValue_acc~32#1; [2025-03-08 05:30:31,017 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L574-1: createEmail_#res#1 := createEmail_~retValue_acc~14#1; [2025-03-08 05:30:31,030 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1706: #res := ~retValue_acc~24; [2025-03-08 05:30:31,045 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-03-08 05:30:31,084 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-03-08 05:30:31,109 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-03-08 05:30:31,172 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2032: #res := ~retValue_acc~28; [2025-03-08 05:30:31,331 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2597-1: getClientId_#res#1 := getClientId_~retValue_acc~37#1; [2025-03-08 05:30:31,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L104-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-03-08 05:30:31,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2550-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~36#1; [2025-03-08 05:30:31,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2162-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~30#1; [2025-03-08 05:30:31,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2478-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~35#1; [2025-03-08 05:30:31,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~29#1; [2025-03-08 05:30:31,332 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2908-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2025-03-08 05:30:31,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2317-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~33#1; [2025-03-08 05:30:31,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2865-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-03-08 05:30:31,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2883-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-03-08 05:30:31,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2424-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~34#1; [2025-03-08 05:30:31,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2874-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-03-08 05:30:31,584 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L612-1: valid_product_#res#1 := valid_product_~retValue_acc~16#1; [2025-03-08 05:30:31,591 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-03-08 05:30:31,598 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L530-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~11#1; [2025-03-08 05:30:31,598 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L550: #res#1 := ~retValue_acc~12#1; [2025-03-08 05:30:31,721 INFO L? ?]: Removed 540 outVars from TransFormulas that were not future-live. [2025-03-08 05:30:31,721 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:30:31,742 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:30:31,743 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:30:31,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:31 BoogieIcfgContainer [2025-03-08 05:30:31,743 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:30:31,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:30:31,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:30:31,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:30:31,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:30:29" (1/3) ... [2025-03-08 05:30:31,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd030ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:30:31, skipping insertion in model container [2025-03-08 05:30:31,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:30" (2/3) ... [2025-03-08 05:30:31,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd030ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:30:31, skipping insertion in model container [2025-03-08 05:30:31,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:31" (3/3) ... [2025-03-08 05:30:31,750 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_product26.cil.c [2025-03-08 05:30:31,763 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:30:31,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_product26.cil.c that has 25 procedures, 398 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:30:31,833 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:30:31,846 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;@64235e65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:30:31,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:30:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 398 states, 310 states have (on average 1.5612903225806452) internal successors, (484), 315 states have internal predecessors, (484), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 05:30:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:30:31,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:31,872 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:31,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:31,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash 827948761, now seen corresponding path program 1 times [2025-03-08 05:30:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:31,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112823569] [2025-03-08 05:30:31,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:32,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:30:32,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:30:32,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:32,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:30:32,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:32,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112823569] [2025-03-08 05:30:32,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112823569] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:32,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142764114] [2025-03-08 05:30:32,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:32,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:32,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:32,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:32,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:30:32,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:30:32,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:30:32,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:32,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:32,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:30:32,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:30:32,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:32,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142764114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:32,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:32,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:30:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651455198] [2025-03-08 05:30:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:33,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:33,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:33,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:30:33,019 INFO L87 Difference]: Start difference. First operand has 398 states, 310 states have (on average 1.5612903225806452) internal successors, (484), 315 states have internal predecessors, (484), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:33,114 INFO L93 Difference]: Finished difference Result 601 states and 904 transitions. [2025-03-08 05:30:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 137 [2025-03-08 05:30:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:33,129 INFO L225 Difference]: With dead ends: 601 [2025-03-08 05:30:33,131 INFO L226 Difference]: Without dead ends: 392 [2025-03-08 05:30:33,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:30:33,142 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 0 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:33,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1205 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:33,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-08 05:30:33,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-08 05:30:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 305 states have (on average 1.5573770491803278) internal successors, (475), 309 states have internal predecessors, (475), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 05:30:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 598 transitions. [2025-03-08 05:30:33,213 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 598 transitions. Word has length 137 [2025-03-08 05:30:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:33,214 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 598 transitions. [2025-03-08 05:30:33,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 598 transitions. [2025-03-08 05:30:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 05:30:33,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:33,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:33,227 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-08 05:30:33,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:30:33,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:33,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2057877083, now seen corresponding path program 1 times [2025-03-08 05:30:33,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:33,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430560067] [2025-03-08 05:30:33,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:33,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:33,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:30:33,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:30:33,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:33,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:30:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430560067] [2025-03-08 05:30:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430560067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068383582] [2025-03-08 05:30:33,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:33,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:33,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:33,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:33,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:30:33,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:30:34,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:30:34,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:34,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:34,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:30:34,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 05:30:34,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068383582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:34,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:30:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826792384] [2025-03-08 05:30:34,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:34,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:34,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:34,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:34,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:30:34,128 INFO L87 Difference]: Start difference. First operand 392 states and 598 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:34,191 INFO L93 Difference]: Finished difference Result 836 states and 1295 transitions. [2025-03-08 05:30:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:34,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2025-03-08 05:30:34,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:34,198 INFO L225 Difference]: With dead ends: 836 [2025-03-08 05:30:34,198 INFO L226 Difference]: Without dead ends: 470 [2025-03-08 05:30:34,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:30:34,200 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 142 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:34,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1158 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-08 05:30:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 462. [2025-03-08 05:30:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 361 states have (on average 1.5789473684210527) internal successors, (570), 365 states have internal predecessors, (570), 76 states have call successors, (76), 24 states have call predecessors, (76), 24 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-08 05:30:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 721 transitions. [2025-03-08 05:30:34,244 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 721 transitions. Word has length 144 [2025-03-08 05:30:34,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:34,246 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 721 transitions. [2025-03-08 05:30:34,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 721 transitions. [2025-03-08 05:30:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:30:34,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:34,250 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:34,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:30:34,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:30:34,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:34,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:34,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1305850713, now seen corresponding path program 1 times [2025-03-08 05:30:34,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:34,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919353686] [2025-03-08 05:30:34,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:34,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:34,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:30:34,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:30:34,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:34,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:30:34,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919353686] [2025-03-08 05:30:34,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919353686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:34,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404702707] [2025-03-08 05:30:34,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:34,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:34,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:34,727 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:34,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:30:34,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:30:34,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:30:34,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:34,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:34,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:30:34,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:30:35,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:35,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404702707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:35,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:35,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:30:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537870703] [2025-03-08 05:30:35,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:35,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:35,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:35,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:35,035 INFO L87 Difference]: Start difference. First operand 462 states and 721 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:30:35,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:35,106 INFO L93 Difference]: Finished difference Result 915 states and 1432 transitions. [2025-03-08 05:30:35,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:35,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 126 [2025-03-08 05:30:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:35,111 INFO L225 Difference]: With dead ends: 915 [2025-03-08 05:30:35,112 INFO L226 Difference]: Without dead ends: 464 [2025-03-08 05:30:35,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:35,114 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 2 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:35,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2345 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-08 05:30:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2025-03-08 05:30:35,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 362 states have (on average 1.5773480662983426) internal successors, (571), 367 states have internal predecessors, (571), 76 states have call successors, (76), 24 states have call predecessors, (76), 25 states have return successors, (77), 74 states have call predecessors, (77), 75 states have call successors, (77) [2025-03-08 05:30:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 724 transitions. [2025-03-08 05:30:35,157 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 724 transitions. Word has length 126 [2025-03-08 05:30:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:35,158 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 724 transitions. [2025-03-08 05:30:35,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:30:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 724 transitions. [2025-03-08 05:30:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:30:35,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:35,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:35,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:30:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:35,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 655246847, now seen corresponding path program 1 times [2025-03-08 05:30:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020233109] [2025-03-08 05:30:35,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:35,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:30:35,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:30:35,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:35,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:30:35,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:35,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020233109] [2025-03-08 05:30:35,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020233109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:35,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461621126] [2025-03-08 05:30:35,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:35,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:35,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:35,539 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:35,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:30:35,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:30:35,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:30:35,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:35,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:35,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:30:35,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:30:35,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:35,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461621126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:35,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:35,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:30:35,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116579212] [2025-03-08 05:30:35,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:35,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:35,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:35,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:30:35,861 INFO L87 Difference]: Start difference. First operand 464 states and 724 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:30:35,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:35,936 INFO L93 Difference]: Finished difference Result 917 states and 1437 transitions. [2025-03-08 05:30:35,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:35,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2025-03-08 05:30:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:35,941 INFO L225 Difference]: With dead ends: 917 [2025-03-08 05:30:35,941 INFO L226 Difference]: Without dead ends: 466 [2025-03-08 05:30:35,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:30:35,944 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 2 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:35,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2331 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-08 05:30:35,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-03-08 05:30:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 369 states have internal predecessors, (572), 76 states have call successors, (76), 24 states have call predecessors, (76), 26 states have return successors, (82), 74 states have call predecessors, (82), 75 states have call successors, (82) [2025-03-08 05:30:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 730 transitions. [2025-03-08 05:30:35,971 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 730 transitions. Word has length 127 [2025-03-08 05:30:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:35,971 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 730 transitions. [2025-03-08 05:30:35,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:30:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 730 transitions. [2025-03-08 05:30:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 05:30:35,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:35,975 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:35,987 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-08 05:30:36,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:36,177 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:36,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:36,177 INFO L85 PathProgramCache]: Analyzing trace with hash 435256806, now seen corresponding path program 1 times [2025-03-08 05:30:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021732445] [2025-03-08 05:30:36,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:36,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 05:30:36,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 05:30:36,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:36,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:30:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021732445] [2025-03-08 05:30:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021732445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:36,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573583424] [2025-03-08 05:30:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:36,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:36,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:36,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:36,362 INFO L87 Difference]: Start difference. First operand 466 states and 730 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:30:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:36,411 INFO L93 Difference]: Finished difference Result 909 states and 1428 transitions. [2025-03-08 05:30:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:36,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 147 [2025-03-08 05:30:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:36,416 INFO L225 Difference]: With dead ends: 909 [2025-03-08 05:30:36,416 INFO L226 Difference]: Without dead ends: 466 [2025-03-08 05:30:36,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:36,419 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 2 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:36,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2349 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-08 05:30:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-03-08 05:30:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 369 states have internal predecessors, (572), 76 states have call successors, (76), 24 states have call predecessors, (76), 26 states have return successors, (81), 74 states have call predecessors, (81), 75 states have call successors, (81) [2025-03-08 05:30:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 729 transitions. [2025-03-08 05:30:36,442 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 729 transitions. Word has length 147 [2025-03-08 05:30:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:36,442 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 729 transitions. [2025-03-08 05:30:36,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:30:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 729 transitions. [2025-03-08 05:30:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:30:36,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:36,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:36,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:30:36,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:36,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:36,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1064157489, now seen corresponding path program 1 times [2025-03-08 05:30:36,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:36,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253084218] [2025-03-08 05:30:36,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:36,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:36,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:30:36,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:30:36,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:36,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:30:36,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253084218] [2025-03-08 05:30:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253084218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:36,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:30:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134954978] [2025-03-08 05:30:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:36,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:30:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:36,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:30:36,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:36,619 INFO L87 Difference]: Start difference. First operand 466 states and 729 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:30:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:36,669 INFO L93 Difference]: Finished difference Result 911 states and 1431 transitions. [2025-03-08 05:30:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:30:36,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 129 [2025-03-08 05:30:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:36,673 INFO L225 Difference]: With dead ends: 911 [2025-03-08 05:30:36,674 INFO L226 Difference]: Without dead ends: 468 [2025-03-08 05:30:36,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:30:36,676 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 1 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:36,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2352 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-08 05:30:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-08 05:30:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 371 states have internal predecessors, (573), 76 states have call successors, (76), 24 states have call predecessors, (76), 27 states have return successors, (83), 74 states have call predecessors, (83), 75 states have call successors, (83) [2025-03-08 05:30:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 732 transitions. [2025-03-08 05:30:36,699 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 732 transitions. Word has length 129 [2025-03-08 05:30:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:36,699 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 732 transitions. [2025-03-08 05:30:36,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:30:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 732 transitions. [2025-03-08 05:30:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:30:36,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:36,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:36,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:30:36,704 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:36,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash -715179223, now seen corresponding path program 1 times [2025-03-08 05:30:36,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:36,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217509897] [2025-03-08 05:30:36,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:36,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:30:36,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:30:36,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:36,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 05:30:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:36,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217509897] [2025-03-08 05:30:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217509897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:36,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:36,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:30:36,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768722535] [2025-03-08 05:30:36,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:36,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:30:36,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:36,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:30:36,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:36,882 INFO L87 Difference]: Start difference. First operand 468 states and 732 transitions. Second operand has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 05:30:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:37,000 INFO L93 Difference]: Finished difference Result 913 states and 1430 transitions. [2025-03-08 05:30:37,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:30:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 149 [2025-03-08 05:30:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:37,003 INFO L225 Difference]: With dead ends: 913 [2025-03-08 05:30:37,003 INFO L226 Difference]: Without dead ends: 470 [2025-03-08 05:30:37,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:30:37,008 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 7 mSDsluCounter, 3457 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:37,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4038 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:30:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-08 05:30:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-03-08 05:30:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 366 states have (on average 1.5710382513661203) internal successors, (575), 372 states have internal predecessors, (575), 76 states have call successors, (76), 25 states have call predecessors, (76), 27 states have return successors, (82), 74 states have call predecessors, (82), 75 states have call successors, (82) [2025-03-08 05:30:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 733 transitions. [2025-03-08 05:30:37,030 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 733 transitions. Word has length 149 [2025-03-08 05:30:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:37,030 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 733 transitions. [2025-03-08 05:30:37,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 05:30:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 733 transitions. [2025-03-08 05:30:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:30:37,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:37,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:37,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:30:37,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:37,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:37,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1309277116, now seen corresponding path program 1 times [2025-03-08 05:30:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:37,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770631407] [2025-03-08 05:30:37,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:37,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:37,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:30:37,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:30:37,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:37,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 05:30:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770631407] [2025-03-08 05:30:37,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770631407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:37,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:30:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091505919] [2025-03-08 05:30:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:37,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:30:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:37,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:30:37,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:30:37,177 INFO L87 Difference]: Start difference. First operand 470 states and 733 transitions. Second operand has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:30:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:37,311 INFO L93 Difference]: Finished difference Result 916 states and 1437 transitions. [2025-03-08 05:30:37,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:30:37,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 131 [2025-03-08 05:30:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:37,317 INFO L225 Difference]: With dead ends: 916 [2025-03-08 05:30:37,317 INFO L226 Difference]: Without dead ends: 473 [2025-03-08 05:30:37,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:30:37,319 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 5 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4052 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:37,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4052 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:30:37,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-08 05:30:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2025-03-08 05:30:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 368 states have (on average 1.5679347826086956) internal successors, (577), 375 states have internal predecessors, (577), 76 states have call successors, (76), 25 states have call predecessors, (76), 28 states have return successors, (87), 74 states have call predecessors, (87), 75 states have call successors, (87) [2025-03-08 05:30:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 740 transitions. [2025-03-08 05:30:37,346 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 740 transitions. Word has length 131 [2025-03-08 05:30:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:37,346 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 740 transitions. [2025-03-08 05:30:37,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.857142857142858) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:30:37,347 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 740 transitions. [2025-03-08 05:30:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 05:30:37,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:37,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:37,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:30:37,349 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:37,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:37,350 INFO L85 PathProgramCache]: Analyzing trace with hash 795762668, now seen corresponding path program 1 times [2025-03-08 05:30:37,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:37,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120423591] [2025-03-08 05:30:37,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:37,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:37,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 05:30:37,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 05:30:37,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:37,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:30:37,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:37,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120423591] [2025-03-08 05:30:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120423591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:37,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673185184] [2025-03-08 05:30:37,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:37,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:37,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:37,545 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:37,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:30:37,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 05:30:37,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 05:30:37,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:37,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:37,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:30:37,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 05:30:37,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:30:37,963 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 05:30:37,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673185184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:30:37,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:30:37,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:30:37,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702414314] [2025-03-08 05:30:37,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:30:37,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:30:37,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:37,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:30:37,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:30:37,965 INFO L87 Difference]: Start difference. First operand 473 states and 740 transitions. Second operand has 11 states, 10 states have (on average 14.4) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-08 05:30:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:38,538 INFO L93 Difference]: Finished difference Result 1373 states and 2242 transitions. [2025-03-08 05:30:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:30:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.4) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) Word has length 151 [2025-03-08 05:30:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:38,545 INFO L225 Difference]: With dead ends: 1373 [2025-03-08 05:30:38,545 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 05:30:38,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:30:38,548 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 1543 mSDsluCounter, 3268 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:38,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 3858 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:30:38,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 05:30:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 907. [2025-03-08 05:30:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 723 states have (on average 1.623789764868603) internal successors, (1174), 729 states have internal predecessors, (1174), 155 states have call successors, (155), 26 states have call predecessors, (155), 28 states have return successors, (176), 153 states have call predecessors, (176), 154 states have call successors, (176) [2025-03-08 05:30:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1505 transitions. [2025-03-08 05:30:38,585 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1505 transitions. Word has length 151 [2025-03-08 05:30:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:38,585 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1505 transitions. [2025-03-08 05:30:38,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.4) internal successors, (144), 11 states have internal predecessors, (144), 4 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-08 05:30:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1505 transitions. [2025-03-08 05:30:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 05:30:38,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:38,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:38,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:30:38,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:38,791 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:38,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:38,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1845031504, now seen corresponding path program 1 times [2025-03-08 05:30:38,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:38,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622149843] [2025-03-08 05:30:38,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:38,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 05:30:38,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 05:30:38,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:38,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 05:30:38,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:38,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622149843] [2025-03-08 05:30:38,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622149843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:38,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:38,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094445534] [2025-03-08 05:30:38,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:38,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:38,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:38,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:38,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:38,869 INFO L87 Difference]: Start difference. First operand 907 states and 1505 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:38,938 INFO L93 Difference]: Finished difference Result 2146 states and 3620 transitions. [2025-03-08 05:30:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:38,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 155 [2025-03-08 05:30:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:38,947 INFO L225 Difference]: With dead ends: 2146 [2025-03-08 05:30:38,947 INFO L226 Difference]: Without dead ends: 1318 [2025-03-08 05:30:38,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:38,950 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 139 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:38,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1190 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-03-08 05:30:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1310. [2025-03-08 05:30:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1047 states have (on average 1.6446991404011462) internal successors, (1722), 1053 states have internal predecessors, (1722), 234 states have call successors, (234), 26 states have call predecessors, (234), 28 states have return successors, (265), 232 states have call predecessors, (265), 233 states have call successors, (265) [2025-03-08 05:30:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 2221 transitions. [2025-03-08 05:30:39,016 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 2221 transitions. Word has length 155 [2025-03-08 05:30:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:39,016 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 2221 transitions. [2025-03-08 05:30:39,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 2221 transitions. [2025-03-08 05:30:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 05:30:39,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:39,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:39,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:30:39,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:39,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash -31956692, now seen corresponding path program 1 times [2025-03-08 05:30:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91998008] [2025-03-08 05:30:39,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:39,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:39,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:30:39,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:30:39,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:39,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 05:30:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:39,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91998008] [2025-03-08 05:30:39,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91998008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:39,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:39,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411512003] [2025-03-08 05:30:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:39,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:39,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:39,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:39,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:39,100 INFO L87 Difference]: Start difference. First operand 1310 states and 2221 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:39,183 INFO L93 Difference]: Finished difference Result 3157 states and 5389 transitions. [2025-03-08 05:30:39,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:39,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 156 [2025-03-08 05:30:39,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:39,195 INFO L225 Difference]: With dead ends: 3157 [2025-03-08 05:30:39,196 INFO L226 Difference]: Without dead ends: 1975 [2025-03-08 05:30:39,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:39,201 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 137 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:39,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1192 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-03-08 05:30:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1967. [2025-03-08 05:30:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1585 states have (on average 1.6555205047318613) internal successors, (2624), 1591 states have internal predecessors, (2624), 353 states have call successors, (353), 26 states have call predecessors, (353), 28 states have return successors, (384), 351 states have call predecessors, (384), 352 states have call successors, (384) [2025-03-08 05:30:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 3361 transitions. [2025-03-08 05:30:39,293 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 3361 transitions. Word has length 156 [2025-03-08 05:30:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:39,293 INFO L471 AbstractCegarLoop]: Abstraction has 1967 states and 3361 transitions. [2025-03-08 05:30:39,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 3361 transitions. [2025-03-08 05:30:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:30:39,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:39,304 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:39,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:30:39,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:39,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1694540894, now seen corresponding path program 1 times [2025-03-08 05:30:39,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:39,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190432670] [2025-03-08 05:30:39,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:39,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:39,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:30:39,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:30:39,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:39,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:30:39,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:39,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190432670] [2025-03-08 05:30:39,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190432670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:39,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:39,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:39,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474555424] [2025-03-08 05:30:39,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:39,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:39,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:39,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:39,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:39,366 INFO L87 Difference]: Start difference. First operand 1967 states and 3361 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:39,448 INFO L93 Difference]: Finished difference Result 4696 states and 8088 transitions. [2025-03-08 05:30:39,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:39,449 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-03-08 05:30:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:39,466 INFO L225 Difference]: With dead ends: 4696 [2025-03-08 05:30:39,466 INFO L226 Difference]: Without dead ends: 2985 [2025-03-08 05:30:39,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:39,474 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 135 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:39,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1181 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2025-03-08 05:30:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2977. [2025-03-08 05:30:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2433 states have (on average 1.6642005754212905) internal successors, (4049), 2439 states have internal predecessors, (4049), 515 states have call successors, (515), 26 states have call predecessors, (515), 28 states have return successors, (562), 513 states have call predecessors, (562), 514 states have call successors, (562) [2025-03-08 05:30:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 5126 transitions. [2025-03-08 05:30:39,627 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 5126 transitions. Word has length 138 [2025-03-08 05:30:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:39,628 INFO L471 AbstractCegarLoop]: Abstraction has 2977 states and 5126 transitions. [2025-03-08 05:30:39,628 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 5126 transitions. [2025-03-08 05:30:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:30:39,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:39,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:39,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:30:39,644 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:39,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1835501368, now seen corresponding path program 1 times [2025-03-08 05:30:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:39,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407692364] [2025-03-08 05:30:39,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:39,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:39,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:30:39,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:30:39,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:39,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:30:39,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:39,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407692364] [2025-03-08 05:30:39,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407692364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:39,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:39,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:39,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717505477] [2025-03-08 05:30:39,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:39,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:39,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:39,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:39,697 INFO L87 Difference]: Start difference. First operand 2977 states and 5126 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:39,815 INFO L93 Difference]: Finished difference Result 7133 states and 12369 transitions. [2025-03-08 05:30:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:39,816 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2025-03-08 05:30:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:39,842 INFO L225 Difference]: With dead ends: 7133 [2025-03-08 05:30:39,842 INFO L226 Difference]: Without dead ends: 4620 [2025-03-08 05:30:39,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:39,853 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 133 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:39,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1181 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:39,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2025-03-08 05:30:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 4612. [2025-03-08 05:30:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 3823 states have (on average 1.670415903740518) internal successors, (6386), 3829 states have internal predecessors, (6386), 760 states have call successors, (760), 26 states have call predecessors, (760), 28 states have return successors, (833), 758 states have call predecessors, (833), 759 states have call successors, (833) [2025-03-08 05:30:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 7979 transitions. [2025-03-08 05:30:40,129 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 7979 transitions. Word has length 139 [2025-03-08 05:30:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:40,129 INFO L471 AbstractCegarLoop]: Abstraction has 4612 states and 7979 transitions. [2025-03-08 05:30:40,130 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 7979 transitions. [2025-03-08 05:30:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 05:30:40,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:40,149 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:40,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:30:40,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:40,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1434315438, now seen corresponding path program 1 times [2025-03-08 05:30:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159460728] [2025-03-08 05:30:40,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:40,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 05:30:40,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 05:30:40,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:40,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 05:30:40,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159460728] [2025-03-08 05:30:40,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159460728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:40,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:40,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:40,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412238499] [2025-03-08 05:30:40,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:40,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:40,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:40,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:40,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:40,202 INFO L87 Difference]: Start difference. First operand 4612 states and 7979 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:40,376 INFO L93 Difference]: Finished difference Result 11201 states and 19513 transitions. [2025-03-08 05:30:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:40,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 159 [2025-03-08 05:30:40,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:40,425 INFO L225 Difference]: With dead ends: 11201 [2025-03-08 05:30:40,425 INFO L226 Difference]: Without dead ends: 7369 [2025-03-08 05:30:40,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:40,440 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 131 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:40,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1189 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7369 states. [2025-03-08 05:30:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7369 to 7361. [2025-03-08 05:30:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7361 states, 6079 states have (on average 1.6698470143115645) internal successors, (10151), 6085 states have internal predecessors, (10151), 1253 states have call successors, (1253), 26 states have call predecessors, (1253), 28 states have return successors, (1370), 1251 states have call predecessors, (1370), 1252 states have call successors, (1370) [2025-03-08 05:30:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7361 states to 7361 states and 12774 transitions. [2025-03-08 05:30:40,800 INFO L78 Accepts]: Start accepts. Automaton has 7361 states and 12774 transitions. Word has length 159 [2025-03-08 05:30:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:40,800 INFO L471 AbstractCegarLoop]: Abstraction has 7361 states and 12774 transitions. [2025-03-08 05:30:40,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 7361 states and 12774 transitions. [2025-03-08 05:30:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:30:40,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:40,830 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:40,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:30:40,830 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:40,831 INFO L85 PathProgramCache]: Analyzing trace with hash -701996759, now seen corresponding path program 1 times [2025-03-08 05:30:40,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:40,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482107142] [2025-03-08 05:30:40,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:40,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:40,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:30:40,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:30:40,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:30:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:40,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482107142] [2025-03-08 05:30:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482107142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:40,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:40,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475342447] [2025-03-08 05:30:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:40,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:40,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:40,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:40,883 INFO L87 Difference]: Start difference. First operand 7361 states and 12774 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:41,190 INFO L93 Difference]: Finished difference Result 18578 states and 32440 transitions. [2025-03-08 05:30:41,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:41,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 141 [2025-03-08 05:30:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:41,245 INFO L225 Difference]: With dead ends: 18578 [2025-03-08 05:30:41,245 INFO L226 Difference]: Without dead ends: 12377 [2025-03-08 05:30:41,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:41,311 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 129 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:41,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1186 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12377 states. [2025-03-08 05:30:41,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12377 to 12369. [2025-03-08 05:30:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12369 states, 10265 states have (on average 1.6705309303458353) internal successors, (17148), 10271 states have internal predecessors, (17148), 2075 states have call successors, (2075), 26 states have call predecessors, (2075), 28 states have return successors, (2270), 2073 states have call predecessors, (2270), 2074 states have call successors, (2270) [2025-03-08 05:30:41,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12369 states to 12369 states and 21493 transitions. [2025-03-08 05:30:41,916 INFO L78 Accepts]: Start accepts. Automaton has 12369 states and 21493 transitions. Word has length 141 [2025-03-08 05:30:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:41,916 INFO L471 AbstractCegarLoop]: Abstraction has 12369 states and 21493 transitions. [2025-03-08 05:30:41,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 12369 states and 21493 transitions. [2025-03-08 05:30:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 05:30:41,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:41,956 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:41,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:30:41,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:41,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash -636909952, now seen corresponding path program 1 times [2025-03-08 05:30:41,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:41,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328579609] [2025-03-08 05:30:41,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:41,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:41,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 05:30:41,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 05:30:41,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:41,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 05:30:42,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328579609] [2025-03-08 05:30:42,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328579609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:42,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:42,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:42,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737581851] [2025-03-08 05:30:42,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:42,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:42,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:42,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:42,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:42,026 INFO L87 Difference]: Start difference. First operand 12369 states and 21493 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:42,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:42,462 INFO L93 Difference]: Finished difference Result 29621 states and 51419 transitions. [2025-03-08 05:30:42,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:42,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 142 [2025-03-08 05:30:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:42,536 INFO L225 Difference]: With dead ends: 29621 [2025-03-08 05:30:42,536 INFO L226 Difference]: Without dead ends: 19387 [2025-03-08 05:30:42,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:42,576 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 127 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:42,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1166 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19387 states. [2025-03-08 05:30:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19387 to 19379. [2025-03-08 05:30:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19379 states, 16072 states have (on average 1.6482702837232455) internal successors, (26491), 16078 states have internal predecessors, (26491), 3278 states have call successors, (3278), 26 states have call predecessors, (3278), 28 states have return successors, (3617), 3276 states have call predecessors, (3617), 3277 states have call successors, (3617) [2025-03-08 05:30:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19379 states to 19379 states and 33386 transitions. [2025-03-08 05:30:43,334 INFO L78 Accepts]: Start accepts. Automaton has 19379 states and 33386 transitions. Word has length 142 [2025-03-08 05:30:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:43,335 INFO L471 AbstractCegarLoop]: Abstraction has 19379 states and 33386 transitions. [2025-03-08 05:30:43,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 19379 states and 33386 transitions. [2025-03-08 05:30:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 05:30:43,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:43,373 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:43,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:30:43,373 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:43,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:43,374 INFO L85 PathProgramCache]: Analyzing trace with hash 746733993, now seen corresponding path program 1 times [2025-03-08 05:30:43,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:43,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962374409] [2025-03-08 05:30:43,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:43,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:43,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 05:30:43,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 05:30:43,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:43,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 05:30:43,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962374409] [2025-03-08 05:30:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962374409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:43,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:43,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817705229] [2025-03-08 05:30:43,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:43,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:43,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:43,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:43,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:43,519 INFO L87 Difference]: Start difference. First operand 19379 states and 33386 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:44,276 INFO L93 Difference]: Finished difference Result 51228 states and 88578 transitions. [2025-03-08 05:30:44,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:44,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 162 [2025-03-08 05:30:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:44,406 INFO L225 Difference]: With dead ends: 51228 [2025-03-08 05:30:44,406 INFO L226 Difference]: Without dead ends: 34624 [2025-03-08 05:30:44,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:44,465 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 125 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:44,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1184 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34624 states. [2025-03-08 05:30:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34624 to 34616. [2025-03-08 05:30:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34616 states, 28859 states have (on average 1.6453792577705395) internal successors, (47484), 28865 states have internal predecessors, (47484), 5728 states have call successors, (5728), 26 states have call predecessors, (5728), 28 states have return successors, (6341), 5726 states have call predecessors, (6341), 5727 states have call successors, (6341) [2025-03-08 05:30:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34616 states to 34616 states and 59553 transitions. [2025-03-08 05:30:45,854 INFO L78 Accepts]: Start accepts. Automaton has 34616 states and 59553 transitions. Word has length 162 [2025-03-08 05:30:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:45,855 INFO L471 AbstractCegarLoop]: Abstraction has 34616 states and 59553 transitions. [2025-03-08 05:30:45,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 34616 states and 59553 transitions. [2025-03-08 05:30:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 05:30:45,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:45,905 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:45,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:30:45,906 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:45,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:45,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1121165428, now seen corresponding path program 1 times [2025-03-08 05:30:45,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:45,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604050227] [2025-03-08 05:30:45,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:45,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:45,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 05:30:45,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 05:30:45,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:45,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 05:30:45,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604050227] [2025-03-08 05:30:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604050227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:45,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:45,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:45,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926852452] [2025-03-08 05:30:45,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:45,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:45,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:45,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:45,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:45,962 INFO L87 Difference]: Start difference. First operand 34616 states and 59553 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:47,250 INFO L93 Difference]: Finished difference Result 94460 states and 162990 transitions. [2025-03-08 05:30:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:47,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2025-03-08 05:30:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:47,569 INFO L225 Difference]: With dead ends: 94460 [2025-03-08 05:30:47,569 INFO L226 Difference]: Without dead ends: 63529 [2025-03-08 05:30:47,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:47,658 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 123 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:47,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1194 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63529 states. [2025-03-08 05:30:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63529 to 63521. [2025-03-08 05:30:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63521 states, 53251 states have (on average 1.6413776267112354) internal successors, (87405), 53257 states have internal predecessors, (87405), 10241 states have call successors, (10241), 26 states have call predecessors, (10241), 28 states have return successors, (11386), 10239 states have call predecessors, (11386), 10240 states have call successors, (11386) [2025-03-08 05:30:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63521 states to 63521 states and 109032 transitions. [2025-03-08 05:30:50,328 INFO L78 Accepts]: Start accepts. Automaton has 63521 states and 109032 transitions. Word has length 163 [2025-03-08 05:30:50,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:50,328 INFO L471 AbstractCegarLoop]: Abstraction has 63521 states and 109032 transitions. [2025-03-08 05:30:50,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 63521 states and 109032 transitions. [2025-03-08 05:30:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 05:30:50,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:50,398 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:50,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:30:50,399 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:50,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:50,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1826075768, now seen corresponding path program 1 times [2025-03-08 05:30:50,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:50,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746588676] [2025-03-08 05:30:50,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:50,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:50,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-08 05:30:50,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-08 05:30:50,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:50,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 05:30:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746588676] [2025-03-08 05:30:50,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746588676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:50,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:50,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714374330] [2025-03-08 05:30:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:50,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:50,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:50,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:50,475 INFO L87 Difference]: Start difference. First operand 63521 states and 109032 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:52,409 INFO L93 Difference]: Finished difference Result 119092 states and 204825 transitions. [2025-03-08 05:30:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:52,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 164 [2025-03-08 05:30:52,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:52,996 INFO L225 Difference]: With dead ends: 119092 [2025-03-08 05:30:52,997 INFO L226 Difference]: Without dead ends: 118896 [2025-03-08 05:30:53,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:53,098 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 118 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:53,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1190 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118896 states. [2025-03-08 05:30:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118896 to 118888. [2025-03-08 05:30:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118888 states, 100250 states have (on average 1.6362693266832917) internal successors, (164036), 100256 states have internal predecessors, (164036), 18609 states have call successors, (18609), 26 states have call predecessors, (18609), 28 states have return successors, (20800), 18607 states have call predecessors, (20800), 18608 states have call successors, (20800) [2025-03-08 05:30:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118888 states to 118888 states and 203445 transitions. [2025-03-08 05:30:57,609 INFO L78 Accepts]: Start accepts. Automaton has 118888 states and 203445 transitions. Word has length 164 [2025-03-08 05:30:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:57,609 INFO L471 AbstractCegarLoop]: Abstraction has 118888 states and 203445 transitions. [2025-03-08 05:30:57,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:30:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 118888 states and 203445 transitions. [2025-03-08 05:30:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:30:57,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:57,683 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:30:57,683 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:57,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1111671166, now seen corresponding path program 1 times [2025-03-08 05:30:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500208603] [2025-03-08 05:30:57,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:57,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:57,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:30:57,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:30:57,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:57,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 05:30:57,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:57,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500208603] [2025-03-08 05:30:57,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500208603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:57,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083844379] [2025-03-08 05:30:57,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:57,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:57,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:57,948 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-08 05:30:57,949 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-08 05:30:58,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:30:58,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:30:58,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:58,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:58,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 05:30:58,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:30:58,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:58,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083844379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:58,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:58,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-03-08 05:30:58,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526988955] [2025-03-08 05:30:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:58,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:30:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:58,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:30:58,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:30:58,637 INFO L87 Difference]: Start difference. First operand 118888 states and 203445 transitions. Second operand has 12 states, 11 states have (on average 9.909090909090908) internal successors, (109), 9 states have internal predecessors, (109), 5 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-08 05:31:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:31:04,341 INFO L93 Difference]: Finished difference Result 236880 states and 410821 transitions. [2025-03-08 05:31:04,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:31:04,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.909090909090908) internal successors, (109), 9 states have internal predecessors, (109), 5 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 146 [2025-03-08 05:31:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:31:05,752 INFO L225 Difference]: With dead ends: 236880 [2025-03-08 05:31:05,752 INFO L226 Difference]: Without dead ends: 236692 [2025-03-08 05:31:05,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 05:31:05,855 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 1363 mSDsluCounter, 4580 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 5297 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:31:05,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 5297 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 05:31:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236692 states.