./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product27.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product27.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f7652bf269245a8144605490a4a891295a82bf8357d2cf3971e290586b4e5c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:42:57,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:42:57,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:42:57,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:42:57,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:42:57,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:42:57,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:42:57,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:42:57,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:42:57,276 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:42:57,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:42:57,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:42:57,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:42:57,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:42:57,276 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:42:57,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:42:57,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:42:57,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:42:57,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:42:57,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:42:57,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:42:57,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:42:57,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:42:57,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:42:57,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:42:57,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:42:57,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:42:57,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:42:57,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:42:57,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:42:57,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:42:57,283 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f7652bf269245a8144605490a4a891295a82bf8357d2cf3971e290586b4e5c1 [2025-02-05 15:42:57,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:42:57,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:42:57,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:42:57,545 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:42:57,545 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:42:57,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product27.cil.c [2025-02-05 15:42:58,768 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7acc35654/26ce3c8470184eefa4ba5059875363ef/FLAG3cc016486 [2025-02-05 15:42:59,179 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:42:59,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product27.cil.c [2025-02-05 15:42:59,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7acc35654/26ce3c8470184eefa4ba5059875363ef/FLAG3cc016486 [2025-02-05 15:42:59,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7acc35654/26ce3c8470184eefa4ba5059875363ef [2025-02-05 15:42:59,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:42:59,344 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:42:59,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:42:59,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:42:59,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:42:59,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:42:59,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f33b49f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59, skipping insertion in model container [2025-02-05 15:42:59,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:42:59,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:42:59,793 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product27.cil.c[57688,57701] [2025-02-05 15:42:59,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:42:59,839 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:42:59,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-02-05 15:42:59,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [167] [2025-02-05 15:42:59,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [533] [2025-02-05 15:42:59,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [937] [2025-02-05 15:42:59,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1170] [2025-02-05 15:42:59,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2250] [2025-02-05 15:42:59,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2558] [2025-02-05 15:42:59,848 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2593] [2025-02-05 15:42:59,848 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2602] [2025-02-05 15:42:59,848 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2633] [2025-02-05 15:42:59,849 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2650] [2025-02-05 15:42:59,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product27.cil.c[57688,57701] [2025-02-05 15:42:59,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:42:59,985 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:42:59,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59 WrapperNode [2025-02-05 15:42:59,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:42:59,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:42:59,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:42:59,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:42:59,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,083 INFO L138 Inliner]: procedures = 133, calls = 209, calls flagged for inlining = 63, calls inlined = 60, statements flattened = 1080 [2025-02-05 15:43:00,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:43:00,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:43:00,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:43:00,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:43:00,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,101 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,137 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:43:00,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:43:00,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:43:00,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:43:00,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:43:00,189 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (1/1) ... [2025-02-05 15:43:00,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:43:00,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:00,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:43:00,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:43:00,245 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:43:00,246 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:43:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:43:00,246 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:43:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:43:00,246 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:43:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:43:00,246 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:43:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:43:00,247 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:43:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:43:00,247 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:43:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:43:00,247 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:43:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:43:00,247 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:43:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:43:00,247 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:43:00,248 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:43:00,248 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:43:00,248 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:43:00,248 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:43:00,248 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:43:00,248 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:43:00,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:43:00,248 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:43:00,248 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:43:00,248 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:43:00,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:43:00,249 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:43:00,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:43:00,249 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:43:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:43:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-02-05 15:43:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:43:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:43:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:43:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:43:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:43:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:43:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:43:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:43:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:43:00,431 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:43:00,433 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:43:00,533 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1792-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~26#1; [2025-02-05 15:43:00,542 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L844: #res := ~retValue_acc~14; [2025-02-05 15:43:00,555 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L918: #res := ~retValue_acc~16; [2025-02-05 15:43:00,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884: #res#1 := ~retValue_acc~28#1; [2025-02-05 15:43:00,596 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1839-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~27#1; [2025-02-05 15:43:00,634 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2108: #res := ~retValue_acc~31; [2025-02-05 15:43:00,648 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L164-1: createEmail_#res#1 := createEmail_~retValue_acc~2#1; [2025-02-05 15:43:00,661 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1336: #res := ~retValue_acc~20; [2025-02-05 15:43:00,695 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L881: #res := ~retValue_acc~15; [2025-02-05 15:43:00,723 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: #res := ~retValue_acc~9; [2025-02-05 15:43:00,777 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1662: #res := ~retValue_acc~24; [2025-02-05 15:43:00,927 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1745-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~25#1; [2025-02-05 15:43:00,927 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L581-1: getEmailId_#res#1 := getEmailId_~retValue_acc~7#1; [2025-02-05 15:43:00,927 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2227-1: getClientId_#res#1 := getClientId_~retValue_acc~33#1; [2025-02-05 15:43:00,927 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2898-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2025-02-05 15:43:00,927 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2180-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~32#1; [2025-02-05 15:43:01,125 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2054-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~30#1; [2025-02-05 15:43:01,125 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2864-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-02-05 15:43:01,125 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590-1: valid_product_#res#1 := valid_product_~retValue_acc~36#1; [2025-02-05 15:43:01,125 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2855-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-02-05 15:43:01,125 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~29#1; [2025-02-05 15:43:01,125 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2873-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-02-05 15:43:01,130 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L618: #res := ~retValue_acc~8; [2025-02-05 15:43:01,132 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: #res := ~retValue_acc~0; [2025-02-05 15:43:01,241 INFO L? ?]: Removed 561 outVars from TransFormulas that were not future-live. [2025-02-05 15:43:01,241 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:43:01,252 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:43:01,252 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:43:01,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:43:01 BoogieIcfgContainer [2025-02-05 15:43:01,252 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:43:01,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:43:01,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:43:01,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:43:01,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:42:59" (1/3) ... [2025-02-05 15:43:01,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dd2808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:43:01, skipping insertion in model container [2025-02-05 15:43:01,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:42:59" (2/3) ... [2025-02-05 15:43:01,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dd2808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:43:01, skipping insertion in model container [2025-02-05 15:43:01,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:43:01" (3/3) ... [2025-02-05 15:43:01,261 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product27.cil.c [2025-02-05 15:43:01,271 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:43:01,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product27.cil.c that has 25 procedures, 410 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:43:01,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:43:01,325 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;@7e4a6b9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:43:01,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:43:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 322 states have (on average 1.5559006211180124) internal successors, (501), 325 states have internal predecessors, (501), 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-02-05 15:43:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 15:43:01,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:01,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:01,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:01,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:01,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1868729897, now seen corresponding path program 1 times [2025-02-05 15:43:01,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:01,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367064809] [2025-02-05 15:43:01,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:01,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:01,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:43:01,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:43:01,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:01,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:01,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:01,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367064809] [2025-02-05 15:43:01,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367064809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:01,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775662421] [2025-02-05 15:43:01,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:01,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:01,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:01,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:43:01,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:43:02,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 15:43:02,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 15:43:02,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:02,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:02,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:43:02,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:43:02,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775662421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:02,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:02,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:43:02,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787202676] [2025-02-05 15:43:02,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:02,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:43:02,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:02,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:43:02,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:02,369 INFO L87 Difference]: Start difference. First operand has 410 states, 322 states have (on average 1.5559006211180124) internal successors, (501), 325 states have internal predecessors, (501), 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 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:43:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:02,435 INFO L93 Difference]: Finished difference Result 623 states and 934 transitions. [2025-02-05 15:43:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:43:02,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-02-05 15:43:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:02,452 INFO L225 Difference]: With dead ends: 623 [2025-02-05 15:43:02,453 INFO L226 Difference]: Without dead ends: 403 [2025-02-05 15:43:02,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:02,463 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:02,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:02,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-05 15:43:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-02-05 15:43:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 316 states have (on average 1.5537974683544304) internal successors, (491), 318 states have internal predecessors, (491), 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-02-05 15:43:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 614 transitions. [2025-02-05 15:43:02,535 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 614 transitions. Word has length 136 [2025-02-05 15:43:02,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:02,539 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 614 transitions. [2025-02-05 15:43:02,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:43:02,539 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 614 transitions. [2025-02-05 15:43:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:43:02,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:02,545 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:02,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:43:02,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:43:02,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:02,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:02,750 INFO L85 PathProgramCache]: Analyzing trace with hash -769287963, now seen corresponding path program 1 times [2025-02-05 15:43:02,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:02,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919063953] [2025-02-05 15:43:02,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:02,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:43:02,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:43:02,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:02,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:43:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919063953] [2025-02-05 15:43:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919063953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409649552] [2025-02-05 15:43:02,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:02,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:02,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:02,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:43:02,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:43:03,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:43:03,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:43:03,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:03,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:03,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:43:03,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:43:03,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:03,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409649552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:03,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:03,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:43:03,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108474205] [2025-02-05 15:43:03,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:03,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:03,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:03,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:03,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:03,290 INFO L87 Difference]: Start difference. First operand 403 states and 614 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:43:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:03,336 INFO L93 Difference]: Finished difference Result 612 states and 912 transitions. [2025-02-05 15:43:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:03,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 118 [2025-02-05 15:43:03,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:03,343 INFO L225 Difference]: With dead ends: 612 [2025-02-05 15:43:03,345 INFO L226 Difference]: Without dead ends: 405 [2025-02-05 15:43:03,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:03,346 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 0 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:03,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1224 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-05 15:43:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-02-05 15:43:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 318 states have (on average 1.550314465408805) internal successors, (493), 320 states have internal predecessors, (493), 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-02-05 15:43:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 616 transitions. [2025-02-05 15:43:03,377 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 616 transitions. Word has length 118 [2025-02-05 15:43:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:03,378 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 616 transitions. [2025-02-05 15:43:03,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:43:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 616 transitions. [2025-02-05 15:43:03,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:43:03,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:03,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:03,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:43:03,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:03,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:03,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash 505867233, now seen corresponding path program 1 times [2025-02-05 15:43:03,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:03,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765520346] [2025-02-05 15:43:03,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:03,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:43:03,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:43:03,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:03,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:43:03,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:03,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765520346] [2025-02-05 15:43:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765520346] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086695008] [2025-02-05 15:43:03,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:03,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:03,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:03,804 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:43:03,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:43:03,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:43:04,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:43:04,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:04,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:04,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:43:04,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:43:04,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:04,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086695008] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:04,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:04,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:43:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569074384] [2025-02-05 15:43:04,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:04,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:04,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:04,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:04,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:04,071 INFO L87 Difference]: Start difference. First operand 405 states and 616 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:43:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:04,108 INFO L93 Difference]: Finished difference Result 862 states and 1331 transitions. [2025-02-05 15:43:04,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:04,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-02-05 15:43:04,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:04,114 INFO L225 Difference]: With dead ends: 862 [2025-02-05 15:43:04,114 INFO L226 Difference]: Without dead ends: 484 [2025-02-05 15:43:04,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:04,117 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 142 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:04,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1188 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-02-05 15:43:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 476. [2025-02-05 15:43:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 375 states have (on average 1.5706666666666667) internal successors, (589), 377 states have internal predecessors, (589), 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-02-05 15:43:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 740 transitions. [2025-02-05 15:43:04,144 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 740 transitions. Word has length 126 [2025-02-05 15:43:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:04,144 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 740 transitions. [2025-02-05 15:43:04,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:43:04,145 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 740 transitions. [2025-02-05 15:43:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:43:04,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:04,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:04,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:43:04,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:04,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:04,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash 240756853, now seen corresponding path program 1 times [2025-02-05 15:43:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:04,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110509660] [2025-02-05 15:43:04,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:04,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:43:04,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:43:04,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:04,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:43:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:04,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110509660] [2025-02-05 15:43:04,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110509660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:04,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133189457] [2025-02-05 15:43:04,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:04,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:04,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:04,557 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:43:04,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:43:04,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:43:04,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:43:04,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:04,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:04,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:43:04,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:43:04,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:04,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133189457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:04,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:04,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:43:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743393396] [2025-02-05 15:43:04,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:04,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:04,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:04,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:04,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:43:04,863 INFO L87 Difference]: Start difference. First operand 476 states and 740 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:43:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:04,912 INFO L93 Difference]: Finished difference Result 943 states and 1470 transitions. [2025-02-05 15:43:04,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:04,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2025-02-05 15:43:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:04,915 INFO L225 Difference]: With dead ends: 943 [2025-02-05 15:43:04,916 INFO L226 Difference]: Without dead ends: 478 [2025-02-05 15:43:04,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:43:04,918 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 2 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:04,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2413 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-02-05 15:43:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2025-02-05 15:43:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 376 states have (on average 1.5691489361702127) internal successors, (590), 379 states have internal predecessors, (590), 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-02-05 15:43:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 743 transitions. [2025-02-05 15:43:04,932 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 743 transitions. Word has length 146 [2025-02-05 15:43:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:04,933 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 743 transitions. [2025-02-05 15:43:04,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:43:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 743 transitions. [2025-02-05 15:43:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 15:43:04,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:04,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:04,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:43:05,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:05,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:05,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:05,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1505004441, now seen corresponding path program 1 times [2025-02-05 15:43:05,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:05,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196641523] [2025-02-05 15:43:05,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:05,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:05,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:43:05,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:43:05,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:05,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:43:05,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:05,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196641523] [2025-02-05 15:43:05,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196641523] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:05,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030948818] [2025-02-05 15:43:05,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:05,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:05,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:05,288 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:43:05,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:43:05,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 15:43:05,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 15:43:05,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:05,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:05,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:43:05,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:43:05,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:43:05,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030948818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:05,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:43:05,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:43:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129635123] [2025-02-05 15:43:05,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:05,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:05,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:05,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:43:05,580 INFO L87 Difference]: Start difference. First operand 478 states and 743 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:43:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:05,642 INFO L93 Difference]: Finished difference Result 945 states and 1475 transitions. [2025-02-05 15:43:05,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:05,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2025-02-05 15:43:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:05,645 INFO L225 Difference]: With dead ends: 945 [2025-02-05 15:43:05,646 INFO L226 Difference]: Without dead ends: 480 [2025-02-05 15:43:05,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:43:05,648 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 2 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:05,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2399 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:05,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-02-05 15:43:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-02-05 15:43:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 377 states have (on average 1.5676392572944298) internal successors, (591), 381 states have internal predecessors, (591), 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-02-05 15:43:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 749 transitions. [2025-02-05 15:43:05,666 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 749 transitions. Word has length 128 [2025-02-05 15:43:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:05,667 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 749 transitions. [2025-02-05 15:43:05,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:43:05,667 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 749 transitions. [2025-02-05 15:43:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:43:05,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:05,670 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:05,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:43:05,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:05,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:05,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:05,875 INFO L85 PathProgramCache]: Analyzing trace with hash -302804386, now seen corresponding path program 1 times [2025-02-05 15:43:05,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:05,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24520492] [2025-02-05 15:43:05,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:05,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:05,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:43:05,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:43:05,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:05,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:43:06,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:06,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24520492] [2025-02-05 15:43:06,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24520492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:06,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:06,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:43:06,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628465300] [2025-02-05 15:43:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:06,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:06,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:06,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:06,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:06,020 INFO L87 Difference]: Start difference. First operand 480 states and 749 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:43:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:06,057 INFO L93 Difference]: Finished difference Result 937 states and 1466 transitions. [2025-02-05 15:43:06,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:06,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-02-05 15:43:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:06,060 INFO L225 Difference]: With dead ends: 937 [2025-02-05 15:43:06,060 INFO L226 Difference]: Without dead ends: 480 [2025-02-05 15:43:06,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:06,062 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 2 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:06,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2417 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-02-05 15:43:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-02-05 15:43:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 377 states have (on average 1.5676392572944298) internal successors, (591), 381 states have internal predecessors, (591), 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-02-05 15:43:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 748 transitions. [2025-02-05 15:43:06,078 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 748 transitions. Word has length 148 [2025-02-05 15:43:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:06,078 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 748 transitions. [2025-02-05 15:43:06,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:43:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 748 transitions. [2025-02-05 15:43:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:43:06,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:06,081 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:06,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:43:06,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:06,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:06,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1957119423, now seen corresponding path program 2 times [2025-02-05 15:43:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:06,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498472041] [2025-02-05 15:43:06,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:43:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:06,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-02-05 15:43:06,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 66 of 149 statements. [2025-02-05 15:43:06,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:43:06,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-05 15:43:06,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:06,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498472041] [2025-02-05 15:43:06,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498472041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:06,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:06,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:43:06,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838878006] [2025-02-05 15:43:06,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:06,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:06,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:06,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:06,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:06,158 INFO L87 Difference]: Start difference. First operand 480 states and 748 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:43:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:06,181 INFO L93 Difference]: Finished difference Result 679 states and 1036 transitions. [2025-02-05 15:43:06,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:06,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2025-02-05 15:43:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:06,184 INFO L225 Difference]: With dead ends: 679 [2025-02-05 15:43:06,184 INFO L226 Difference]: Without dead ends: 480 [2025-02-05 15:43:06,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:06,186 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 0 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:06,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2437 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-02-05 15:43:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-02-05 15:43:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 377 states have (on average 1.5649867374005304) internal successors, (590), 381 states have internal predecessors, (590), 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-02-05 15:43:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 747 transitions. [2025-02-05 15:43:06,227 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 747 transitions. Word has length 149 [2025-02-05 15:43:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:06,227 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 747 transitions. [2025-02-05 15:43:06,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:43:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 747 transitions. [2025-02-05 15:43:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:43:06,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:06,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:06,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:43:06,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:06,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash -127976640, now seen corresponding path program 1 times [2025-02-05 15:43:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:06,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87642717] [2025-02-05 15:43:06,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:06,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:43:06,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:43:06,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:06,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:43:06,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:06,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87642717] [2025-02-05 15:43:06,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87642717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:06,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:06,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:43:06,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113035976] [2025-02-05 15:43:06,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:06,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:43:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:06,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:43:06,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:06,347 INFO L87 Difference]: Start difference. First operand 480 states and 747 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:43:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:06,385 INFO L93 Difference]: Finished difference Result 939 states and 1467 transitions. [2025-02-05 15:43:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:43:06,385 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 137 [2025-02-05 15:43:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:06,388 INFO L225 Difference]: With dead ends: 939 [2025-02-05 15:43:06,388 INFO L226 Difference]: Without dead ends: 482 [2025-02-05 15:43:06,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:43:06,390 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 1 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:06,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2416 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-05 15:43:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2025-02-05 15:43:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 378 states have (on average 1.5634920634920635) internal successors, (591), 383 states have internal predecessors, (591), 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-02-05 15:43:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 750 transitions. [2025-02-05 15:43:06,406 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 750 transitions. Word has length 137 [2025-02-05 15:43:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:06,406 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 750 transitions. [2025-02-05 15:43:06,406 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-02-05 15:43:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 750 transitions. [2025-02-05 15:43:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 15:43:06,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:06,408 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:06,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:43:06,409 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:06,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:06,409 INFO L85 PathProgramCache]: Analyzing trace with hash -853775561, now seen corresponding path program 1 times [2025-02-05 15:43:06,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:06,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486278260] [2025-02-05 15:43:06,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:06,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:06,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 15:43:06,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 15:43:06,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:06,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 15:43:06,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:06,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486278260] [2025-02-05 15:43:06,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486278260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:06,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:06,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:43:06,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26233554] [2025-02-05 15:43:06,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:06,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:43:06,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:06,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:43:06,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:43:06,583 INFO L87 Difference]: Start difference. First operand 482 states and 750 transitions. Second operand has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 15:43:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:06,699 INFO L93 Difference]: Finished difference Result 941 states and 1466 transitions. [2025-02-05 15:43:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:43:06,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 157 [2025-02-05 15:43:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:06,703 INFO L225 Difference]: With dead ends: 941 [2025-02-05 15:43:06,703 INFO L226 Difference]: Without dead ends: 484 [2025-02-05 15:43:06,705 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-02-05 15:43:06,705 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 7 mSDsluCounter, 3553 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4150 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-02-05 15:43:06,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4150 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-02-05 15:43:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-02-05 15:43:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 380 states have (on average 1.5605263157894738) internal successors, (593), 384 states have internal predecessors, (593), 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-02-05 15:43:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 751 transitions. [2025-02-05 15:43:06,723 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 751 transitions. Word has length 157 [2025-02-05 15:43:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:06,724 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 751 transitions. [2025-02-05 15:43:06,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-02-05 15:43:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 751 transitions. [2025-02-05 15:43:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:43:06,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:06,726 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:06,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:43:06,727 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:06,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:06,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1292315032, now seen corresponding path program 1 times [2025-02-05 15:43:06,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:06,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455204105] [2025-02-05 15:43:06,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:06,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:06,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:43:06,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:43:06,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:06,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:43:06,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:06,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455204105] [2025-02-05 15:43:06,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455204105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:06,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:06,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:43:06,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945951809] [2025-02-05 15:43:06,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:06,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:43:06,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:06,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:43:06,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:43:06,866 INFO L87 Difference]: Start difference. First operand 484 states and 751 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:43:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:06,983 INFO L93 Difference]: Finished difference Result 944 states and 1473 transitions. [2025-02-05 15:43:06,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:43:06,984 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 139 [2025-02-05 15:43:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:06,987 INFO L225 Difference]: With dead ends: 944 [2025-02-05 15:43:06,987 INFO L226 Difference]: Without dead ends: 487 [2025-02-05 15:43:06,988 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-02-05 15:43:06,988 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 5 mSDsluCounter, 3565 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4164 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-02-05 15:43:06,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4164 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:43:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-02-05 15:43:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2025-02-05 15:43:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 382 states have (on average 1.557591623036649) internal successors, (595), 387 states have internal predecessors, (595), 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-02-05 15:43:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 758 transitions. [2025-02-05 15:43:07,003 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 758 transitions. Word has length 139 [2025-02-05 15:43:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:07,003 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 758 transitions. [2025-02-05 15:43:07,004 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, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:43:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 758 transitions. [2025-02-05 15:43:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 15:43:07,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:07,006 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:07,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:43:07,006 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:07,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1976341178, now seen corresponding path program 1 times [2025-02-05 15:43:07,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:07,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790086431] [2025-02-05 15:43:07,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:07,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:07,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 15:43:07,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 15:43:07,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:07,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:43:07,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790086431] [2025-02-05 15:43:07,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790086431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:43:07,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643102618] [2025-02-05 15:43:07,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:07,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:43:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:43:07,198 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:43:07,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:43:07,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 15:43:07,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 15:43:07,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:07,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:07,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:43:07,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:43:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:43:07,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:43:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:43:07,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643102618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:43:07,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:43:07,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:43:07,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68425383] [2025-02-05 15:43:07,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:43:07,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:43:07,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:07,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:43:07,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:43:07,707 INFO L87 Difference]: Start difference. First operand 487 states and 758 transitions. Second operand has 11 states, 10 states have (on average 16.3) internal successors, (163), 11 states have internal predecessors, (163), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-05 15:43:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:08,328 INFO L93 Difference]: Finished difference Result 1406 states and 2283 transitions. [2025-02-05 15:43:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:43:08,329 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.3) internal successors, (163), 11 states have internal predecessors, (163), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) Word has length 159 [2025-02-05 15:43:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:08,334 INFO L225 Difference]: With dead ends: 1406 [2025-02-05 15:43:08,334 INFO L226 Difference]: Without dead ends: 951 [2025-02-05 15:43:08,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:43:08,336 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 1377 mSDsluCounter, 4626 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 5221 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:08,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 5221 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:43:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-02-05 15:43:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 927. [2025-02-05 15:43:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 743 states have (on average 1.6123822341857335) internal successors, (1198), 747 states have internal predecessors, (1198), 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-02-05 15:43:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1529 transitions. [2025-02-05 15:43:08,371 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1529 transitions. Word has length 159 [2025-02-05 15:43:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:08,373 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1529 transitions. [2025-02-05 15:43:08,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.3) internal successors, (163), 11 states have internal predecessors, (163), 4 states have call successors, (39), 2 states have call predecessors, (39), 3 states have return successors, (36), 3 states have call predecessors, (36), 4 states have call successors, (36) [2025-02-05 15:43:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1529 transitions. [2025-02-05 15:43:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 15:43:08,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:08,378 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:08,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:43:08,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:43:08,579 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:08,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1321558075, now seen corresponding path program 1 times [2025-02-05 15:43:08,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:08,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324467792] [2025-02-05 15:43:08,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:08,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:08,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:43:08,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:43:08,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:08,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324467792] [2025-02-05 15:43:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324467792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:08,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794607782] [2025-02-05 15:43:08,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:08,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:08,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:08,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:08,640 INFO L87 Difference]: Start difference. First operand 927 states and 1529 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:08,681 INFO L93 Difference]: Finished difference Result 2191 states and 3673 transitions. [2025-02-05 15:43:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:08,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-02-05 15:43:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:08,689 INFO L225 Difference]: With dead ends: 2191 [2025-02-05 15:43:08,689 INFO L226 Difference]: Without dead ends: 1345 [2025-02-05 15:43:08,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:08,693 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 139 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:08,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1226 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-02-05 15:43:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1337. [2025-02-05 15:43:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1074 states have (on average 1.632216014897579) internal successors, (1753), 1078 states have internal predecessors, (1753), 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-02-05 15:43:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2252 transitions. [2025-02-05 15:43:08,745 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2252 transitions. Word has length 143 [2025-02-05 15:43:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:08,745 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 2252 transitions. [2025-02-05 15:43:08,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2252 transitions. [2025-02-05 15:43:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 15:43:08,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:08,752 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:43:08,752 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:08,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash -171458430, now seen corresponding path program 1 times [2025-02-05 15:43:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:08,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712973223] [2025-02-05 15:43:08,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:08,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 15:43:08,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 15:43:08,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:08,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:43:08,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:08,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712973223] [2025-02-05 15:43:08,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712973223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:08,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:08,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:08,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123862654] [2025-02-05 15:43:08,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:08,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:08,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:08,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:08,801 INFO L87 Difference]: Start difference. First operand 1337 states and 2252 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:08,884 INFO L93 Difference]: Finished difference Result 3219 states and 5459 transitions. [2025-02-05 15:43:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:08,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 163 [2025-02-05 15:43:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:08,894 INFO L225 Difference]: With dead ends: 3219 [2025-02-05 15:43:08,894 INFO L226 Difference]: Without dead ends: 2014 [2025-02-05 15:43:08,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:08,898 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 137 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:08,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1218 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2025-02-05 15:43:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2006. [2025-02-05 15:43:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 1624 states have (on average 1.6422413793103448) internal successors, (2667), 1628 states have internal predecessors, (2667), 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-02-05 15:43:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 3404 transitions. [2025-02-05 15:43:08,976 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 3404 transitions. Word has length 163 [2025-02-05 15:43:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:08,976 INFO L471 AbstractCegarLoop]: Abstraction has 2006 states and 3404 transitions. [2025-02-05 15:43:08,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 3404 transitions. [2025-02-05 15:43:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:43:08,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:08,986 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:08,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:43:08,986 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:08,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:08,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1502688452, now seen corresponding path program 1 times [2025-02-05 15:43:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:08,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946281264] [2025-02-05 15:43:08,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:09,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:43:09,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:43:09,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:09,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:09,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:09,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946281264] [2025-02-05 15:43:09,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946281264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:09,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:09,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:09,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707659406] [2025-02-05 15:43:09,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:09,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:09,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:09,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:09,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:09,038 INFO L87 Difference]: Start difference. First operand 2006 states and 3404 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:09,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:09,112 INFO L93 Difference]: Finished difference Result 4786 states and 8186 transitions. [2025-02-05 15:43:09,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:09,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-02-05 15:43:09,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:09,127 INFO L225 Difference]: With dead ends: 4786 [2025-02-05 15:43:09,128 INFO L226 Difference]: Without dead ends: 3044 [2025-02-05 15:43:09,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:09,135 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 135 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:09,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1213 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2025-02-05 15:43:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3036. [2025-02-05 15:43:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 2492 states have (on average 1.6500802568218298) internal successors, (4112), 2496 states have internal predecessors, (4112), 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-02-05 15:43:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 5189 transitions. [2025-02-05 15:43:09,317 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 5189 transitions. Word has length 145 [2025-02-05 15:43:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:09,318 INFO L471 AbstractCegarLoop]: Abstraction has 3036 states and 5189 transitions. [2025-02-05 15:43:09,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 5189 transitions. [2025-02-05 15:43:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:43:09,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:09,332 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:09,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:43:09,333 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:09,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:09,333 INFO L85 PathProgramCache]: Analyzing trace with hash 391619026, now seen corresponding path program 1 times [2025-02-05 15:43:09,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:09,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676011243] [2025-02-05 15:43:09,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:09,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:09,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:43:09,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:43:09,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:09,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:09,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:09,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676011243] [2025-02-05 15:43:09,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676011243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:09,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:09,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:09,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240965137] [2025-02-05 15:43:09,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:09,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:09,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:09,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:09,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:09,392 INFO L87 Difference]: Start difference. First operand 3036 states and 5189 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:09,526 INFO L93 Difference]: Finished difference Result 7269 states and 12513 transitions. [2025-02-05 15:43:09,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:09,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-02-05 15:43:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:09,550 INFO L225 Difference]: With dead ends: 7269 [2025-02-05 15:43:09,551 INFO L226 Difference]: Without dead ends: 4712 [2025-02-05 15:43:09,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:09,561 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 133 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:09,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1213 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4712 states. [2025-02-05 15:43:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4712 to 4704. [2025-02-05 15:43:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4704 states, 3915 states have (on average 1.655683269476373) internal successors, (6482), 3919 states have internal predecessors, (6482), 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-02-05 15:43:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4704 states to 4704 states and 8075 transitions. [2025-02-05 15:43:09,810 INFO L78 Accepts]: Start accepts. Automaton has 4704 states and 8075 transitions. Word has length 146 [2025-02-05 15:43:09,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:09,810 INFO L471 AbstractCegarLoop]: Abstraction has 4704 states and 8075 transitions. [2025-02-05 15:43:09,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4704 states and 8075 transitions. [2025-02-05 15:43:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-05 15:43:09,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:09,827 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:09,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:43:09,828 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:09,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:09,828 INFO L85 PathProgramCache]: Analyzing trace with hash 324154083, now seen corresponding path program 1 times [2025-02-05 15:43:09,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:09,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336457768] [2025-02-05 15:43:09,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:09,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:09,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-05 15:43:09,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-05 15:43:09,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:09,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:09,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336457768] [2025-02-05 15:43:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336457768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:09,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:09,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:09,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206194582] [2025-02-05 15:43:09,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:09,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:09,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:09,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:09,875 INFO L87 Difference]: Start difference. First operand 4704 states and 8075 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:10,009 INFO L93 Difference]: Finished difference Result 11414 states and 19734 transitions. [2025-02-05 15:43:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:10,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-02-05 15:43:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:10,047 INFO L225 Difference]: With dead ends: 11414 [2025-02-05 15:43:10,048 INFO L226 Difference]: Without dead ends: 7516 [2025-02-05 15:43:10,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:10,064 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 131 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:10,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1218 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2025-02-05 15:43:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 7508. [2025-02-05 15:43:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7508 states, 6226 states have (on average 1.654673947960167) internal successors, (10302), 6230 states have internal predecessors, (10302), 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-02-05 15:43:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7508 states to 7508 states and 12925 transitions. [2025-02-05 15:43:10,413 INFO L78 Accepts]: Start accepts. Automaton has 7508 states and 12925 transitions. Word has length 147 [2025-02-05 15:43:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:10,413 INFO L471 AbstractCegarLoop]: Abstraction has 7508 states and 12925 transitions. [2025-02-05 15:43:10,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 7508 states and 12925 transitions. [2025-02-05 15:43:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:43:10,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:10,445 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:10,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:43:10,446 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:10,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:10,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1281298547, now seen corresponding path program 1 times [2025-02-05 15:43:10,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:10,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084575839] [2025-02-05 15:43:10,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:10,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:10,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:43:10,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:43:10,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:10,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:10,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084575839] [2025-02-05 15:43:10,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084575839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:10,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:10,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10541420] [2025-02-05 15:43:10,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:10,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:10,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:10,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:10,498 INFO L87 Difference]: Start difference. First operand 7508 states and 12925 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:10,767 INFO L93 Difference]: Finished difference Result 18924 states and 32794 transitions. [2025-02-05 15:43:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:10,768 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 148 [2025-02-05 15:43:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:10,836 INFO L225 Difference]: With dead ends: 18924 [2025-02-05 15:43:10,836 INFO L226 Difference]: Without dead ends: 12618 [2025-02-05 15:43:10,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:10,868 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 129 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:10,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1218 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:10,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12618 states. [2025-02-05 15:43:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12618 to 12610. [2025-02-05 15:43:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12610 states, 10506 states have (on average 1.6555301732343424) internal successors, (17393), 10510 states have internal predecessors, (17393), 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-02-05 15:43:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12610 states to 12610 states and 21738 transitions. [2025-02-05 15:43:11,548 INFO L78 Accepts]: Start accepts. Automaton has 12610 states and 21738 transitions. Word has length 148 [2025-02-05 15:43:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:11,549 INFO L471 AbstractCegarLoop]: Abstraction has 12610 states and 21738 transitions. [2025-02-05 15:43:11,550 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 12610 states and 21738 transitions. [2025-02-05 15:43:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:43:11,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:11,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:11,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:43:11,591 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:11,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:11,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1591928030, now seen corresponding path program 1 times [2025-02-05 15:43:11,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:11,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485842821] [2025-02-05 15:43:11,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:11,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:43:11,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:43:11,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:11,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:11,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:11,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485842821] [2025-02-05 15:43:11,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485842821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:11,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:11,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:11,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519452588] [2025-02-05 15:43:11,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:11,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:11,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:11,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:11,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:11,658 INFO L87 Difference]: Start difference. First operand 12610 states and 21738 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:12,132 INFO L93 Difference]: Finished difference Result 30205 states and 52011 transitions. [2025-02-05 15:43:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:12,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 149 [2025-02-05 15:43:12,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:12,209 INFO L225 Difference]: With dead ends: 30205 [2025-02-05 15:43:12,209 INFO L226 Difference]: Without dead ends: 19794 [2025-02-05 15:43:12,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:12,251 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 127 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 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-02-05 15:43:12,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1190 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19794 states. [2025-02-05 15:43:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19794 to 19786. [2025-02-05 15:43:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19786 states, 16479 states have (on average 1.6325019722070513) internal successors, (26902), 16483 states have internal predecessors, (26902), 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-02-05 15:43:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19786 states to 19786 states and 33797 transitions. [2025-02-05 15:43:12,991 INFO L78 Accepts]: Start accepts. Automaton has 19786 states and 33797 transitions. Word has length 149 [2025-02-05 15:43:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:12,991 INFO L471 AbstractCegarLoop]: Abstraction has 19786 states and 33797 transitions. [2025-02-05 15:43:12,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 19786 states and 33797 transitions. [2025-02-05 15:43:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:43:13,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:13,030 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:13,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:43:13,030 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:13,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash 147382932, now seen corresponding path program 1 times [2025-02-05 15:43:13,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:13,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892625306] [2025-02-05 15:43:13,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:13,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:43:13,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:43:13,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:13,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:13,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:13,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892625306] [2025-02-05 15:43:13,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892625306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:13,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:13,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508844055] [2025-02-05 15:43:13,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:13,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:13,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:13,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:13,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:13,084 INFO L87 Difference]: Start difference. First operand 19786 states and 33797 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:13,838 INFO L93 Difference]: Finished difference Result 52252 states and 89610 transitions. [2025-02-05 15:43:13,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:13,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 150 [2025-02-05 15:43:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:13,966 INFO L225 Difference]: With dead ends: 52252 [2025-02-05 15:43:13,966 INFO L226 Difference]: Without dead ends: 35334 [2025-02-05 15:43:14,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:14,012 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 125 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:14,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1216 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35334 states. [2025-02-05 15:43:15,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35334 to 35326. [2025-02-05 15:43:15,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35326 states, 29569 states have (on average 1.6300179241773478) internal successors, (48198), 29573 states have internal predecessors, (48198), 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-02-05 15:43:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35326 states to 35326 states and 60267 transitions. [2025-02-05 15:43:15,469 INFO L78 Accepts]: Start accepts. Automaton has 35326 states and 60267 transitions. Word has length 150 [2025-02-05 15:43:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:15,469 INFO L471 AbstractCegarLoop]: Abstraction has 35326 states and 60267 transitions. [2025-02-05 15:43:15,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 35326 states and 60267 transitions. [2025-02-05 15:43:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:43:15,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:15,676 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:15,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:43:15,676 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:15,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash 101094017, now seen corresponding path program 1 times [2025-02-05 15:43:15,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:15,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244919273] [2025-02-05 15:43:15,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:15,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:43:15,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:43:15,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:15,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:43:15,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:15,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244919273] [2025-02-05 15:43:15,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244919273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:15,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:15,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:15,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236566879] [2025-02-05 15:43:15,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:15,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:15,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:15,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:15,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:15,730 INFO L87 Difference]: Start difference. First operand 35326 states and 60267 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:16,782 INFO L93 Difference]: Finished difference Result 96319 states and 164857 transitions. [2025-02-05 15:43:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:16,782 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 151 [2025-02-05 15:43:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:17,022 INFO L225 Difference]: With dead ends: 96319 [2025-02-05 15:43:17,023 INFO L226 Difference]: Without dead ends: 64808 [2025-02-05 15:43:17,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:17,122 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 123 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:17,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1218 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64808 states. [2025-02-05 15:43:19,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64808 to 64800. [2025-02-05 15:43:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64800 states, 54530 states have (on average 1.626407482119934) internal successors, (88688), 54534 states have internal predecessors, (88688), 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-02-05 15:43:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64800 states to 64800 states and 110315 transitions. [2025-02-05 15:43:20,108 INFO L78 Accepts]: Start accepts. Automaton has 64800 states and 110315 transitions. Word has length 151 [2025-02-05 15:43:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:20,108 INFO L471 AbstractCegarLoop]: Abstraction has 64800 states and 110315 transitions. [2025-02-05 15:43:20,109 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-05 15:43:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 64800 states and 110315 transitions. [2025-02-05 15:43:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 15:43:20,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:20,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:20,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:43:20,577 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:20,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:20,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1937823266, now seen corresponding path program 1 times [2025-02-05 15:43:20,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:20,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157461668] [2025-02-05 15:43:20,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:20,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:20,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 15:43:20,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 15:43:20,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:20,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:43:20,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:20,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157461668] [2025-02-05 15:43:20,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157461668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:20,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:20,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:43:20,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559104817] [2025-02-05 15:43:20,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:20,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:43:20,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:20,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:43:20,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:20,645 INFO L87 Difference]: Start difference. First operand 64800 states and 110315 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:22,800 INFO L93 Difference]: Finished difference Result 121470 states and 207211 transitions. [2025-02-05 15:43:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:43:22,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 171 [2025-02-05 15:43:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:23,269 INFO L225 Difference]: With dead ends: 121470 [2025-02-05 15:43:23,270 INFO L226 Difference]: Without dead ends: 121263 [2025-02-05 15:43:23,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:43:23,324 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 118 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:23,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1230 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:43:23,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121263 states. [2025-02-05 15:43:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121263 to 121255. [2025-02-05 15:43:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121255 states, 102617 states have (on average 1.6216318933510043) internal successors, (166407), 102621 states have internal predecessors, (166407), 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-02-05 15:43:28,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121255 states to 121255 states and 205816 transitions. [2025-02-05 15:43:28,267 INFO L78 Accepts]: Start accepts. Automaton has 121255 states and 205816 transitions. Word has length 171 [2025-02-05 15:43:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:28,268 INFO L471 AbstractCegarLoop]: Abstraction has 121255 states and 205816 transitions. [2025-02-05 15:43:28,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 121255 states and 205816 transitions. [2025-02-05 15:43:28,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 15:43:28,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:28,439 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:28,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:43:28,439 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:28,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1948240819, now seen corresponding path program 1 times [2025-02-05 15:43:28,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:28,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144325310] [2025-02-05 15:43:28,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:28,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 15:43:28,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 15:43:28,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:28,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:43:28,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:28,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144325310] [2025-02-05 15:43:28,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144325310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:28,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:28,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:43:28,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031386997] [2025-02-05 15:43:28,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:28,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:43:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:28,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:43:28,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:43:28,693 INFO L87 Difference]: Start difference. First operand 121255 states and 205816 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:43:33,476 INFO L93 Difference]: Finished difference Result 233044 states and 397188 transitions. [2025-02-05 15:43:33,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:43:33,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 172 [2025-02-05 15:43:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:43:34,686 INFO L225 Difference]: With dead ends: 233044 [2025-02-05 15:43:34,686 INFO L226 Difference]: Without dead ends: 232845 [2025-02-05 15:43:34,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:43:34,787 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 558 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 3119 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:43:34,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 3119 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:43:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232845 states. [2025-02-05 15:43:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232845 to 232837. [2025-02-05 15:43:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232837 states, 197064 states have (on average 1.624979702025738) internal successors, (320225), 197014 states have internal predecessors, (320225), 35720 states have call successors, (35720), 49 states have call predecessors, (35720), 52 states have return successors, (39003), 35773 states have call predecessors, (39003), 35718 states have call successors, (39003) [2025-02-05 15:43:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232837 states to 232837 states and 394948 transitions. [2025-02-05 15:43:42,318 INFO L78 Accepts]: Start accepts. Automaton has 232837 states and 394948 transitions. Word has length 172 [2025-02-05 15:43:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:43:42,320 INFO L471 AbstractCegarLoop]: Abstraction has 232837 states and 394948 transitions. [2025-02-05 15:43:42,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-02-05 15:43:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 232837 states and 394948 transitions. [2025-02-05 15:43:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 15:43:42,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:43:42,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:43:42,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:43:42,498 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:43:42,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:43:42,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1307386606, now seen corresponding path program 1 times [2025-02-05 15:43:42,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:43:42,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078489853] [2025-02-05 15:43:42,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:43:42,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:43:42,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 15:43:42,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 15:43:42,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:43:42,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:43:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-05 15:43:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:43:42,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078489853] [2025-02-05 15:43:42,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078489853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:43:42,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:43:42,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:43:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426678366] [2025-02-05 15:43:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:43:42,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:43:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:43:42,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:43:42,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:43:42,743 INFO L87 Difference]: Start difference. First operand 232837 states and 394948 transitions. Second operand has 10 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19)