./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product27.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f7652bf269245a8144605490a4a891295a82bf8357d2cf3971e290586b4e5c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:22:20,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:22:20,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:22:20,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:22:20,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:22:20,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:22:20,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:22:20,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:22:20,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:22:20,793 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:22:20,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:22:20,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:22:20,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:22:20,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:22:20,794 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:22:20,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:22:20,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:22:20,794 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:22:20,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:22:20,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:20,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:22:20,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:22:20,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:22:20,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:22:20,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:22:20,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:22:20,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:22:20,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:22:20,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:22:20,796 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f7652bf269245a8144605490a4a891295a82bf8357d2cf3971e290586b4e5c1 [2025-03-03 14:22:21,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:22:21,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:22:21,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:22:21,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:22:21,041 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:22:21,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product27.cil.c [2025-03-03 14:22:22,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7336c4e7e/09cf992c331c481fa002d203b1eb17b4/FLAGd5bbf54ff [2025-03-03 14:22:22,474 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:22:22,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product27.cil.c [2025-03-03 14:22:22,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7336c4e7e/09cf992c331c481fa002d203b1eb17b4/FLAGd5bbf54ff [2025-03-03 14:22:22,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7336c4e7e/09cf992c331c481fa002d203b1eb17b4 [2025-03-03 14:22:22,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:22:22,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:22:22,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:22,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:22:22,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:22:22,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9177fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22, skipping insertion in model container [2025-03-03 14:22:22,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:22:23,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product27.cil.c[57688,57701] [2025-03-03 14:22:23,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:23,133 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:22:23,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-03-03 14:22:23,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [167] [2025-03-03 14:22:23,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [533] [2025-03-03 14:22:23,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [937] [2025-03-03 14:22:23,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1170] [2025-03-03 14:22:23,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2250] [2025-03-03 14:22:23,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2558] [2025-03-03 14:22:23,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2593] [2025-03-03 14:22:23,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2602] [2025-03-03 14:22:23,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2633] [2025-03-03 14:22:23,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2650] [2025-03-03 14:22:23,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product27.cil.c[57688,57701] [2025-03-03 14:22:23,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:23,260 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:22:23,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23 WrapperNode [2025-03-03 14:22:23,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:23,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:23,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:22:23,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:22:23,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,319 INFO L138 Inliner]: procedures = 133, calls = 209, calls flagged for inlining = 63, calls inlined = 60, statements flattened = 1080 [2025-03-03 14:22:23,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:23,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:22:23,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:22:23,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:22:23,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,360 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:22:23,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:22:23,390 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:22:23,390 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:22:23,390 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:22:23,391 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (1/1) ... [2025-03-03 14:22:23,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:23,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:23,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:22:23,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:22:23,443 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:22:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:22:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:22:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:22:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:22:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:22:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:22:23,444 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:22:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:22:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:22:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:22:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:22:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:22:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:22:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:22:23,446 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:22:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:22:23,446 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:22:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:22:23,446 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:22:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:22:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:22:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:22:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:22:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:22:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:22:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:22:23,448 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:22:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:22:23,448 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:22:23,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:22:23,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:22:23,608 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:22:23,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:22:23,716 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1792-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~26#1; [2025-03-03 14:22:23,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L844: #res := ~retValue_acc~14; [2025-03-03 14:22:23,737 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L918: #res := ~retValue_acc~16; [2025-03-03 14:22:23,776 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884: #res#1 := ~retValue_acc~28#1; [2025-03-03 14:22:23,776 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1839-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~27#1; [2025-03-03 14:22:23,804 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2108: #res := ~retValue_acc~31; [2025-03-03 14:22:23,812 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L164-1: createEmail_#res#1 := createEmail_~retValue_acc~2#1; [2025-03-03 14:22:23,825 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1336: #res := ~retValue_acc~20; [2025-03-03 14:22:23,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L881: #res := ~retValue_acc~15; [2025-03-03 14:22:23,882 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L655: #res := ~retValue_acc~9; [2025-03-03 14:22:23,942 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1662: #res := ~retValue_acc~24; [2025-03-03 14:22:24,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1745-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~25#1; [2025-03-03 14:22:24,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L581-1: getEmailId_#res#1 := getEmailId_~retValue_acc~7#1; [2025-03-03 14:22:24,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2227-1: getClientId_#res#1 := getClientId_~retValue_acc~33#1; [2025-03-03 14:22:24,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2898-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2025-03-03 14:22:24,088 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2180-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~32#1; [2025-03-03 14:22:24,317 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2054-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~30#1; [2025-03-03 14:22:24,317 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2864-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-03-03 14:22:24,317 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590-1: valid_product_#res#1 := valid_product_~retValue_acc~36#1; [2025-03-03 14:22:24,317 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2855-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-03-03 14:22:24,317 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~29#1; [2025-03-03 14:22:24,317 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2873-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-03-03 14:22:24,327 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L618: #res := ~retValue_acc~8; [2025-03-03 14:22:24,329 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: #res := ~retValue_acc~0; [2025-03-03 14:22:24,447 INFO L? ?]: Removed 561 outVars from TransFormulas that were not future-live. [2025-03-03 14:22:24,448 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:22:24,467 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:22:24,468 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:22:24,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:24 BoogieIcfgContainer [2025-03-03 14:22:24,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:22:24,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:22:24,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:22:24,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:22:24,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:22:22" (1/3) ... [2025-03-03 14:22:24,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200b02a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:24, skipping insertion in model container [2025-03-03 14:22:24,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:23" (2/3) ... [2025-03-03 14:22:24,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200b02a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:24, skipping insertion in model container [2025-03-03 14:22:24,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:24" (3/3) ... [2025-03-03 14:22:24,476 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product27.cil.c [2025-03-03 14:22:24,485 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:22:24,488 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-03-03 14:22:24,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:22:24,553 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;@5e97aa4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:22:24,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:22:24,561 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-03-03 14:22:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:22:24,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:24,580 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-03-03 14:22:24,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:24,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:24,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1868729897, now seen corresponding path program 1 times [2025-03-03 14:22:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:24,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324499884] [2025-03-03 14:22:24,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:24,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:22:24,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:22:24,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:24,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:25,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:25,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324499884] [2025-03-03 14:22:25,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324499884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:25,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457781414] [2025-03-03 14:22:25,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:25,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:25,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:25,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:25,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:22:25,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:22:25,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:22:25,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:25,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:25,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:22:25,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:22:25,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457781414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:25,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:25,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:22:25,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154752886] [2025-03-03 14:22:25,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:25,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:22:25,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:25,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:22:25,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:25,536 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-03-03 14:22:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:25,591 INFO L93 Difference]: Finished difference Result 623 states and 934 transitions. [2025-03-03 14:22:25,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:22:25,592 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-03-03 14:22:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:25,603 INFO L225 Difference]: With dead ends: 623 [2025-03-03 14:22:25,603 INFO L226 Difference]: Without dead ends: 403 [2025-03-03 14:22:25,610 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-03-03 14:22:25,612 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-03-03 14:22:25,613 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-03-03 14:22:25,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-03 14:22:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-03 14:22:25,656 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-03-03 14:22:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 614 transitions. [2025-03-03 14:22:25,665 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 614 transitions. Word has length 136 [2025-03-03 14:22:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:25,666 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 614 transitions. [2025-03-03 14:22:25,667 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-03-03 14:22:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 614 transitions. [2025-03-03 14:22:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:22:25,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:25,672 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-03-03 14:22:25,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:22:25,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:22:25,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:25,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash -769287963, now seen corresponding path program 1 times [2025-03-03 14:22:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:25,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748613691] [2025-03-03 14:22:25,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:25,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:25,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:22:25,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:22:25,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:25,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:22:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748613691] [2025-03-03 14:22:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748613691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929507910] [2025-03-03 14:22:26,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:26,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:26,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:26,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:26,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:22:26,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:22:26,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:22:26,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:26,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:22:26,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:22:26,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929507910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19437843] [2025-03-03 14:22:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:26,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:26,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:26,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:26,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:26,443 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-03-03 14:22:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:26,492 INFO L93 Difference]: Finished difference Result 612 states and 912 transitions. [2025-03-03 14:22:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:26,493 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-03-03 14:22:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:26,496 INFO L225 Difference]: With dead ends: 612 [2025-03-03 14:22:26,496 INFO L226 Difference]: Without dead ends: 405 [2025-03-03 14:22:26,498 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-03-03 14:22:26,498 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-03-03 14:22:26,498 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-03-03 14:22:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-03 14:22:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-03-03 14:22:26,515 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-03-03 14:22:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 616 transitions. [2025-03-03 14:22:26,518 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 616 transitions. Word has length 118 [2025-03-03 14:22:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:26,518 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 616 transitions. [2025-03-03 14:22:26,518 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-03-03 14:22:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 616 transitions. [2025-03-03 14:22:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:22:26,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:26,521 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-03-03 14:22:26,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:26,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:22:26,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:26,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash 505867233, now seen corresponding path program 1 times [2025-03-03 14:22:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:26,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543267313] [2025-03-03 14:22:26,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:26,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:26,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:22:26,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:22:26,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:26,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:26,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:26,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543267313] [2025-03-03 14:22:26,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543267313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:26,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857070466] [2025-03-03 14:22:26,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:26,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:26,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:26,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:26,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:22:27,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:22:27,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:22:27,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:27,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:27,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:27,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:22:27,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:27,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857070466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:27,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:27,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512547507] [2025-03-03 14:22:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:27,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:27,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:27,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:27,220 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-03-03 14:22:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:27,268 INFO L93 Difference]: Finished difference Result 862 states and 1331 transitions. [2025-03-03 14:22:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:27,270 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-03-03 14:22:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:27,274 INFO L225 Difference]: With dead ends: 862 [2025-03-03 14:22:27,274 INFO L226 Difference]: Without dead ends: 484 [2025-03-03 14:22:27,275 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-03-03 14:22:27,276 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-03-03 14:22:27,276 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-03-03 14:22:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-03 14:22:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 476. [2025-03-03 14:22:27,297 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-03-03 14:22:27,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 740 transitions. [2025-03-03 14:22:27,302 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 740 transitions. Word has length 126 [2025-03-03 14:22:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:27,304 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 740 transitions. [2025-03-03 14:22:27,305 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-03-03 14:22:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 740 transitions. [2025-03-03 14:22:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:22:27,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:27,308 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-03-03 14:22:27,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:27,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:27,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:27,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:27,509 INFO L85 PathProgramCache]: Analyzing trace with hash 240756853, now seen corresponding path program 1 times [2025-03-03 14:22:27,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:27,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891664637] [2025-03-03 14:22:27,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:27,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:27,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:22:27,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:22:27,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:27,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:22:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:27,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891664637] [2025-03-03 14:22:27,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891664637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:27,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267826716] [2025-03-03 14:22:27,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:27,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:27,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:27,710 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:27,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:22:27,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:22:27,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:22:27,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:27,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:27,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:22:27,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:22:28,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:28,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267826716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:28,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:28,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:28,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234192380] [2025-03-03 14:22:28,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:28,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:28,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:28,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:28,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:28,016 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-03-03 14:22:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:28,076 INFO L93 Difference]: Finished difference Result 943 states and 1470 transitions. [2025-03-03 14:22:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:28,077 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-03-03 14:22:28,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:28,081 INFO L225 Difference]: With dead ends: 943 [2025-03-03 14:22:28,081 INFO L226 Difference]: Without dead ends: 478 [2025-03-03 14:22:28,082 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-03-03 14:22:28,083 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-03-03 14:22:28,084 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-03-03 14:22:28,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-03 14:22:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2025-03-03 14:22:28,107 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-03-03 14:22:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 743 transitions. [2025-03-03 14:22:28,111 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 743 transitions. Word has length 146 [2025-03-03 14:22:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:28,111 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 743 transitions. [2025-03-03 14:22:28,112 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-03-03 14:22:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 743 transitions. [2025-03-03 14:22:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:22:28,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:28,117 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-03-03 14:22:28,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:22:28,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:28,318 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:28,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1505004441, now seen corresponding path program 1 times [2025-03-03 14:22:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971650057] [2025-03-03 14:22:28,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:28,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:22:28,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:22:28,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:28,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:28,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:28,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971650057] [2025-03-03 14:22:28,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971650057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:28,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798913247] [2025-03-03 14:22:28,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:28,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:28,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:28,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:28,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:22:28,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:22:28,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:22:28,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:28,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:28,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:28,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:22:28,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:28,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798913247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:28,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:28,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:22:28,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231580923] [2025-03-03 14:22:28,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:28,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:28,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:28,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:28,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:28,779 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-03-03 14:22:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:28,837 INFO L93 Difference]: Finished difference Result 945 states and 1475 transitions. [2025-03-03 14:22:28,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:28,840 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-03-03 14:22:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:28,844 INFO L225 Difference]: With dead ends: 945 [2025-03-03 14:22:28,844 INFO L226 Difference]: Without dead ends: 480 [2025-03-03 14:22:28,846 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-03-03 14:22:28,847 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-03-03 14:22:28,847 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-03-03 14:22:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-03 14:22:28,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-03 14:22:28,869 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-03-03 14:22:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 749 transitions. [2025-03-03 14:22:28,877 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 749 transitions. Word has length 128 [2025-03-03 14:22:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:28,877 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 749 transitions. [2025-03-03 14:22:28,879 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-03-03 14:22:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 749 transitions. [2025-03-03 14:22:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:22:28,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:28,882 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-03-03 14:22:28,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:29,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:29,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:29,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash -302804386, now seen corresponding path program 1 times [2025-03-03 14:22:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:29,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136181674] [2025-03-03 14:22:29,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:29,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:22:29,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:22:29,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:29,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:22:29,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136181674] [2025-03-03 14:22:29,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136181674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:29,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:29,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:29,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001302201] [2025-03-03 14:22:29,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:29,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:29,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:29,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:29,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:29,271 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-03-03 14:22:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:29,311 INFO L93 Difference]: Finished difference Result 937 states and 1466 transitions. [2025-03-03 14:22:29,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:29,312 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-03-03 14:22:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:29,315 INFO L225 Difference]: With dead ends: 937 [2025-03-03 14:22:29,315 INFO L226 Difference]: Without dead ends: 480 [2025-03-03 14:22:29,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:29,318 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-03-03 14:22:29,318 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-03-03 14:22:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-03 14:22:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-03 14:22:29,339 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-03-03 14:22:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 748 transitions. [2025-03-03 14:22:29,343 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 748 transitions. Word has length 148 [2025-03-03 14:22:29,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:29,344 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 748 transitions. [2025-03-03 14:22:29,344 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-03-03 14:22:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 748 transitions. [2025-03-03 14:22:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:22:29,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:29,347 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-03-03 14:22:29,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:22:29,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:29,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:29,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1957119423, now seen corresponding path program 2 times [2025-03-03 14:22:29,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:29,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104725512] [2025-03-03 14:22:29,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:29,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:29,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-03-03 14:22:29,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 66 of 149 statements. [2025-03-03 14:22:29,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:22:29,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 14:22:29,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104725512] [2025-03-03 14:22:29,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104725512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:29,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:29,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202153239] [2025-03-03 14:22:29,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:29,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:29,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:29,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:29,440 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-03-03 14:22:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:29,466 INFO L93 Difference]: Finished difference Result 679 states and 1036 transitions. [2025-03-03 14:22:29,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:29,467 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-03-03 14:22:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:29,471 INFO L225 Difference]: With dead ends: 679 [2025-03-03 14:22:29,474 INFO L226 Difference]: Without dead ends: 480 [2025-03-03 14:22:29,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:29,475 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-03-03 14:22:29,476 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-03-03 14:22:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-03 14:22:29,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-03 14:22:29,493 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-03-03 14:22:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 747 transitions. [2025-03-03 14:22:29,496 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 747 transitions. Word has length 149 [2025-03-03 14:22:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:29,497 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 747 transitions. [2025-03-03 14:22:29,497 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-03-03 14:22:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 747 transitions. [2025-03-03 14:22:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:22:29,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:29,500 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-03-03 14:22:29,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:22:29,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:29,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash -127976640, now seen corresponding path program 1 times [2025-03-03 14:22:29,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:29,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160666699] [2025-03-03 14:22:29,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:29,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:22:29,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:22:29,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:29,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:29,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160666699] [2025-03-03 14:22:29,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160666699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:29,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:29,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:29,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146838978] [2025-03-03 14:22:29,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:29,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:29,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:29,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:29,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:29,621 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-03-03 14:22:29,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:29,662 INFO L93 Difference]: Finished difference Result 939 states and 1467 transitions. [2025-03-03 14:22:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:29,662 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-03-03 14:22:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:29,666 INFO L225 Difference]: With dead ends: 939 [2025-03-03 14:22:29,666 INFO L226 Difference]: Without dead ends: 482 [2025-03-03 14:22:29,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:29,668 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-03-03 14:22:29,670 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-03-03 14:22:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-03 14:22:29,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2025-03-03 14:22:29,685 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-03-03 14:22:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 750 transitions. [2025-03-03 14:22:29,688 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 750 transitions. Word has length 137 [2025-03-03 14:22:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:29,688 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 750 transitions. [2025-03-03 14:22:29,688 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-03-03 14:22:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 750 transitions. [2025-03-03 14:22:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 14:22:29,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:29,690 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-03-03 14:22:29,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:22:29,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:29,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:29,691 INFO L85 PathProgramCache]: Analyzing trace with hash -853775561, now seen corresponding path program 1 times [2025-03-03 14:22:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:29,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168527169] [2025-03-03 14:22:29,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:29,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 14:22:29,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 14:22:29,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:29,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:22:29,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168527169] [2025-03-03 14:22:29,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168527169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:29,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:29,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:29,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109258433] [2025-03-03 14:22:29,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:29,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:29,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:29,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:29,859 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-03-03 14:22:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:29,964 INFO L93 Difference]: Finished difference Result 941 states and 1466 transitions. [2025-03-03 14:22:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:29,965 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-03-03 14:22:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:29,967 INFO L225 Difference]: With dead ends: 941 [2025-03-03 14:22:29,967 INFO L226 Difference]: Without dead ends: 484 [2025-03-03 14:22:29,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:29,969 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-03-03 14:22:29,969 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-03-03 14:22:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-03 14:22:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-03-03 14:22:29,981 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-03-03 14:22:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 751 transitions. [2025-03-03 14:22:29,985 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 751 transitions. Word has length 157 [2025-03-03 14:22:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:29,985 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 751 transitions. [2025-03-03 14:22:29,985 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-03-03 14:22:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 751 transitions. [2025-03-03 14:22:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:22:29,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:29,988 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-03-03 14:22:29,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:22:29,988 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:29,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1292315032, now seen corresponding path program 1 times [2025-03-03 14:22:29,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:29,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347365646] [2025-03-03 14:22:29,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:30,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:22:30,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:22:30,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:30,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347365646] [2025-03-03 14:22:30,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347365646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:30,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:30,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:30,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636426976] [2025-03-03 14:22:30,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:30,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:30,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:30,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:30,131 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-03-03 14:22:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:30,240 INFO L93 Difference]: Finished difference Result 944 states and 1473 transitions. [2025-03-03 14:22:30,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:30,241 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-03-03 14:22:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:30,244 INFO L225 Difference]: With dead ends: 944 [2025-03-03 14:22:30,244 INFO L226 Difference]: Without dead ends: 487 [2025-03-03 14:22:30,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:30,246 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-03-03 14:22:30,246 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-03-03 14:22:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-03 14:22:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2025-03-03 14:22:30,258 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-03-03 14:22:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 758 transitions. [2025-03-03 14:22:30,262 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 758 transitions. Word has length 139 [2025-03-03 14:22:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:30,262 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 758 transitions. [2025-03-03 14:22:30,263 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-03-03 14:22:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 758 transitions. [2025-03-03 14:22:30,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 14:22:30,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:30,265 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-03-03 14:22:30,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:22:30,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:30,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1976341178, now seen corresponding path program 1 times [2025-03-03 14:22:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:30,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958727437] [2025-03-03 14:22:30,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:30,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:30,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:22:30,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:22:30,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:30,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:22:30,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:30,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958727437] [2025-03-03 14:22:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958727437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:30,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376779263] [2025-03-03 14:22:30,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:30,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:30,436 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:30,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:22:30,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 14:22:30,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 14:22:30,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:30,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:30,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:30,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:30,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:22:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:30,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376779263] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:22:30,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:22:30,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:22:30,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771222720] [2025-03-03 14:22:30,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:22:30,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:22:30,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:30,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:22:30,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:30,816 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-03-03 14:22:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:31,403 INFO L93 Difference]: Finished difference Result 1406 states and 2283 transitions. [2025-03-03 14:22:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:22:31,403 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-03-03 14:22:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:31,410 INFO L225 Difference]: With dead ends: 1406 [2025-03-03 14:22:31,410 INFO L226 Difference]: Without dead ends: 951 [2025-03-03 14:22:31,412 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-03-03 14:22:31,412 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 1377 mSDsluCounter, 4626 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:31,412 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.4s Time] [2025-03-03 14:22:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-03 14:22:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 927. [2025-03-03 14:22:31,449 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-03-03 14:22:31,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1529 transitions. [2025-03-03 14:22:31,456 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1529 transitions. Word has length 159 [2025-03-03 14:22:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:31,458 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1529 transitions. [2025-03-03 14:22:31,458 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-03-03 14:22:31,459 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1529 transitions. [2025-03-03 14:22:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:22:31,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:31,465 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-03-03 14:22:31,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:22:31,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:31,669 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:31,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:31,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1321558075, now seen corresponding path program 1 times [2025-03-03 14:22:31,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:31,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058379951] [2025-03-03 14:22:31,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:31,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:31,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:22:31,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:22:31,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:31,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058379951] [2025-03-03 14:22:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058379951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:31,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:31,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436882852] [2025-03-03 14:22:31,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:31,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:31,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:31,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:31,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:31,735 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-03-03 14:22:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:31,805 INFO L93 Difference]: Finished difference Result 2191 states and 3673 transitions. [2025-03-03 14:22:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:31,806 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-03-03 14:22:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:31,813 INFO L225 Difference]: With dead ends: 2191 [2025-03-03 14:22:31,813 INFO L226 Difference]: Without dead ends: 1345 [2025-03-03 14:22:31,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:31,816 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-03-03 14:22:31,816 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-03-03 14:22:31,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-03 14:22:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1337. [2025-03-03 14:22:31,868 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-03-03 14:22:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2252 transitions. [2025-03-03 14:22:31,878 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2252 transitions. Word has length 143 [2025-03-03 14:22:31,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:31,880 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 2252 transitions. [2025-03-03 14:22:31,880 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-03-03 14:22:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2252 transitions. [2025-03-03 14:22:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 14:22:31,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:31,887 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-03-03 14:22:31,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:22:31,887 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:31,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash -171458430, now seen corresponding path program 1 times [2025-03-03 14:22:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:31,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263180959] [2025-03-03 14:22:31,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:31,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:31,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:22:31,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:22:31,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:31,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:31,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:31,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263180959] [2025-03-03 14:22:31,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263180959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:31,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:31,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:31,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830871914] [2025-03-03 14:22:31,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:31,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:31,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:31,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:31,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:31,968 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-03-03 14:22:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:32,052 INFO L93 Difference]: Finished difference Result 3219 states and 5459 transitions. [2025-03-03 14:22:32,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:32,053 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-03-03 14:22:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:32,065 INFO L225 Difference]: With dead ends: 3219 [2025-03-03 14:22:32,065 INFO L226 Difference]: Without dead ends: 2014 [2025-03-03 14:22:32,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:32,072 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-03-03 14:22:32,072 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-03-03 14:22:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2025-03-03 14:22:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2006. [2025-03-03 14:22:32,151 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-03-03 14:22:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 3404 transitions. [2025-03-03 14:22:32,162 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 3404 transitions. Word has length 163 [2025-03-03 14:22:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:32,162 INFO L471 AbstractCegarLoop]: Abstraction has 2006 states and 3404 transitions. [2025-03-03 14:22:32,162 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-03-03 14:22:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 3404 transitions. [2025-03-03 14:22:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:22:32,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:32,173 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-03-03 14:22:32,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:22:32,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:32,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:32,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1502688452, now seen corresponding path program 1 times [2025-03-03 14:22:32,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:32,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204455559] [2025-03-03 14:22:32,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:32,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:32,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:22:32,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:22:32,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:32,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:32,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:32,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204455559] [2025-03-03 14:22:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204455559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:32,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:32,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:32,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162213191] [2025-03-03 14:22:32,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:32,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:32,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:32,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:32,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:32,230 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-03-03 14:22:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:32,310 INFO L93 Difference]: Finished difference Result 4786 states and 8186 transitions. [2025-03-03 14:22:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:32,311 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-03-03 14:22:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:32,328 INFO L225 Difference]: With dead ends: 4786 [2025-03-03 14:22:32,328 INFO L226 Difference]: Without dead ends: 3044 [2025-03-03 14:22:32,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:32,336 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-03-03 14:22:32,337 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-03-03 14:22:32,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2025-03-03 14:22:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3036. [2025-03-03 14:22:32,491 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-03-03 14:22:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 5189 transitions. [2025-03-03 14:22:32,507 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 5189 transitions. Word has length 145 [2025-03-03 14:22:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:32,507 INFO L471 AbstractCegarLoop]: Abstraction has 3036 states and 5189 transitions. [2025-03-03 14:22:32,507 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-03-03 14:22:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 5189 transitions. [2025-03-03 14:22:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:22:32,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:32,522 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-03-03 14:22:32,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:22:32,523 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:32,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:32,523 INFO L85 PathProgramCache]: Analyzing trace with hash 391619026, now seen corresponding path program 1 times [2025-03-03 14:22:32,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313513060] [2025-03-03 14:22:32,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:32,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:32,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:22:32,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:22:32,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:32,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:32,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:32,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313513060] [2025-03-03 14:22:32,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313513060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:32,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190031847] [2025-03-03 14:22:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:32,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:32,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:32,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:32,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:32,575 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-03-03 14:22:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:32,679 INFO L93 Difference]: Finished difference Result 7269 states and 12513 transitions. [2025-03-03 14:22:32,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:32,679 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-03-03 14:22:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:32,703 INFO L225 Difference]: With dead ends: 7269 [2025-03-03 14:22:32,703 INFO L226 Difference]: Without dead ends: 4712 [2025-03-03 14:22:32,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:32,714 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-03-03 14:22:32,714 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-03-03 14:22:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4712 states. [2025-03-03 14:22:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4712 to 4704. [2025-03-03 14:22:32,884 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-03-03 14:22:32,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4704 states to 4704 states and 8075 transitions. [2025-03-03 14:22:32,910 INFO L78 Accepts]: Start accepts. Automaton has 4704 states and 8075 transitions. Word has length 146 [2025-03-03 14:22:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:32,910 INFO L471 AbstractCegarLoop]: Abstraction has 4704 states and 8075 transitions. [2025-03-03 14:22:32,910 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-03-03 14:22:32,910 INFO L276 IsEmpty]: Start isEmpty. Operand 4704 states and 8075 transitions. [2025-03-03 14:22:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:22:32,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:32,929 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-03-03 14:22:32,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:22:32,929 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash 324154083, now seen corresponding path program 1 times [2025-03-03 14:22:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454152148] [2025-03-03 14:22:32,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:32,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:32,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:22:32,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:22:32,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:32,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:33,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:33,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454152148] [2025-03-03 14:22:33,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454152148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:33,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:33,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:33,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053847104] [2025-03-03 14:22:33,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:33,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:33,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:33,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:33,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:33,014 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-03-03 14:22:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:33,151 INFO L93 Difference]: Finished difference Result 11414 states and 19734 transitions. [2025-03-03 14:22:33,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:33,151 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-03-03 14:22:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:33,200 INFO L225 Difference]: With dead ends: 11414 [2025-03-03 14:22:33,200 INFO L226 Difference]: Without dead ends: 7516 [2025-03-03 14:22:33,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:33,216 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-03-03 14:22:33,216 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-03-03 14:22:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7516 states. [2025-03-03 14:22:33,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7516 to 7508. [2025-03-03 14:22:33,499 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-03-03 14:22:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7508 states to 7508 states and 12925 transitions. [2025-03-03 14:22:33,539 INFO L78 Accepts]: Start accepts. Automaton has 7508 states and 12925 transitions. Word has length 147 [2025-03-03 14:22:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:33,539 INFO L471 AbstractCegarLoop]: Abstraction has 7508 states and 12925 transitions. [2025-03-03 14:22:33,540 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-03-03 14:22:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 7508 states and 12925 transitions. [2025-03-03 14:22:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:22:33,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:33,567 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-03-03 14:22:33,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:22:33,567 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:33,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:33,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1281298547, now seen corresponding path program 1 times [2025-03-03 14:22:33,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:33,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078832174] [2025-03-03 14:22:33,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:33,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:33,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:22:33,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:22:33,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:33,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:33,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:33,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078832174] [2025-03-03 14:22:33,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078832174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:33,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:33,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:33,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151568523] [2025-03-03 14:22:33,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:33,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:33,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:33,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:33,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:33,621 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-03-03 14:22:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:33,927 INFO L93 Difference]: Finished difference Result 18924 states and 32794 transitions. [2025-03-03 14:22:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:33,928 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-03-03 14:22:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:33,984 INFO L225 Difference]: With dead ends: 18924 [2025-03-03 14:22:33,984 INFO L226 Difference]: Without dead ends: 12618 [2025-03-03 14:22:34,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:34,011 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-03-03 14:22:34,011 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-03-03 14:22:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12618 states. [2025-03-03 14:22:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12618 to 12610. [2025-03-03 14:22:34,545 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-03-03 14:22:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12610 states to 12610 states and 21738 transitions. [2025-03-03 14:22:34,589 INFO L78 Accepts]: Start accepts. Automaton has 12610 states and 21738 transitions. Word has length 148 [2025-03-03 14:22:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:34,590 INFO L471 AbstractCegarLoop]: Abstraction has 12610 states and 21738 transitions. [2025-03-03 14:22:34,590 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-03-03 14:22:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 12610 states and 21738 transitions. [2025-03-03 14:22:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:22:34,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:34,628 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-03-03 14:22:34,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:22:34,628 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:34,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1591928030, now seen corresponding path program 1 times [2025-03-03 14:22:34,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:34,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988317816] [2025-03-03 14:22:34,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:34,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:22:34,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:22:34,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:34,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988317816] [2025-03-03 14:22:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988317816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:34,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:34,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123839497] [2025-03-03 14:22:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:34,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:34,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:34,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:34,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:34,687 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-03-03 14:22:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:35,066 INFO L93 Difference]: Finished difference Result 30205 states and 52011 transitions. [2025-03-03 14:22:35,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:35,066 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-03-03 14:22:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:35,130 INFO L225 Difference]: With dead ends: 30205 [2025-03-03 14:22:35,131 INFO L226 Difference]: Without dead ends: 19794 [2025-03-03 14:22:35,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:35,163 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-03-03 14:22:35,164 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-03-03 14:22:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19794 states. [2025-03-03 14:22:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19794 to 19786. [2025-03-03 14:22:35,822 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-03-03 14:22:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19786 states to 19786 states and 33797 transitions. [2025-03-03 14:22:35,903 INFO L78 Accepts]: Start accepts. Automaton has 19786 states and 33797 transitions. Word has length 149 [2025-03-03 14:22:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:35,904 INFO L471 AbstractCegarLoop]: Abstraction has 19786 states and 33797 transitions. [2025-03-03 14:22:35,904 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-03-03 14:22:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 19786 states and 33797 transitions. [2025-03-03 14:22:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:22:35,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:35,947 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-03-03 14:22:35,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:22:35,948 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:35,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash 147382932, now seen corresponding path program 1 times [2025-03-03 14:22:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772914705] [2025-03-03 14:22:35,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:35,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:35,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:22:35,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:22:35,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:35,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:36,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:36,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772914705] [2025-03-03 14:22:36,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772914705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:36,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:36,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:36,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546365546] [2025-03-03 14:22:36,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:36,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:36,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:36,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:36,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:36,007 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-03-03 14:22:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:36,919 INFO L93 Difference]: Finished difference Result 52252 states and 89610 transitions. [2025-03-03 14:22:36,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:36,920 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-03-03 14:22:36,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:37,095 INFO L225 Difference]: With dead ends: 52252 [2025-03-03 14:22:37,095 INFO L226 Difference]: Without dead ends: 35334 [2025-03-03 14:22:37,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:37,165 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-03-03 14:22:37,165 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-03-03 14:22:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35334 states. [2025-03-03 14:22:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35334 to 35326. [2025-03-03 14:22:38,241 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-03-03 14:22:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35326 states to 35326 states and 60267 transitions. [2025-03-03 14:22:38,361 INFO L78 Accepts]: Start accepts. Automaton has 35326 states and 60267 transitions. Word has length 150 [2025-03-03 14:22:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:38,361 INFO L471 AbstractCegarLoop]: Abstraction has 35326 states and 60267 transitions. [2025-03-03 14:22:38,362 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-03-03 14:22:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 35326 states and 60267 transitions. [2025-03-03 14:22:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:22:38,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:38,554 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-03-03 14:22:38,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:22:38,554 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:38,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:38,554 INFO L85 PathProgramCache]: Analyzing trace with hash 101094017, now seen corresponding path program 1 times [2025-03-03 14:22:38,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:38,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67469733] [2025-03-03 14:22:38,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:38,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:38,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:22:38,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:22:38,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:38,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67469733] [2025-03-03 14:22:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67469733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543933186] [2025-03-03 14:22:38,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:38,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:38,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:38,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:38,607 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-03-03 14:22:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:39,608 INFO L93 Difference]: Finished difference Result 96319 states and 164857 transitions. [2025-03-03 14:22:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:39,609 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-03-03 14:22:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:39,880 INFO L225 Difference]: With dead ends: 96319 [2025-03-03 14:22:39,880 INFO L226 Difference]: Without dead ends: 64808 [2025-03-03 14:22:39,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:39,971 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-03-03 14:22:39,972 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-03-03 14:22:40,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64808 states. [2025-03-03 14:22:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64808 to 64800. [2025-03-03 14:22:42,185 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-03-03 14:22:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64800 states to 64800 states and 110315 transitions. [2025-03-03 14:22:42,481 INFO L78 Accepts]: Start accepts. Automaton has 64800 states and 110315 transitions. Word has length 151 [2025-03-03 14:22:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:42,482 INFO L471 AbstractCegarLoop]: Abstraction has 64800 states and 110315 transitions. [2025-03-03 14:22:42,482 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-03-03 14:22:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 64800 states and 110315 transitions. [2025-03-03 14:22:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 14:22:42,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:42,563 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-03-03 14:22:42,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:22:42,564 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:42,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1937823266, now seen corresponding path program 1 times [2025-03-03 14:22:42,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:42,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223842764] [2025-03-03 14:22:42,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:42,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:42,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:22:42,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:22:42,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:42,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:42,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:42,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223842764] [2025-03-03 14:22:42,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223842764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:42,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:42,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283436497] [2025-03-03 14:22:42,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:42,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:42,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:42,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:42,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:42,633 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-03-03 14:22:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:44,651 INFO L93 Difference]: Finished difference Result 121470 states and 207211 transitions. [2025-03-03 14:22:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:44,652 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-03-03 14:22:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:45,138 INFO L225 Difference]: With dead ends: 121470 [2025-03-03 14:22:45,138 INFO L226 Difference]: Without dead ends: 121263 [2025-03-03 14:22:45,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:45,199 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-03-03 14:22:45,199 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-03-03 14:22:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121263 states. [2025-03-03 14:22:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121263 to 121255. [2025-03-03 14:22:48,899 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-03-03 14:22:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121255 states to 121255 states and 205816 transitions. [2025-03-03 14:22:49,470 INFO L78 Accepts]: Start accepts. Automaton has 121255 states and 205816 transitions. Word has length 171 [2025-03-03 14:22:49,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:49,470 INFO L471 AbstractCegarLoop]: Abstraction has 121255 states and 205816 transitions. [2025-03-03 14:22:49,471 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-03-03 14:22:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 121255 states and 205816 transitions. [2025-03-03 14:22:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 14:22:49,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:49,557 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-03-03 14:22:49,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:22:49,557 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:49,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1948240819, now seen corresponding path program 1 times [2025-03-03 14:22:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:49,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498048223] [2025-03-03 14:22:49,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:49,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 14:22:49,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 14:22:49,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:49,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:49,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:49,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498048223] [2025-03-03 14:22:49,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498048223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:49,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:49,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:22:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091011992] [2025-03-03 14:22:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:49,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:22:49,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:49,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:22:49,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:49,677 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-03-03 14:22:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:54,203 INFO L93 Difference]: Finished difference Result 233044 states and 397188 transitions. [2025-03-03 14:22:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:22:54,204 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-03-03 14:22:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:55,069 INFO L225 Difference]: With dead ends: 233044 [2025-03-03 14:22:55,069 INFO L226 Difference]: Without dead ends: 232845 [2025-03-03 14:22:55,171 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-03-03 14:22:55,174 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 558 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-03-03 14:22:55,174 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-03-03 14:22:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232845 states.