./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product20.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14180d3cb690799ed57b4096de70e545e9154e30692708de4df58b96eb76a2f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:48:20,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:48:20,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:48:20,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:48:20,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:48:20,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:48:20,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:48:20,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:48:20,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:48:20,198 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:48:20,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:48:20,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:48:20,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:48:20,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:48:20,200 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:48:20,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:48:20,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:48:20,200 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:48:20,200 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:48:20,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:48:20,201 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:48:20,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:20,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:48:20,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:48:20,202 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:48:20,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:48:20,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:48:20,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:48:20,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:48:20,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:48:20,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:48:20,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:48:20,202 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14180d3cb690799ed57b4096de70e545e9154e30692708de4df58b96eb76a2f0 [2025-02-05 15:48:20,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:48:20,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:48:20,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:48:20,485 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:48:20,486 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:48:20,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product20.cil.c [2025-02-05 15:48:21,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/232d09ba3/dd68e3b7400345be877ab16e76411f0e/FLAG5f827ff79 [2025-02-05 15:48:22,053 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:48:22,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product20.cil.c [2025-02-05 15:48:22,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/232d09ba3/dd68e3b7400345be877ab16e76411f0e/FLAG5f827ff79 [2025-02-05 15:48:22,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/232d09ba3/dd68e3b7400345be877ab16e76411f0e [2025-02-05 15:48:22,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:48:22,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:48:22,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:22,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:48:22,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:48:22,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:22" (1/1) ... [2025-02-05 15:48:22,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1350dcb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:22, skipping insertion in model container [2025-02-05 15:48:22,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:48:22" (1/1) ... [2025-02-05 15:48:22,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:48:22,689 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product20.cil.c[19452,19465] [2025-02-05 15:48:22,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:22,869 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:48:22,877 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-02-05 15:48:22,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [414] [2025-02-05 15:48:22,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [432] [2025-02-05 15:48:22,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [844] [2025-02-05 15:48:22,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [853] [2025-02-05 15:48:22,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [1933] [2025-02-05 15:48:22,880 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1987] [2025-02-05 15:48:22,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2216] [2025-02-05 15:48:22,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2321] [2025-02-05 15:48:22,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2618] [2025-02-05 15:48:22,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2925] [2025-02-05 15:48:22,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product20.cil.c[19452,19465] [2025-02-05 15:48:22,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:48:23,006 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:48:23,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23 WrapperNode [2025-02-05 15:48:23,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:48:23,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:23,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:48:23,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:48:23,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,077 INFO L138 Inliner]: procedures = 129, calls = 200, calls flagged for inlining = 56, calls inlined = 49, statements flattened = 963 [2025-02-05 15:48:23,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:48:23,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:48:23,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:48:23,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:48:23,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,109 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:48:23,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:48:23,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:48:23,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:48:23,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:48:23,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (1/1) ... [2025-02-05 15:48:23,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:48:23,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:23,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:48:23,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:48:23,194 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:48:23,195 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:48:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:48:23,195 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:48:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:48:23,195 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:48:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:48:23,195 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:48:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:48:23,195 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:48:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:48:23,195 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:48:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:48:23,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:48:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:48:23,196 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:48:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:48:23,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:48:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:48:23,196 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:48:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:48:23,196 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:48:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:48:23,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:48:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:48:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:48:23,196 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:48:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:48:23,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:48:23,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:48:23,393 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:48:23,395 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:48:23,494 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: #res#1 := ~retValue_acc~26#1; [2025-02-05 15:48:23,494 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1522-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~25#1; [2025-02-05 15:48:23,503 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2318-1: createEmail_#res#1 := createEmail_~retValue_acc~35#1; [2025-02-05 15:48:23,511 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: #res := ~retValue_acc~18; [2025-02-05 15:48:23,524 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L677: #res := ~retValue_acc~10; [2025-02-05 15:48:23,572 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: #res := ~retValue_acc~11; [2025-02-05 15:48:23,598 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L562: #res := ~retValue_acc~7; [2025-02-05 15:48:23,660 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1345: #res := ~retValue_acc~22; [2025-02-05 15:48:23,804 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-1: getClientId_#res#1 := getClientId_~retValue_acc~31#1; [2025-02-05 15:48:23,805 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1475-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~24#1; [2025-02-05 15:48:23,805 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1791-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~29#1; [2025-02-05 15:48:23,805 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1428-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~23#1; [2025-02-05 15:48:23,805 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2890-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~41#1; [2025-02-05 15:48:24,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1737-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~28#1; [2025-02-05 15:48:24,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~38#1; [2025-02-05 15:48:24,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2865-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~40#1; [2025-02-05 15:48:24,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1630-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~27#1; [2025-02-05 15:48:24,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2856-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~39#1; [2025-02-05 15:48:24,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-1: valid_product_#res#1 := valid_product_~retValue_acc~43#1; [2025-02-05 15:48:24,086 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L525: #res := ~retValue_acc~6; [2025-02-05 15:48:24,241 INFO L? ?]: Removed 483 outVars from TransFormulas that were not future-live. [2025-02-05 15:48:24,241 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:48:24,258 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:48:24,258 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:48:24,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:48:24 BoogieIcfgContainer [2025-02-05 15:48:24,259 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:48:24,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:48:24,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:48:24,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:48:24,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:48:22" (1/3) ... [2025-02-05 15:48:24,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c73ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:48:24, skipping insertion in model container [2025-02-05 15:48:24,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:48:23" (2/3) ... [2025-02-05 15:48:24,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c73ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:48:24, skipping insertion in model container [2025-02-05 15:48:24,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:48:24" (3/3) ... [2025-02-05 15:48:24,269 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product20.cil.c [2025-02-05 15:48:24,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:48:24,285 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product20.cil.c that has 23 procedures, 364 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:48:24,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:48:24,354 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;@2453bead, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:48:24,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:48:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 364 states, 286 states have (on average 1.5769230769230769) internal successors, (451), 291 states have internal predecessors, (451), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-05 15:48:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:48:24,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:24,377 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] [2025-02-05 15:48:24,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:24,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:24,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1655622403, now seen corresponding path program 1 times [2025-02-05 15:48:24,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:24,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103134273] [2025-02-05 15:48:24,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:24,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:48:24,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:48:24,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:24,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:48:24,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:24,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103134273] [2025-02-05 15:48:24,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103134273] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:24,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082812342] [2025-02-05 15:48:24,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:24,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:24,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:24,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:24,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:48:25,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:48:25,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:48:25,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:25,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:25,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:48:25,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:25,215 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:25,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082812342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:25,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:48:25,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379410445] [2025-02-05 15:48:25,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:25,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:48:25,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:25,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:48:25,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:25,236 INFO L87 Difference]: Start difference. First operand has 364 states, 286 states have (on average 1.5769230769230769) internal successors, (451), 291 states have internal predecessors, (451), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:25,274 INFO L93 Difference]: Finished difference Result 536 states and 810 transitions. [2025-02-05 15:48:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:48:25,275 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-02-05 15:48:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:25,288 INFO L225 Difference]: With dead ends: 536 [2025-02-05 15:48:25,288 INFO L226 Difference]: Without dead ends: 357 [2025-02-05 15:48:25,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:25,296 INFO L435 NwaCegarLoop]: 556 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, 556 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:25,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-05 15:48:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-02-05 15:48:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 280 states have (on average 1.575) internal successors, (441), 284 states have internal predecessors, (441), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 15:48:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 548 transitions. [2025-02-05 15:48:25,361 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 548 transitions. Word has length 98 [2025-02-05 15:48:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:25,362 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 548 transitions. [2025-02-05 15:48:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 548 transitions. [2025-02-05 15:48:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:48:25,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:25,365 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] [2025-02-05 15:48:25,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:25,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:48:25,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:25,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1076605536, now seen corresponding path program 1 times [2025-02-05 15:48:25,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:25,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753972897] [2025-02-05 15:48:25,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:25,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:25,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:48:25,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:48:25,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:25,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:48:25,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:25,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753972897] [2025-02-05 15:48:25,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753972897] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:25,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737446770] [2025-02-05 15:48:25,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:25,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:25,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:25,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:25,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:48:25,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:48:26,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:48:26,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:26,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:26,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:48:26,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:26,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:26,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737446770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:26,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:26,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:48:26,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576199411] [2025-02-05 15:48:26,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:26,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:26,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:26,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:26,043 INFO L87 Difference]: Start difference. First operand 357 states and 548 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:26,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:26,074 INFO L93 Difference]: Finished difference Result 525 states and 788 transitions. [2025-02-05 15:48:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:26,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-02-05 15:48:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:26,076 INFO L225 Difference]: With dead ends: 525 [2025-02-05 15:48:26,076 INFO L226 Difference]: Without dead ends: 359 [2025-02-05 15:48:26,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:26,078 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 0 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:26,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1092 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-05 15:48:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-02-05 15:48:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 282 states have (on average 1.570921985815603) internal successors, (443), 286 states have internal predecessors, (443), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-02-05 15:48:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 550 transitions. [2025-02-05 15:48:26,091 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 550 transitions. Word has length 99 [2025-02-05 15:48:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:26,091 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 550 transitions. [2025-02-05 15:48:26,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 550 transitions. [2025-02-05 15:48:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:48:26,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:26,093 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] [2025-02-05 15:48:26,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:48:26,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:26,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:26,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -96502674, now seen corresponding path program 1 times [2025-02-05 15:48:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228680495] [2025-02-05 15:48:26,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:26,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:48:26,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:48:26,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:26,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:26,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:26,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228680495] [2025-02-05 15:48:26,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228680495] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:26,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340482746] [2025-02-05 15:48:26,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:26,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:26,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:26,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:26,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:48:26,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:48:26,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:48:26,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:26,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:26,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:26,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:48:26,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:26,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340482746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:26,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:26,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:48:26,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690559258] [2025-02-05 15:48:26,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:26,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:26,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:26,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:26,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:26,745 INFO L87 Difference]: Start difference. First operand 359 states and 550 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:26,771 INFO L93 Difference]: Finished difference Result 765 states and 1191 transitions. [2025-02-05 15:48:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:26,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-02-05 15:48:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:26,774 INFO L225 Difference]: With dead ends: 765 [2025-02-05 15:48:26,774 INFO L226 Difference]: Without dead ends: 433 [2025-02-05 15:48:26,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:48:26,775 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 134 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:26,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1073 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-02-05 15:48:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 425. [2025-02-05 15:48:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 334 states have (on average 1.589820359281437) internal successors, (531), 338 states have internal predecessors, (531), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 15:48:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 666 transitions. [2025-02-05 15:48:26,809 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 666 transitions. Word has length 107 [2025-02-05 15:48:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:26,809 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 666 transitions. [2025-02-05 15:48:26,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 666 transitions. [2025-02-05 15:48:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:48:26,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:26,811 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] [2025-02-05 15:48:26,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:27,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:27,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:27,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:27,015 INFO L85 PathProgramCache]: Analyzing trace with hash 301871979, now seen corresponding path program 1 times [2025-02-05 15:48:27,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:27,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831743607] [2025-02-05 15:48:27,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:27,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:27,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:48:27,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:48:27,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:27,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:27,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831743607] [2025-02-05 15:48:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831743607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:27,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693920990] [2025-02-05 15:48:27,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:27,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:27,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:27,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:27,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:48:27,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:48:27,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:48:27,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:27,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:27,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:48:27,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:48:27,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:27,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693920990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:27,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:27,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:48:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039294984] [2025-02-05 15:48:27,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:27,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:27,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:27,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:48:27,500 INFO L87 Difference]: Start difference. First operand 425 states and 666 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:27,569 INFO L93 Difference]: Finished difference Result 841 states and 1322 transitions. [2025-02-05 15:48:27,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:27,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-05 15:48:27,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:27,573 INFO L225 Difference]: With dead ends: 841 [2025-02-05 15:48:27,573 INFO L226 Difference]: Without dead ends: 427 [2025-02-05 15:48:27,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:48:27,578 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 2 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:27,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2149 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-05 15:48:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-02-05 15:48:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 335 states have (on average 1.5880597014925373) internal successors, (532), 340 states have internal predecessors, (532), 68 states have call successors, (68), 22 states have call predecessors, (68), 23 states have return successors, (69), 66 states have call predecessors, (69), 67 states have call successors, (69) [2025-02-05 15:48:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 669 transitions. [2025-02-05 15:48:27,603 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 669 transitions. Word has length 108 [2025-02-05 15:48:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:27,604 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 669 transitions. [2025-02-05 15:48:27,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 669 transitions. [2025-02-05 15:48:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:48:27,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:27,606 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] [2025-02-05 15:48:27,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:27,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:27,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:27,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:27,807 INFO L85 PathProgramCache]: Analyzing trace with hash -710868771, now seen corresponding path program 1 times [2025-02-05 15:48:27,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:27,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626560513] [2025-02-05 15:48:27,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:27,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:27,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:48:27,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:48:27,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:27,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:48:27,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626560513] [2025-02-05 15:48:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626560513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872269133] [2025-02-05 15:48:27,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:27,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:27,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:27,967 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:27,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:48:28,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:48:28,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:48:28,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:28,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:28,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:48:28,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:48:28,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:48:28,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872269133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:28,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:48:28,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:48:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028549196] [2025-02-05 15:48:28,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:28,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:28,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:28,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:28,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:28,228 INFO L87 Difference]: Start difference. First operand 427 states and 669 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:28,297 INFO L93 Difference]: Finished difference Result 843 states and 1327 transitions. [2025-02-05 15:48:28,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:28,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-02-05 15:48:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:28,300 INFO L225 Difference]: With dead ends: 843 [2025-02-05 15:48:28,300 INFO L226 Difference]: Without dead ends: 429 [2025-02-05 15:48:28,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:28,301 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:28,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-05 15:48:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-02-05 15:48:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 336 states have (on average 1.5863095238095237) internal successors, (533), 342 states have internal predecessors, (533), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (74), 66 states have call predecessors, (74), 67 states have call successors, (74) [2025-02-05 15:48:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 675 transitions. [2025-02-05 15:48:28,317 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 675 transitions. Word has length 109 [2025-02-05 15:48:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:28,317 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 675 transitions. [2025-02-05 15:48:28,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 675 transitions. [2025-02-05 15:48:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:48:28,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:28,319 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:28,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:28,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:28,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:28,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash 237395601, now seen corresponding path program 1 times [2025-02-05 15:48:28,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:28,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558297344] [2025-02-05 15:48:28,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:28,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:28,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:48:28,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:48:28,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:28,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:48:28,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:28,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558297344] [2025-02-05 15:48:28,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558297344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:28,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:28,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:28,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3437811] [2025-02-05 15:48:28,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:28,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:28,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:28,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:28,725 INFO L87 Difference]: Start difference. First operand 429 states and 675 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:28,761 INFO L93 Difference]: Finished difference Result 835 states and 1318 transitions. [2025-02-05 15:48:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:28,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-02-05 15:48:28,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:28,764 INFO L225 Difference]: With dead ends: 835 [2025-02-05 15:48:28,764 INFO L226 Difference]: Without dead ends: 429 [2025-02-05 15:48:28,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:28,766 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 2 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:28,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2153 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-05 15:48:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-02-05 15:48:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 336 states have (on average 1.5863095238095237) internal successors, (533), 342 states have internal predecessors, (533), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (73), 66 states have call predecessors, (73), 67 states have call successors, (73) [2025-02-05 15:48:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 674 transitions. [2025-02-05 15:48:28,778 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 674 transitions. Word has length 110 [2025-02-05 15:48:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:28,778 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 674 transitions. [2025-02-05 15:48:28,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 674 transitions. [2025-02-05 15:48:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:48:28,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:28,780 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] [2025-02-05 15:48:28,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:48:28,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:28,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1908820321, now seen corresponding path program 2 times [2025-02-05 15:48:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:28,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691760714] [2025-02-05 15:48:28,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:48:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:28,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-02-05 15:48:28,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:48:28,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:48:28,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:28,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:28,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691760714] [2025-02-05 15:48:28,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691760714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:28,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:28,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:28,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301736481] [2025-02-05 15:48:28,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:28,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:28,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:28,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:28,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:28,876 INFO L87 Difference]: Start difference. First operand 429 states and 674 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:28,918 INFO L93 Difference]: Finished difference Result 833 states and 1313 transitions. [2025-02-05 15:48:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-02-05 15:48:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:28,920 INFO L225 Difference]: With dead ends: 833 [2025-02-05 15:48:28,920 INFO L226 Difference]: Without dead ends: 429 [2025-02-05 15:48:28,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:28,922 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 2 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:28,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2139 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-05 15:48:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-02-05 15:48:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 336 states have (on average 1.5863095238095237) internal successors, (533), 342 states have internal predecessors, (533), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (72), 66 states have call predecessors, (72), 67 states have call successors, (72) [2025-02-05 15:48:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 673 transitions. [2025-02-05 15:48:28,956 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 673 transitions. Word has length 111 [2025-02-05 15:48:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:28,956 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 673 transitions. [2025-02-05 15:48:28,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 673 transitions. [2025-02-05 15:48:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:48:28,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:28,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:28,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:48:28,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:28,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash -319692109, now seen corresponding path program 3 times [2025-02-05 15:48:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:28,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302985857] [2025-02-05 15:48:28,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:48:28,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:28,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 3 equivalence classes. [2025-02-05 15:48:28,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 100 of 112 statements. [2025-02-05 15:48:28,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:48:28,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302985857] [2025-02-05 15:48:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302985857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:29,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125294647] [2025-02-05 15:48:29,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:29,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:29,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:29,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:29,046 INFO L87 Difference]: Start difference. First operand 429 states and 673 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:29,090 INFO L93 Difference]: Finished difference Result 835 states and 1319 transitions. [2025-02-05 15:48:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:29,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-02-05 15:48:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:29,095 INFO L225 Difference]: With dead ends: 835 [2025-02-05 15:48:29,095 INFO L226 Difference]: Without dead ends: 431 [2025-02-05 15:48:29,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:29,096 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:29,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-05 15:48:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-02-05 15:48:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 337 states have (on average 1.5845697329376855) internal successors, (534), 344 states have internal predecessors, (534), 68 states have call successors, (68), 22 states have call predecessors, (68), 25 states have return successors, (77), 66 states have call predecessors, (77), 67 states have call successors, (77) [2025-02-05 15:48:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 679 transitions. [2025-02-05 15:48:29,115 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 679 transitions. Word has length 112 [2025-02-05 15:48:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:29,115 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 679 transitions. [2025-02-05 15:48:29,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 679 transitions. [2025-02-05 15:48:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:48:29,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:29,117 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] [2025-02-05 15:48:29,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:48:29,118 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:29,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:29,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1237478846, now seen corresponding path program 1 times [2025-02-05 15:48:29,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:29,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316375497] [2025-02-05 15:48:29,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:29,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:29,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:48:29,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:48:29,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:29,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:48:29,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:29,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316375497] [2025-02-05 15:48:29,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316375497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:29,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:29,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:48:29,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944525800] [2025-02-05 15:48:29,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:29,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:48:29,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:29,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:48:29,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:29,224 INFO L87 Difference]: Start difference. First operand 431 states and 679 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:29,262 INFO L93 Difference]: Finished difference Result 841 states and 1329 transitions. [2025-02-05 15:48:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:48:29,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2025-02-05 15:48:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:29,265 INFO L225 Difference]: With dead ends: 841 [2025-02-05 15:48:29,265 INFO L226 Difference]: Without dead ends: 433 [2025-02-05 15:48:29,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:48:29,266 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:29,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2156 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-02-05 15:48:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-02-05 15:48:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 338 states have (on average 1.5828402366863905) internal successors, (535), 346 states have internal predecessors, (535), 68 states have call successors, (68), 22 states have call predecessors, (68), 26 states have return successors, (79), 66 states have call predecessors, (79), 67 states have call successors, (79) [2025-02-05 15:48:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 682 transitions. [2025-02-05 15:48:29,279 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 682 transitions. Word has length 113 [2025-02-05 15:48:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:29,279 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 682 transitions. [2025-02-05 15:48:29,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:48:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 682 transitions. [2025-02-05 15:48:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:48:29,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:29,281 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:48:29,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:48:29,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:29,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1020240373, now seen corresponding path program 1 times [2025-02-05 15:48:29,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:29,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031742267] [2025-02-05 15:48:29,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:29,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:29,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:48:29,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:48:29,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:29,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:48:29,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:29,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031742267] [2025-02-05 15:48:29,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031742267] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:48:29,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280072694] [2025-02-05 15:48:29,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:29,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:48:29,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:48:29,415 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:48:29,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:48:29,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:48:29,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:48:29,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:29,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:29,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:48:29,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:48:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:29,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:48:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:29,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280072694] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:48:29,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:48:29,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:48:29,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694439303] [2025-02-05 15:48:29,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:48:29,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:48:29,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:29,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:48:29,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:48:29,707 INFO L87 Difference]: Start difference. First operand 433 states and 682 transitions. Second operand has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-05 15:48:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:30,223 INFO L93 Difference]: Finished difference Result 1276 states and 2094 transitions. [2025-02-05 15:48:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:48:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 114 [2025-02-05 15:48:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:30,227 INFO L225 Difference]: With dead ends: 1276 [2025-02-05 15:48:30,227 INFO L226 Difference]: Without dead ends: 872 [2025-02-05 15:48:30,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:48:30,228 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1333 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 3925 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:30,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 3925 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:48:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-02-05 15:48:30,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 848. [2025-02-05 15:48:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 674 states have (on average 1.629080118694362) internal successors, (1098), 681 states have internal predecessors, (1098), 147 states have call successors, (147), 23 states have call predecessors, (147), 26 states have return successors, (168), 145 states have call predecessors, (168), 146 states have call successors, (168) [2025-02-05 15:48:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1413 transitions. [2025-02-05 15:48:30,256 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1413 transitions. Word has length 114 [2025-02-05 15:48:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:30,256 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1413 transitions. [2025-02-05 15:48:30,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-05 15:48:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1413 transitions. [2025-02-05 15:48:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:48:30,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:30,259 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] [2025-02-05 15:48:30,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:48:30,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:48:30,460 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:30,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2053131205, now seen corresponding path program 1 times [2025-02-05 15:48:30,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:30,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662593095] [2025-02-05 15:48:30,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:30,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:30,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:48:30,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:48:30,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:30,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:30,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:30,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662593095] [2025-02-05 15:48:30,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662593095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:30,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:30,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:30,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137920512] [2025-02-05 15:48:30,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:30,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:30,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:30,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:30,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:30,506 INFO L87 Difference]: Start difference. First operand 848 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:30,544 INFO L93 Difference]: Finished difference Result 2011 states and 3404 transitions. [2025-02-05 15:48:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:30,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-02-05 15:48:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:30,551 INFO L225 Difference]: With dead ends: 2011 [2025-02-05 15:48:30,551 INFO L226 Difference]: Without dead ends: 1241 [2025-02-05 15:48:30,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:30,555 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 131 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:30,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1098 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-02-05 15:48:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1233. [2025-02-05 15:48:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 980 states have (on average 1.6459183673469389) internal successors, (1613), 987 states have internal predecessors, (1613), 226 states have call successors, (226), 23 states have call predecessors, (226), 26 states have return successors, (257), 224 states have call predecessors, (257), 225 states have call successors, (257) [2025-02-05 15:48:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2096 transitions. [2025-02-05 15:48:30,641 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2096 transitions. Word has length 117 [2025-02-05 15:48:30,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:30,641 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 2096 transitions. [2025-02-05 15:48:30,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2096 transitions. [2025-02-05 15:48:30,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:48:30,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:30,647 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] [2025-02-05 15:48:30,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:48:30,647 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:30,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1500767737, now seen corresponding path program 1 times [2025-02-05 15:48:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:30,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495069326] [2025-02-05 15:48:30,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:30,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:30,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:48:30,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:48:30,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:30,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:30,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495069326] [2025-02-05 15:48:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495069326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:30,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:30,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650991502] [2025-02-05 15:48:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:30,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:30,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:30,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:30,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:30,688 INFO L87 Difference]: Start difference. First operand 1233 states and 2096 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:30,760 INFO L93 Difference]: Finished difference Result 2974 states and 5086 transitions. [2025-02-05 15:48:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:30,761 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-05 15:48:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:30,769 INFO L225 Difference]: With dead ends: 2974 [2025-02-05 15:48:30,769 INFO L226 Difference]: Without dead ends: 1870 [2025-02-05 15:48:30,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:30,772 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 129 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:30,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1094 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:30,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2025-02-05 15:48:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1862. [2025-02-05 15:48:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1490 states have (on average 1.6530201342281878) internal successors, (2463), 1497 states have internal predecessors, (2463), 345 states have call successors, (345), 23 states have call predecessors, (345), 26 states have return successors, (376), 343 states have call predecessors, (376), 344 states have call successors, (376) [2025-02-05 15:48:30,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 3184 transitions. [2025-02-05 15:48:30,845 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 3184 transitions. Word has length 118 [2025-02-05 15:48:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:30,846 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 3184 transitions. [2025-02-05 15:48:30,846 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 3184 transitions. [2025-02-05 15:48:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:48:30,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:30,853 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] [2025-02-05 15:48:30,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:48:30,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:30,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1066774202, now seen corresponding path program 1 times [2025-02-05 15:48:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:30,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848319737] [2025-02-05 15:48:30,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:30,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:30,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:48:30,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:48:30,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:30,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:30,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:30,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848319737] [2025-02-05 15:48:30,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848319737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:30,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:30,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:30,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77310262] [2025-02-05 15:48:30,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:30,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:30,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:30,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:30,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:30,904 INFO L87 Difference]: Start difference. First operand 1862 states and 3184 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:30,982 INFO L93 Difference]: Finished difference Result 4436 states and 7645 transitions. [2025-02-05 15:48:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:30,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-02-05 15:48:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:30,997 INFO L225 Difference]: With dead ends: 4436 [2025-02-05 15:48:30,997 INFO L226 Difference]: Without dead ends: 2835 [2025-02-05 15:48:31,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:31,002 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 127 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:31,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1083 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2025-02-05 15:48:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2827. [2025-02-05 15:48:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2293 states have (on average 1.6589620584387266) internal successors, (3804), 2300 states have internal predecessors, (3804), 507 states have call successors, (507), 23 states have call predecessors, (507), 26 states have return successors, (554), 505 states have call predecessors, (554), 506 states have call successors, (554) [2025-02-05 15:48:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4865 transitions. [2025-02-05 15:48:31,181 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4865 transitions. Word has length 119 [2025-02-05 15:48:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:31,181 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 4865 transitions. [2025-02-05 15:48:31,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4865 transitions. [2025-02-05 15:48:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:48:31,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:31,192 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] [2025-02-05 15:48:31,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:48:31,192 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:31,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash 742367514, now seen corresponding path program 1 times [2025-02-05 15:48:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163741456] [2025-02-05 15:48:31,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:31,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:48:31,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:48:31,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:31,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:31,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163741456] [2025-02-05 15:48:31,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163741456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:31,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:31,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:31,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107469775] [2025-02-05 15:48:31,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:31,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:31,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:31,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:31,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:31,243 INFO L87 Difference]: Start difference. First operand 2827 states and 4865 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:31,351 INFO L93 Difference]: Finished difference Result 6744 states and 11692 transitions. [2025-02-05 15:48:31,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:31,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-02-05 15:48:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:31,372 INFO L225 Difference]: With dead ends: 6744 [2025-02-05 15:48:31,372 INFO L226 Difference]: Without dead ends: 4393 [2025-02-05 15:48:31,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:31,380 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 125 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:31,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1083 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2025-02-05 15:48:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 4385. [2025-02-05 15:48:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4385 states, 3606 states have (on average 1.6633388796450361) internal successors, (5998), 3613 states have internal predecessors, (5998), 752 states have call successors, (752), 23 states have call predecessors, (752), 26 states have return successors, (825), 750 states have call predecessors, (825), 751 states have call successors, (825) [2025-02-05 15:48:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4385 states to 4385 states and 7575 transitions. [2025-02-05 15:48:31,609 INFO L78 Accepts]: Start accepts. Automaton has 4385 states and 7575 transitions. Word has length 120 [2025-02-05 15:48:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:31,609 INFO L471 AbstractCegarLoop]: Abstraction has 4385 states and 7575 transitions. [2025-02-05 15:48:31,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4385 states and 7575 transitions. [2025-02-05 15:48:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:48:31,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:31,622 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] [2025-02-05 15:48:31,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:48:31,623 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:31,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1907599961, now seen corresponding path program 1 times [2025-02-05 15:48:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:31,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774112035] [2025-02-05 15:48:31,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:31,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:31,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:48:31,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:48:31,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:31,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774112035] [2025-02-05 15:48:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774112035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:31,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425206100] [2025-02-05 15:48:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:31,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:31,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:31,667 INFO L87 Difference]: Start difference. First operand 4385 states and 7575 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:31,866 INFO L93 Difference]: Finished difference Result 10859 states and 18865 transitions. [2025-02-05 15:48:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:31,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-02-05 15:48:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:31,909 INFO L225 Difference]: With dead ends: 10859 [2025-02-05 15:48:31,910 INFO L226 Difference]: Without dead ends: 7197 [2025-02-05 15:48:31,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:31,923 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 123 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:31,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1103 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7197 states. [2025-02-05 15:48:32,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7197 to 7189. [2025-02-05 15:48:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7189 states, 5917 states have (on average 1.6592868007436201) internal successors, (9818), 5924 states have internal predecessors, (9818), 1245 states have call successors, (1245), 23 states have call predecessors, (1245), 26 states have return successors, (1362), 1243 states have call predecessors, (1362), 1244 states have call successors, (1362) [2025-02-05 15:48:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7189 states to 7189 states and 12425 transitions. [2025-02-05 15:48:32,241 INFO L78 Accepts]: Start accepts. Automaton has 7189 states and 12425 transitions. Word has length 121 [2025-02-05 15:48:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:32,242 INFO L471 AbstractCegarLoop]: Abstraction has 7189 states and 12425 transitions. [2025-02-05 15:48:32,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 7189 states and 12425 transitions. [2025-02-05 15:48:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:48:32,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:32,261 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] [2025-02-05 15:48:32,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:48:32,261 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:32,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1274047621, now seen corresponding path program 1 times [2025-02-05 15:48:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:32,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644417442] [2025-02-05 15:48:32,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:32,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:32,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:48:32,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:48:32,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:32,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:32,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:32,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644417442] [2025-02-05 15:48:32,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644417442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:32,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:32,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:32,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222709762] [2025-02-05 15:48:32,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:32,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:32,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:32,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:32,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:32,306 INFO L87 Difference]: Start difference. First operand 7189 states and 12425 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:32,679 INFO L93 Difference]: Finished difference Result 18174 states and 31613 transitions. [2025-02-05 15:48:32,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:32,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-02-05 15:48:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:32,738 INFO L225 Difference]: With dead ends: 18174 [2025-02-05 15:48:32,739 INFO L226 Difference]: Without dead ends: 12104 [2025-02-05 15:48:32,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:32,766 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 121 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:32,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1096 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12104 states. [2025-02-05 15:48:33,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12104 to 12096. [2025-02-05 15:48:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 10002 states have (on average 1.659368126374725) internal successors, (16597), 10009 states have internal predecessors, (16597), 2067 states have call successors, (2067), 23 states have call predecessors, (2067), 26 states have return successors, (2262), 2065 states have call predecessors, (2262), 2066 states have call successors, (2262) [2025-02-05 15:48:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20926 transitions. [2025-02-05 15:48:33,376 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20926 transitions. Word has length 122 [2025-02-05 15:48:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:33,376 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20926 transitions. [2025-02-05 15:48:33,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20926 transitions. [2025-02-05 15:48:33,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:48:33,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:33,399 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] [2025-02-05 15:48:33,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:48:33,399 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:33,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:33,401 INFO L85 PathProgramCache]: Analyzing trace with hash 586929560, now seen corresponding path program 1 times [2025-02-05 15:48:33,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:33,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720800783] [2025-02-05 15:48:33,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:33,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:33,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:48:33,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:48:33,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:33,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:33,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720800783] [2025-02-05 15:48:33,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720800783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:33,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:33,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:33,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929861695] [2025-02-05 15:48:33,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:33,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:33,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:33,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:33,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:33,453 INFO L87 Difference]: Start difference. First operand 12096 states and 20926 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:33,883 INFO L93 Difference]: Finished difference Result 28930 states and 49990 transitions. [2025-02-05 15:48:33,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:33,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-02-05 15:48:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:33,949 INFO L225 Difference]: With dead ends: 28930 [2025-02-05 15:48:33,949 INFO L226 Difference]: Without dead ends: 18920 [2025-02-05 15:48:33,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:33,985 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 119 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:33,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1066 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18920 states. [2025-02-05 15:48:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18920 to 18912. [2025-02-05 15:48:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18912 states, 15615 states have (on average 1.6349663784822286) internal successors, (25530), 15622 states have internal predecessors, (25530), 3270 states have call successors, (3270), 23 states have call predecessors, (3270), 26 states have return successors, (3609), 3268 states have call predecessors, (3609), 3269 states have call successors, (3609) [2025-02-05 15:48:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18912 states to 18912 states and 32409 transitions. [2025-02-05 15:48:34,607 INFO L78 Accepts]: Start accepts. Automaton has 18912 states and 32409 transitions. Word has length 123 [2025-02-05 15:48:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:34,608 INFO L471 AbstractCegarLoop]: Abstraction has 18912 states and 32409 transitions. [2025-02-05 15:48:34,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 18912 states and 32409 transitions. [2025-02-05 15:48:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:48:34,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:34,631 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] [2025-02-05 15:48:34,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:48:34,631 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:34,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:34,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1482775908, now seen corresponding path program 1 times [2025-02-05 15:48:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766019054] [2025-02-05 15:48:34,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:34,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:48:34,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:48:34,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:34,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:34,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:34,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766019054] [2025-02-05 15:48:34,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766019054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:34,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:34,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341465515] [2025-02-05 15:48:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:34,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:34,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:34,680 INFO L87 Difference]: Start difference. First operand 18912 states and 32409 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:35,949 INFO L93 Difference]: Finished difference Result 49967 states and 85973 transitions. [2025-02-05 15:48:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:35,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-02-05 15:48:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:36,059 INFO L225 Difference]: With dead ends: 49967 [2025-02-05 15:48:36,060 INFO L226 Difference]: Without dead ends: 33775 [2025-02-05 15:48:36,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:36,096 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 117 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1086 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:36,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1086 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:48:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33775 states. [2025-02-05 15:48:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33775 to 33767. [2025-02-05 15:48:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33767 states, 28020 states have (on average 1.6320485367594575) internal successors, (45730), 28027 states have internal predecessors, (45730), 5720 states have call successors, (5720), 23 states have call predecessors, (5720), 26 states have return successors, (6333), 5718 states have call predecessors, (6333), 5719 states have call successors, (6333) [2025-02-05 15:48:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33767 states to 33767 states and 57783 transitions. [2025-02-05 15:48:37,131 INFO L78 Accepts]: Start accepts. Automaton has 33767 states and 57783 transitions. Word has length 124 [2025-02-05 15:48:37,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:37,132 INFO L471 AbstractCegarLoop]: Abstraction has 33767 states and 57783 transitions. [2025-02-05 15:48:37,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33767 states and 57783 transitions. [2025-02-05 15:48:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:48:37,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:37,155 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] [2025-02-05 15:48:37,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:48:37,155 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:37,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2121508855, now seen corresponding path program 1 times [2025-02-05 15:48:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800790681] [2025-02-05 15:48:37,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:37,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:37,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:48:37,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:48:37,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:37,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800790681] [2025-02-05 15:48:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800790681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:37,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:37,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364742050] [2025-02-05 15:48:37,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:37,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:37,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:37,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:37,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:37,212 INFO L87 Difference]: Start difference. First operand 33767 states and 57783 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:39,180 INFO L93 Difference]: Finished difference Result 92059 states and 158060 transitions. [2025-02-05 15:48:39,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:39,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-02-05 15:48:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:39,385 INFO L225 Difference]: With dead ends: 92059 [2025-02-05 15:48:39,385 INFO L226 Difference]: Without dead ends: 61919 [2025-02-05 15:48:39,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:39,444 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 115 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:39,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1086 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:39,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61919 states. [2025-02-05 15:48:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61919 to 61911. [2025-02-05 15:48:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61911 states, 51651 states have (on average 1.6280807728795184) internal successors, (84092), 51658 states have internal predecessors, (84092), 10233 states have call successors, (10233), 23 states have call predecessors, (10233), 26 states have return successors, (11378), 10231 states have call predecessors, (11378), 10232 states have call successors, (11378) [2025-02-05 15:48:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61911 states to 61911 states and 105703 transitions. [2025-02-05 15:48:41,911 INFO L78 Accepts]: Start accepts. Automaton has 61911 states and 105703 transitions. Word has length 125 [2025-02-05 15:48:41,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:41,911 INFO L471 AbstractCegarLoop]: Abstraction has 61911 states and 105703 transitions. [2025-02-05 15:48:41,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 61911 states and 105703 transitions. [2025-02-05 15:48:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 15:48:41,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:41,955 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] [2025-02-05 15:48:41,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:48:41,955 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:41,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash -25238947, now seen corresponding path program 1 times [2025-02-05 15:48:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:41,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331676142] [2025-02-05 15:48:41,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:41,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 15:48:41,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 15:48:41,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:41,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:42,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:42,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331676142] [2025-02-05 15:48:42,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331676142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:42,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:42,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:48:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175005790] [2025-02-05 15:48:42,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:42,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:48:42,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:42,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:48:42,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:42,045 INFO L87 Difference]: Start difference. First operand 61911 states and 105703 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:44,540 INFO L93 Difference]: Finished difference Result 115925 states and 198358 transitions. [2025-02-05 15:48:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:48:44,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-02-05 15:48:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:45,221 INFO L225 Difference]: With dead ends: 115925 [2025-02-05 15:48:45,222 INFO L226 Difference]: Without dead ends: 115759 [2025-02-05 15:48:45,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:48:45,295 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 110 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:45,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1092 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:48:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115759 states. [2025-02-05 15:48:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115759 to 115751. [2025-02-05 15:48:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115751 states, 97123 states have (on average 1.6229626350092152) internal successors, (157627), 97130 states have internal predecessors, (157627), 18601 states have call successors, (18601), 23 states have call predecessors, (18601), 26 states have return successors, (20792), 18599 states have call predecessors, (20792), 18600 states have call successors, (20792) [2025-02-05 15:48:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115751 states to 115751 states and 197020 transitions. [2025-02-05 15:48:49,932 INFO L78 Accepts]: Start accepts. Automaton has 115751 states and 197020 transitions. Word has length 126 [2025-02-05 15:48:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:48:49,933 INFO L471 AbstractCegarLoop]: Abstraction has 115751 states and 197020 transitions. [2025-02-05 15:48:49,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:48:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 115751 states and 197020 transitions. [2025-02-05 15:48:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 15:48:49,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:48:49,980 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] [2025-02-05 15:48:49,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:48:49,981 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:48:49,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:48:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1586399766, now seen corresponding path program 1 times [2025-02-05 15:48:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:48:49,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754562438] [2025-02-05 15:48:49,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:48:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:48:50,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 15:48:50,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 15:48:50,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:48:50,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:48:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:48:50,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:48:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754562438] [2025-02-05 15:48:50,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754562438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:48:50,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:48:50,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 15:48:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104608993] [2025-02-05 15:48:50,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:48:50,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:48:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:48:50,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:48:50,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:48:50,423 INFO L87 Difference]: Start difference. First operand 115751 states and 197020 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-02-05 15:48:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:48:57,633 INFO L93 Difference]: Finished difference Result 230598 states and 397991 transitions. [2025-02-05 15:48:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 15:48:57,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 127 [2025-02-05 15:48:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:48:59,161 INFO L225 Difference]: With dead ends: 230598 [2025-02-05 15:48:59,161 INFO L226 Difference]: Without dead ends: 230438 [2025-02-05 15:48:59,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:48:59,334 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 1388 mSDsluCounter, 5505 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 6147 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 15:48:59,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 6147 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 15:48:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230438 states.