./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_productSimulator.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_spec0_productSimulator.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 1b548755c8e9cfcfe9ed8b47fb1ac823ac6821056e7770bffa975fdbf413b243 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:40:26,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:40:27,055 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:40:27,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:40:27,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:40:27,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:40:27,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:40:27,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:40:27,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:40:27,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:40:27,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:40:27,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:40:27,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:40:27,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:40:27,083 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:40:27,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:40:27,083 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:40:27,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:40:27,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:27,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:40:27,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:40:27,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:40:27,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:40:27,087 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 -> 1b548755c8e9cfcfe9ed8b47fb1ac823ac6821056e7770bffa975fdbf413b243 [2025-02-05 15:40:27,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:40:27,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:40:27,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:40:27,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:40:27,404 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:40:27,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c [2025-02-05 15:40:28,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e199eb564/8ca8439600374115a8c6ba43119723ed/FLAGb4aaa20a0 [2025-02-05 15:40:29,169 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:40:29,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_productSimulator.cil.c [2025-02-05 15:40:29,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e199eb564/8ca8439600374115a8c6ba43119723ed/FLAGb4aaa20a0 [2025-02-05 15:40:29,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e199eb564/8ca8439600374115a8c6ba43119723ed [2025-02-05 15:40:29,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:40:29,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:40:29,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:29,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:40:29,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:40:29,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:29" (1/1) ... [2025-02-05 15:40:29,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6540c11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:29, skipping insertion in model container [2025-02-05 15:40:29,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:29" (1/1) ... [2025-02-05 15:40:29,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:40:29,632 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_spec0_productSimulator.cil.c[14867,14880] [2025-02-05 15:40:29,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:29,920 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:40:29,927 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-02-05 15:40:29,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [168] [2025-02-05 15:40:29,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [751] [2025-02-05 15:40:29,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [768] [2025-02-05 15:40:29,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [777] [2025-02-05 15:40:29,929 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1848] [2025-02-05 15:40:29,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2247] [2025-02-05 15:40:29,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2608] [2025-02-05 15:40:29,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2874] [2025-02-05 15:40:29,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2893] [2025-02-05 15:40:29,930 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3097] [2025-02-05 15:40:29,968 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_spec0_productSimulator.cil.c[14867,14880] [2025-02-05 15:40:30,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:30,092 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:40:30,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30 WrapperNode [2025-02-05 15:40:30,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:30,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:30,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:40:30,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:40:30,104 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:40:30" (1/1) ... [2025-02-05 15:40:30,129 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:40:30" (1/1) ... [2025-02-05 15:40:30,196 INFO L138 Inliner]: procedures = 151, calls = 262, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1305 [2025-02-05 15:40:30,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:30,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:40:30,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:40:30,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:40:30,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,255 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:40:30,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,285 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:40:30,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:40:30,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:40:30,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:40:30,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:30,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:30,372 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:40:30,376 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:40:30,401 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:40:30,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:40:30,402 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-02-05 15:40:30,402 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-02-05 15:40:30,402 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-02-05 15:40:30,402 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-02-05 15:40:30,402 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:40:30,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:40:30,403 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:40:30,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:40:30,403 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:40:30,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:40:30,403 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:40:30,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:40:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-02-05 15:40:30,404 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-02-05 15:40:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:40:30,404 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:40:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-02-05 15:40:30,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-02-05 15:40:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:40:30,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:40:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:40:30,404 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:40:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:40:30,404 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:40:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-02-05 15:40:30,404 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-02-05 15:40:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-02-05 15:40:30,404 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-02-05 15:40:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:40:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:40:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:40:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-02-05 15:40:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:40:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:40:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:40:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-02-05 15:40:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:40:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:40:30,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:40:30,405 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-02-05 15:40:30,406 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-02-05 15:40:30,406 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:40:30,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:40:30,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:40:30,407 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-02-05 15:40:30,407 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-02-05 15:40:30,407 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:40:30,407 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:40:30,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:40:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:40:30,666 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:40:30,671 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:40:30,730 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3032: #res := ~retValue_acc~37; [2025-02-05 15:40:30,751 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2154: #res := ~retValue_acc~33; [2025-02-05 15:40:30,775 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L632: #res := ~retValue_acc~6; [2025-02-05 15:40:30,793 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1390: #res := ~retValue_acc~17; [2025-02-05 15:40:30,887 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: #res := ~retValue_acc~11; [2025-02-05 15:40:30,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1891-1: getEmailId_#res#1 := getEmailId_~retValue_acc~26#1; [2025-02-05 15:40:30,998 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2117: #res := ~retValue_acc~32; [2025-02-05 15:40:31,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: #res := ~retValue_acc~28; [2025-02-05 15:40:31,101 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3070: #res#1 := ~retValue_acc~39#1; [2025-02-05 15:40:31,102 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3052-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~38#1; [2025-02-05 15:40:31,204 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1437-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~18#1; [2025-02-05 15:40:31,204 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1482: #res#1 := ~retValue_acc~19#1; [2025-02-05 15:40:31,264 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1706: #res := ~retValue_acc~22; [2025-02-05 15:40:31,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3094-1: createEmail_#res#1 := createEmail_~retValue_acc~41#1; [2025-02-05 15:40:31,289 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2080: #res := ~retValue_acc~31; [2025-02-05 15:40:31,350 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: getClientId_#res#1 := getClientId_~retValue_acc~24#1; [2025-02-05 15:40:31,416 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2228-1: isVerified_#res#1 := isVerified_~retValue_acc~35#1; [2025-02-05 15:40:31,417 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1778-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~23#1; [2025-02-05 15:40:31,425 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2191: #res := ~retValue_acc~34; [2025-02-05 15:40:31,472 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: #res := ~retValue_acc~0; [2025-02-05 15:40:31,494 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260: #res := ~retValue_acc~15; [2025-02-05 15:40:31,515 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1343-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~16#1; [2025-02-05 15:40:31,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L598-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~4#1; [2025-02-05 15:40:31,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1545-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~20#1; [2025-02-05 15:40:31,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L589-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~3#1; [2025-02-05 15:40:31,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L607-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~5#1; [2025-02-05 15:40:31,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L165-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:40:31,853 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1652-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~21#1; [2025-02-05 15:40:31,861 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: #res := ~retValue_acc~27; [2025-02-05 15:40:32,089 INFO L? ?]: Removed 623 outVars from TransFormulas that were not future-live. [2025-02-05 15:40:32,089 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:40:32,126 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:40:32,126 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:40:32,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:32 BoogieIcfgContainer [2025-02-05 15:40:32,129 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:40:32,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:40:32,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:40:32,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:40:32,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:40:29" (1/3) ... [2025-02-05 15:40:32,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582b0d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:32, skipping insertion in model container [2025-02-05 15:40:32,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30" (2/3) ... [2025-02-05 15:40:32,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582b0d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:32, skipping insertion in model container [2025-02-05 15:40:32,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:32" (3/3) ... [2025-02-05 15:40:32,142 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_productSimulator.cil.c [2025-02-05 15:40:32,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:40:32,163 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_productSimulator.cil.c that has 44 procedures, 599 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:40:32,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:40:32,274 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;@75f2b54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:40:32,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:40:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 15:40:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 15:40:32,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:32,310 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:32,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:32,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash 750529619, now seen corresponding path program 1 times [2025-02-05 15:40:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:32,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42478350] [2025-02-05 15:40:32,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:32,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 15:40:32,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 15:40:32,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:32,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 15:40:32,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42478350] [2025-02-05 15:40:32,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42478350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:32,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:32,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:40:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332966920] [2025-02-05 15:40:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:32,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:40:32,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:32,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:40:32,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:40:32,845 INFO L87 Difference]: Start difference. First operand has 599 states, 445 states have (on average 1.5146067415730338) internal successors, (674), 465 states have internal predecessors, (674), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:40:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:32,942 INFO L93 Difference]: Finished difference Result 930 states and 1369 transitions. [2025-02-05 15:40:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:40:32,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 177 [2025-02-05 15:40:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:32,968 INFO L225 Difference]: With dead ends: 930 [2025-02-05 15:40:32,969 INFO L226 Difference]: Without dead ends: 592 [2025-02-05 15:40:32,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:40:32,982 INFO L435 NwaCegarLoop]: 889 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, 889 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:40:32,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-05 15:40:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-02-05 15:40:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.5125284738041003) internal successors, (664), 458 states have internal predecessors, (664), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 15:40:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 881 transitions. [2025-02-05 15:40:33,090 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 881 transitions. Word has length 177 [2025-02-05 15:40:33,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:33,092 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 881 transitions. [2025-02-05 15:40:33,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:40:33,092 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 881 transitions. [2025-02-05 15:40:33,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 15:40:33,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:33,101 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:33,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:40:33,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:33,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:33,102 INFO L85 PathProgramCache]: Analyzing trace with hash -48086408, now seen corresponding path program 1 times [2025-02-05 15:40:33,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:33,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97677165] [2025-02-05 15:40:33,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:33,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:33,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 15:40:33,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 15:40:33,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:33,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 15:40:33,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:33,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97677165] [2025-02-05 15:40:33,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97677165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:33,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:33,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865063814] [2025-02-05 15:40:33,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:33,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:33,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:33,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:33,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:33,554 INFO L87 Difference]: Start difference. First operand 592 states and 881 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:40:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:33,689 INFO L93 Difference]: Finished difference Result 1148 states and 1706 transitions. [2025-02-05 15:40:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:33,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 178 [2025-02-05 15:40:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:33,700 INFO L225 Difference]: With dead ends: 1148 [2025-02-05 15:40:33,700 INFO L226 Difference]: Without dead ends: 592 [2025-02-05 15:40:33,704 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:40:33,705 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 0 mSDsluCounter, 2625 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:33,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-05 15:40:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-02-05 15:40:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 439 states have (on average 1.4965831435079726) internal successors, (657), 458 states have internal predecessors, (657), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 15:40:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 874 transitions. [2025-02-05 15:40:33,782 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 874 transitions. Word has length 178 [2025-02-05 15:40:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:33,782 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 874 transitions. [2025-02-05 15:40:33,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 15:40:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 874 transitions. [2025-02-05 15:40:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 15:40:33,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:33,791 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:33,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:40:33,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:33,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash 495196208, now seen corresponding path program 1 times [2025-02-05 15:40:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:33,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961711701] [2025-02-05 15:40:33,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:33,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 15:40:33,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 15:40:33,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:33,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-02-05 15:40:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961711701] [2025-02-05 15:40:34,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961711701] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63339051] [2025-02-05 15:40:34,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:34,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:34,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:34,251 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:40:34,255 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:40:34,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 15:40:34,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 15:40:34,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:34,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:34,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 1421 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:40:34,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 15:40:34,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:34,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63339051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:34,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:34,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-02-05 15:40:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106173490] [2025-02-05 15:40:34,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:34,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:34,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:34,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:34,797 INFO L87 Difference]: Start difference. First operand 592 states and 874 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:40:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:34,864 INFO L93 Difference]: Finished difference Result 919 states and 1331 transitions. [2025-02-05 15:40:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:34,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 170 [2025-02-05 15:40:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:34,875 INFO L225 Difference]: With dead ends: 919 [2025-02-05 15:40:34,875 INFO L226 Difference]: Without dead ends: 594 [2025-02-05 15:40:34,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:34,878 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 0 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1744 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:40:34,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1744 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-02-05 15:40:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-02-05 15:40:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 441 states have (on average 1.4943310657596371) internal successors, (659), 460 states have internal predecessors, (659), 109 states have call successors, (109), 43 states have call predecessors, (109), 43 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 15:40:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 876 transitions. [2025-02-05 15:40:34,922 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 876 transitions. Word has length 170 [2025-02-05 15:40:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:34,924 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 876 transitions. [2025-02-05 15:40:34,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 15:40:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 876 transitions. [2025-02-05 15:40:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 15:40:34,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:34,931 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:34,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:40:35,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:35,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:35,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:35,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1341176448, now seen corresponding path program 1 times [2025-02-05 15:40:35,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:35,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424386388] [2025-02-05 15:40:35,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:35,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:35,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 15:40:35,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 15:40:35,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:35,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-02-05 15:40:35,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:35,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424386388] [2025-02-05 15:40:35,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424386388] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:35,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325893221] [2025-02-05 15:40:35,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:35,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:35,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:35,521 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:40:35,524 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:40:35,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 15:40:35,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 15:40:35,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:35,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:35,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:35,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-05 15:40:36,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:36,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325893221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:36,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:36,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-02-05 15:40:36,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402030211] [2025-02-05 15:40:36,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:36,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:36,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:36,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:36,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:36,143 INFO L87 Difference]: Start difference. First operand 594 states and 876 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:40:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:36,227 INFO L93 Difference]: Finished difference Result 1446 states and 2142 transitions. [2025-02-05 15:40:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:36,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 189 [2025-02-05 15:40:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:36,236 INFO L225 Difference]: With dead ends: 1446 [2025-02-05 15:40:36,237 INFO L226 Difference]: Without dead ends: 1129 [2025-02-05 15:40:36,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:36,241 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 740 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:36,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1750 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-02-05 15:40:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1127. [2025-02-05 15:40:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 840 states have (on average 1.5011904761904762) internal successors, (1261), 874 states have internal predecessors, (1261), 200 states have call successors, (200), 86 states have call predecessors, (200), 86 states have return successors, (211), 197 states have call predecessors, (211), 198 states have call successors, (211) [2025-02-05 15:40:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1672 transitions. [2025-02-05 15:40:36,331 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1672 transitions. Word has length 189 [2025-02-05 15:40:36,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:36,332 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1672 transitions. [2025-02-05 15:40:36,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-05 15:40:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1672 transitions. [2025-02-05 15:40:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 15:40:36,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:36,340 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:36,351 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:40:36,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:36,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:36,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:36,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2029223270, now seen corresponding path program 1 times [2025-02-05 15:40:36,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:36,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090268885] [2025-02-05 15:40:36,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:36,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 15:40:36,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 15:40:36,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:36,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:40:36,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:36,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090268885] [2025-02-05 15:40:36,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090268885] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:36,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679929477] [2025-02-05 15:40:36,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:36,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:36,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:36,845 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:40:36,847 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:40:37,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 15:40:37,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 15:40:37,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:37,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:37,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 1434 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:40:37,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 15:40:37,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:37,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679929477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:37,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2025-02-05 15:40:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200235398] [2025-02-05 15:40:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:37,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:40:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:37,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:40:37,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:40:37,309 INFO L87 Difference]: Start difference. First operand 1127 states and 1672 transitions. Second operand has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:40:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:37,450 INFO L93 Difference]: Finished difference Result 2178 states and 3245 transitions. [2025-02-05 15:40:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:40:37,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 176 [2025-02-05 15:40:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:37,462 INFO L225 Difference]: With dead ends: 2178 [2025-02-05 15:40:37,462 INFO L226 Difference]: Without dead ends: 1137 [2025-02-05 15:40:37,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:40:37,469 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:37,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5154 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-02-05 15:40:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1135. [2025-02-05 15:40:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 844 states have (on average 1.4988151658767772) internal successors, (1265), 880 states have internal predecessors, (1265), 200 states have call successors, (200), 86 states have call predecessors, (200), 90 states have return successors, (219), 199 states have call predecessors, (219), 198 states have call successors, (219) [2025-02-05 15:40:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1684 transitions. [2025-02-05 15:40:37,530 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1684 transitions. Word has length 176 [2025-02-05 15:40:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:37,531 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 1684 transitions. [2025-02-05 15:40:37,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:40:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1684 transitions. [2025-02-05 15:40:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 15:40:37,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:37,537 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:37,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:40:37,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:37,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:37,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:37,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1224462049, now seen corresponding path program 1 times [2025-02-05 15:40:37,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:37,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423341690] [2025-02-05 15:40:37,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:37,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 15:40:37,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 15:40:37,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:37,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:40:38,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423341690] [2025-02-05 15:40:38,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423341690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:38,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:38,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:40:38,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627392559] [2025-02-05 15:40:38,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:38,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:40:38,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:38,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:40:38,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:38,007 INFO L87 Difference]: Start difference. First operand 1135 states and 1684 transitions. Second operand has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:40:38,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:38,156 INFO L93 Difference]: Finished difference Result 2150 states and 3205 transitions. [2025-02-05 15:40:38,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:40:38,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 177 [2025-02-05 15:40:38,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:38,168 INFO L225 Difference]: With dead ends: 2150 [2025-02-05 15:40:38,168 INFO L226 Difference]: Without dead ends: 1141 [2025-02-05 15:40:38,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:38,174 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 4 mSDsluCounter, 4292 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:38,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5154 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-02-05 15:40:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1139. [2025-02-05 15:40:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 846 states have (on average 1.4976359338061467) internal successors, (1267), 882 states have internal predecessors, (1267), 200 states have call successors, (200), 86 states have call predecessors, (200), 92 states have return successors, (221), 201 states have call predecessors, (221), 198 states have call successors, (221) [2025-02-05 15:40:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1688 transitions. [2025-02-05 15:40:38,240 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1688 transitions. Word has length 177 [2025-02-05 15:40:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:38,240 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1688 transitions. [2025-02-05 15:40:38,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.833333333333332) internal successors, (101), 7 states have internal predecessors, (101), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:40:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1688 transitions. [2025-02-05 15:40:38,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 15:40:38,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:38,249 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:38,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:40:38,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:38,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:38,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1003095168, now seen corresponding path program 2 times [2025-02-05 15:40:38,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:38,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078472398] [2025-02-05 15:40:38,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:40:38,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:38,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 178 statements into 2 equivalence classes. [2025-02-05 15:40:38,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 89 of 178 statements. [2025-02-05 15:40:38,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:40:38,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-05 15:40:38,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:38,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078472398] [2025-02-05 15:40:38,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078472398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:38,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:38,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:40:38,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867218745] [2025-02-05 15:40:38,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:38,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:40:38,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:38,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:40:38,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:38,408 INFO L87 Difference]: Start difference. First operand 1139 states and 1688 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 15:40:38,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:38,475 INFO L93 Difference]: Finished difference Result 1149 states and 1702 transitions. [2025-02-05 15:40:38,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:40:38,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2025-02-05 15:40:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:38,486 INFO L225 Difference]: With dead ends: 1149 [2025-02-05 15:40:38,486 INFO L226 Difference]: Without dead ends: 1147 [2025-02-05 15:40:38,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:38,489 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 0 mSDsluCounter, 4346 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5217 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:38,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5217 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2025-02-05 15:40:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2025-02-05 15:40:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 852 states have (on average 1.494131455399061) internal successors, (1273), 888 states have internal predecessors, (1273), 200 states have call successors, (200), 86 states have call predecessors, (200), 94 states have return successors, (226), 203 states have call predecessors, (226), 198 states have call successors, (226) [2025-02-05 15:40:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1699 transitions. [2025-02-05 15:40:38,551 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1699 transitions. Word has length 178 [2025-02-05 15:40:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:38,552 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1699 transitions. [2025-02-05 15:40:38,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 5 states have internal predecessors, (98), 1 states have call successors, (30), 1 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 15:40:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1699 transitions. [2025-02-05 15:40:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 15:40:38,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:38,558 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:38,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:40:38,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:38,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:38,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1404853778, now seen corresponding path program 1 times [2025-02-05 15:40:38,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:38,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932966930] [2025-02-05 15:40:38,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:38,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:38,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-05 15:40:38,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 15:40:38,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:38,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-05 15:40:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:38,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932966930] [2025-02-05 15:40:38,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932966930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:38,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:38,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:40:38,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690446959] [2025-02-05 15:40:38,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:38,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:40:38,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:38,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:40:38,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:38,790 INFO L87 Difference]: Start difference. First operand 1147 states and 1699 transitions. Second operand has 7 states, 6 states have (on average 17.5) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:40:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:38,925 INFO L93 Difference]: Finished difference Result 2174 states and 3239 transitions. [2025-02-05 15:40:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:40:38,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.5) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 181 [2025-02-05 15:40:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:38,937 INFO L225 Difference]: With dead ends: 2174 [2025-02-05 15:40:38,937 INFO L226 Difference]: Without dead ends: 1157 [2025-02-05 15:40:38,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:38,942 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 2 mSDsluCounter, 4312 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:38,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2025-02-05 15:40:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1151. [2025-02-05 15:40:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 854 states have (on average 1.4929742388758782) internal successors, (1275), 892 states have internal predecessors, (1275), 200 states have call successors, (200), 86 states have call predecessors, (200), 96 states have return successors, (232), 203 states have call predecessors, (232), 198 states have call successors, (232) [2025-02-05 15:40:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1707 transitions. [2025-02-05 15:40:39,005 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1707 transitions. Word has length 181 [2025-02-05 15:40:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:39,005 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1707 transitions. [2025-02-05 15:40:39,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.5) internal successors, (105), 7 states have internal predecessors, (105), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-02-05 15:40:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1707 transitions. [2025-02-05 15:40:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 15:40:39,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:39,012 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:39,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:40:39,013 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:39,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash 443708816, now seen corresponding path program 1 times [2025-02-05 15:40:39,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:39,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936320759] [2025-02-05 15:40:39,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:39,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:40:39,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:40:39,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:39,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-02-05 15:40:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936320759] [2025-02-05 15:40:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936320759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406594386] [2025-02-05 15:40:39,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:39,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:39,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:39,174 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:40:39,176 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:40:39,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:40:39,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:40:39,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:39,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:39,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:39,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-02-05 15:40:39,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:39,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406594386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:39,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:39,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 15:40:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174738024] [2025-02-05 15:40:39,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:39,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:39,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:39,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:39,811 INFO L87 Difference]: Start difference. First operand 1151 states and 1707 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-05 15:40:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:39,947 INFO L93 Difference]: Finished difference Result 3329 states and 5078 transitions. [2025-02-05 15:40:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:39,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 182 [2025-02-05 15:40:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:39,958 INFO L225 Difference]: With dead ends: 3329 [2025-02-05 15:40:39,959 INFO L226 Difference]: Without dead ends: 1138 [2025-02-05 15:40:39,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:39,969 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 724 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:39,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 1768 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-02-05 15:40:40,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2025-02-05 15:40:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 848 states have (on average 1.4870283018867925) internal successors, (1261), 882 states have internal predecessors, (1261), 194 states have call successors, (194), 87 states have call predecessors, (194), 95 states have return successors, (220), 195 states have call predecessors, (220), 192 states have call successors, (220) [2025-02-05 15:40:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1675 transitions. [2025-02-05 15:40:40,030 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1675 transitions. Word has length 182 [2025-02-05 15:40:40,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:40,031 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1675 transitions. [2025-02-05 15:40:40,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-05 15:40:40,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1675 transitions. [2025-02-05 15:40:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 15:40:40,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:40,039 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:40,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:40:40,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-05 15:40:40,243 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:40,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1923631292, now seen corresponding path program 1 times [2025-02-05 15:40:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794245490] [2025-02-05 15:40:40,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:40,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 15:40:40,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 15:40:40,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:40,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-05 15:40:40,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:40,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794245490] [2025-02-05 15:40:40,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794245490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:40,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:40,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:40,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041599179] [2025-02-05 15:40:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:40,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:40,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:40,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:40,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:40,335 INFO L87 Difference]: Start difference. First operand 1138 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-05 15:40:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:40,395 INFO L93 Difference]: Finished difference Result 2241 states and 3333 transitions. [2025-02-05 15:40:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:40,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 198 [2025-02-05 15:40:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:40,406 INFO L225 Difference]: With dead ends: 2241 [2025-02-05 15:40:40,406 INFO L226 Difference]: Without dead ends: 1136 [2025-02-05 15:40:40,411 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:40:40,411 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 826 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:40,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 885 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-02-05 15:40:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1136. [2025-02-05 15:40:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 848 states have (on average 1.4834905660377358) internal successors, (1258), 880 states have internal predecessors, (1258), 192 states have call successors, (192), 87 states have call predecessors, (192), 95 states have return successors, (217), 193 states have call predecessors, (217), 190 states have call successors, (217) [2025-02-05 15:40:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1667 transitions. [2025-02-05 15:40:40,468 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1667 transitions. Word has length 198 [2025-02-05 15:40:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:40,468 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1667 transitions. [2025-02-05 15:40:40,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-05 15:40:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1667 transitions. [2025-02-05 15:40:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 15:40:40,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:40,476 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:40,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:40:40,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:40,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:40,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1925105569, now seen corresponding path program 1 times [2025-02-05 15:40:40,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:40,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272212541] [2025-02-05 15:40:40,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:40,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 15:40:40,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 15:40:40,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:40,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-05 15:40:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272212541] [2025-02-05 15:40:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272212541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514693292] [2025-02-05 15:40:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:40,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:40,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:40,573 INFO L87 Difference]: Start difference. First operand 1136 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 15:40:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:40,655 INFO L93 Difference]: Finished difference Result 2207 states and 3248 transitions. [2025-02-05 15:40:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:40,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 206 [2025-02-05 15:40:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:40,667 INFO L225 Difference]: With dead ends: 2207 [2025-02-05 15:40:40,668 INFO L226 Difference]: Without dead ends: 1130 [2025-02-05 15:40:40,672 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:40:40,673 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 798 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:40,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 862 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-02-05 15:40:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1114. [2025-02-05 15:40:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 840 states have (on average 1.4619047619047618) internal successors, (1228), 858 states have internal predecessors, (1228), 186 states have call successors, (186), 87 states have call predecessors, (186), 87 states have return successors, (195), 183 states have call predecessors, (195), 184 states have call successors, (195) [2025-02-05 15:40:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1609 transitions. [2025-02-05 15:40:40,759 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1609 transitions. Word has length 206 [2025-02-05 15:40:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:40,759 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1609 transitions. [2025-02-05 15:40:40,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 15:40:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1609 transitions. [2025-02-05 15:40:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 15:40:40,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:40,766 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:40,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:40:40,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:40,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1305979296, now seen corresponding path program 1 times [2025-02-05 15:40:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:40,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763119746] [2025-02-05 15:40:40,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:40,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 15:40:40,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 15:40:40,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:40,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:40:41,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763119746] [2025-02-05 15:40:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763119746] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397895307] [2025-02-05 15:40:41,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:41,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:41,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:41,044 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:40:41,046 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:40:41,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 15:40:41,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 15:40:41,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:41,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:41,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:41,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-05 15:40:41,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:41,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397895307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:41,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:41,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:40:41,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775491750] [2025-02-05 15:40:41,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:41,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:41,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:41,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:41,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:40:41,490 INFO L87 Difference]: Start difference. First operand 1114 states and 1609 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:41,546 INFO L93 Difference]: Finished difference Result 2299 states and 3381 transitions. [2025-02-05 15:40:41,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:41,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 222 [2025-02-05 15:40:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:41,558 INFO L225 Difference]: With dead ends: 2299 [2025-02-05 15:40:41,558 INFO L226 Difference]: Without dead ends: 1308 [2025-02-05 15:40:41,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:40:41,563 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 165 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1652 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:40:41,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1652 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-02-05 15:40:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1292. [2025-02-05 15:40:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 990 states have (on average 1.4767676767676767) internal successors, (1462), 1008 states have internal predecessors, (1462), 214 states have call successors, (214), 87 states have call predecessors, (214), 87 states have return successors, (223), 211 states have call predecessors, (223), 212 states have call successors, (223) [2025-02-05 15:40:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1899 transitions. [2025-02-05 15:40:41,682 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1899 transitions. Word has length 222 [2025-02-05 15:40:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:41,683 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1899 transitions. [2025-02-05 15:40:41,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1899 transitions. [2025-02-05 15:40:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 15:40:41,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:41,690 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:41,700 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:40:41,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 15:40:41,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1971864472, now seen corresponding path program 1 times [2025-02-05 15:40:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:41,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142133816] [2025-02-05 15:40:41,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:41,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 15:40:41,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 15:40:41,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:41,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:40:42,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142133816] [2025-02-05 15:40:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142133816] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:42,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948139110] [2025-02-05 15:40:42,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:42,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:42,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:42,156 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:40:42,159 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:40:42,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 15:40:42,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 15:40:42,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:42,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:42,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 1661 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 15:40:42,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-05 15:40:42,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948139110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:42,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:42,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-02-05 15:40:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453773569] [2025-02-05 15:40:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:42,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:40:42,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:42,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:40:42,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:40:42,670 INFO L87 Difference]: Start difference. First operand 1292 states and 1899 transitions. Second operand has 8 states, 6 states have (on average 22.666666666666668) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-05 15:40:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:42,810 INFO L93 Difference]: Finished difference Result 2511 states and 3714 transitions. [2025-02-05 15:40:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:40:42,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.666666666666668) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) Word has length 230 [2025-02-05 15:40:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:42,821 INFO L225 Difference]: With dead ends: 2511 [2025-02-05 15:40:42,821 INFO L226 Difference]: Without dead ends: 1296 [2025-02-05 15:40:42,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:40:42,827 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 4 mSDsluCounter, 4963 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5793 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:42,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5793 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-02-05 15:40:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2025-02-05 15:40:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 992 states have (on average 1.4758064516129032) internal successors, (1464), 1012 states have internal predecessors, (1464), 214 states have call successors, (214), 87 states have call predecessors, (214), 89 states have return successors, (227), 211 states have call predecessors, (227), 212 states have call successors, (227) [2025-02-05 15:40:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1905 transitions. [2025-02-05 15:40:42,920 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1905 transitions. Word has length 230 [2025-02-05 15:40:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:42,921 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1905 transitions. [2025-02-05 15:40:42,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.666666666666668) internal successors, (136), 8 states have internal predecessors, (136), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-05 15:40:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1905 transitions. [2025-02-05 15:40:42,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 15:40:42,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:42,930 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:42,942 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:40:43,133 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,SelfDestructingSolverStorable12 [2025-02-05 15:40:43,134 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:43,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:43,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2042491132, now seen corresponding path program 1 times [2025-02-05 15:40:43,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:43,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872247266] [2025-02-05 15:40:43,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:43,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:43,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 15:40:43,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 15:40:43,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:43,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-05 15:40:43,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:43,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872247266] [2025-02-05 15:40:43,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872247266] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514888316] [2025-02-05 15:40:43,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:43,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:43,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:43,366 INFO L229 MonitoredProcess]: Starting monitored process 8 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:40:43,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:40:43,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 15:40:43,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 15:40:43,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:43,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:43,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:40:43,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-05 15:40:43,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:43,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514888316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:43,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:43,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 15:40:43,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950108303] [2025-02-05 15:40:43,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:43,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:40:43,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:43,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:40:43,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:40:43,882 INFO L87 Difference]: Start difference. First operand 1296 states and 1905 transitions. Second operand has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-02-05 15:40:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:43,993 INFO L93 Difference]: Finished difference Result 2513 states and 3722 transitions. [2025-02-05 15:40:43,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:40:43,994 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 224 [2025-02-05 15:40:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:44,004 INFO L225 Difference]: With dead ends: 2513 [2025-02-05 15:40:44,005 INFO L226 Difference]: Without dead ends: 1300 [2025-02-05 15:40:44,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:40:44,010 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 2 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4133 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:44,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4133 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-02-05 15:40:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2025-02-05 15:40:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 994 states have (on average 1.4748490945674044) internal successors, (1466), 1016 states have internal predecessors, (1466), 214 states have call successors, (214), 87 states have call predecessors, (214), 91 states have return successors, (237), 211 states have call predecessors, (237), 212 states have call successors, (237) [2025-02-05 15:40:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1917 transitions. [2025-02-05 15:40:44,084 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1917 transitions. Word has length 224 [2025-02-05 15:40:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:44,085 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1917 transitions. [2025-02-05 15:40:44,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.6) internal successors, (133), 6 states have internal predecessors, (133), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-02-05 15:40:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1917 transitions. [2025-02-05 15:40:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 15:40:44,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:44,113 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:44,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:44,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:44,314 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:44,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1430451450, now seen corresponding path program 1 times [2025-02-05 15:40:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:44,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830330821] [2025-02-05 15:40:44,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:44,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 15:40:44,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 15:40:44,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:44,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:40:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830330821] [2025-02-05 15:40:44,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830330821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:44,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:44,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:40:44,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220840833] [2025-02-05 15:40:44,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:44,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:40:44,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:44,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:40:44,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:44,605 INFO L87 Difference]: Start difference. First operand 1300 states and 1917 transitions. Second operand has 8 states, 6 states have (on average 22.333333333333332) internal successors, (134), 8 states have internal predecessors, (134), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-05 15:40:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:44,716 INFO L93 Difference]: Finished difference Result 2489 states and 3696 transitions. [2025-02-05 15:40:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:40:44,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.333333333333332) internal successors, (134), 8 states have internal predecessors, (134), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) Word has length 232 [2025-02-05 15:40:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:44,726 INFO L225 Difference]: With dead ends: 2489 [2025-02-05 15:40:44,726 INFO L226 Difference]: Without dead ends: 1300 [2025-02-05 15:40:44,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:40:44,732 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 4 mSDsluCounter, 4969 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5800 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:44,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5800 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-02-05 15:40:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2025-02-05 15:40:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 994 states have (on average 1.4748490945674044) internal successors, (1466), 1016 states have internal predecessors, (1466), 214 states have call successors, (214), 87 states have call predecessors, (214), 91 states have return successors, (235), 211 states have call predecessors, (235), 212 states have call successors, (235) [2025-02-05 15:40:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1915 transitions. [2025-02-05 15:40:44,802 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1915 transitions. Word has length 232 [2025-02-05 15:40:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:44,802 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1915 transitions. [2025-02-05 15:40:44,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.333333333333332) internal successors, (134), 8 states have internal predecessors, (134), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-05 15:40:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1915 transitions. [2025-02-05 15:40:44,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-05 15:40:44,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:44,809 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:44,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:40:44,809 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1371488628, now seen corresponding path program 1 times [2025-02-05 15:40:44,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:44,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499812563] [2025-02-05 15:40:44,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:44,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-05 15:40:44,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-05 15:40:44,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:44,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 15:40:45,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:45,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499812563] [2025-02-05 15:40:45,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499812563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:45,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:45,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:40:45,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784040268] [2025-02-05 15:40:45,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:45,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:40:45,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:45,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:40:45,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:45,061 INFO L87 Difference]: Start difference. First operand 1300 states and 1915 transitions. Second operand has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-02-05 15:40:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:45,180 INFO L93 Difference]: Finished difference Result 2493 states and 3702 transitions. [2025-02-05 15:40:45,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:40:45,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 226 [2025-02-05 15:40:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:45,191 INFO L225 Difference]: With dead ends: 2493 [2025-02-05 15:40:45,191 INFO L226 Difference]: Without dead ends: 1304 [2025-02-05 15:40:45,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:40:45,197 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 3 mSDsluCounter, 4974 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5806 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:45,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5806 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-02-05 15:40:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2025-02-05 15:40:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 996 states have (on average 1.4738955823293172) internal successors, (1468), 1020 states have internal predecessors, (1468), 214 states have call successors, (214), 87 states have call predecessors, (214), 93 states have return successors, (239), 211 states have call predecessors, (239), 212 states have call successors, (239) [2025-02-05 15:40:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1921 transitions. [2025-02-05 15:40:45,256 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1921 transitions. Word has length 226 [2025-02-05 15:40:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:45,256 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1921 transitions. [2025-02-05 15:40:45,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.666666666666668) internal successors, (130), 8 states have internal predecessors, (130), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-02-05 15:40:45,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1921 transitions. [2025-02-05 15:40:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 15:40:45,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:45,263 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:45,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:40:45,263 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:45,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:45,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1803008696, now seen corresponding path program 1 times [2025-02-05 15:40:45,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:45,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950572710] [2025-02-05 15:40:45,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:45,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 15:40:45,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 15:40:45,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:45,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-05 15:40:45,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:45,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950572710] [2025-02-05 15:40:45,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950572710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:45,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:45,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:40:45,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713255920] [2025-02-05 15:40:45,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:45,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:40:45,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:45,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:40:45,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:40:45,474 INFO L87 Difference]: Start difference. First operand 1304 states and 1921 transitions. Second operand has 9 states, 7 states have (on average 19.142857142857142) internal successors, (134), 8 states have internal predecessors, (134), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2025-02-05 15:40:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:45,646 INFO L93 Difference]: Finished difference Result 2487 states and 3690 transitions. [2025-02-05 15:40:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:40:45,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 19.142857142857142) internal successors, (134), 8 states have internal predecessors, (134), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 227 [2025-02-05 15:40:45,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:45,656 INFO L225 Difference]: With dead ends: 2487 [2025-02-05 15:40:45,656 INFO L226 Difference]: Without dead ends: 1304 [2025-02-05 15:40:45,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:45,660 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 7 mSDsluCounter, 5738 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6562 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:45,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6562 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-02-05 15:40:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2025-02-05 15:40:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 996 states have (on average 1.4738955823293172) internal successors, (1468), 1020 states have internal predecessors, (1468), 214 states have call successors, (214), 87 states have call predecessors, (214), 93 states have return successors, (237), 211 states have call predecessors, (237), 212 states have call successors, (237) [2025-02-05 15:40:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1919 transitions. [2025-02-05 15:40:45,720 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1919 transitions. Word has length 227 [2025-02-05 15:40:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:45,720 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1919 transitions. [2025-02-05 15:40:45,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 19.142857142857142) internal successors, (134), 8 states have internal predecessors, (134), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2025-02-05 15:40:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1919 transitions. [2025-02-05 15:40:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-02-05 15:40:45,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:45,727 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:45,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:40:45,727 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:45,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash 816702396, now seen corresponding path program 1 times [2025-02-05 15:40:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:45,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808537348] [2025-02-05 15:40:45,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:45,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-02-05 15:40:45,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-02-05 15:40:45,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:45,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-05 15:40:45,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:45,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808537348] [2025-02-05 15:40:45,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808537348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:45,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:45,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:40:45,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001275809] [2025-02-05 15:40:45,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:45,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:40:45,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:45,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:40:45,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:40:45,948 INFO L87 Difference]: Start difference. First operand 1304 states and 1919 transitions. Second operand has 9 states, 7 states have (on average 20.0) internal successors, (140), 8 states have internal predecessors, (140), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-05 15:40:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:46,117 INFO L93 Difference]: Finished difference Result 2491 states and 3702 transitions. [2025-02-05 15:40:46,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:40:46,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 20.0) internal successors, (140), 8 states have internal predecessors, (140), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 235 [2025-02-05 15:40:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:46,127 INFO L225 Difference]: With dead ends: 2491 [2025-02-05 15:40:46,128 INFO L226 Difference]: Without dead ends: 1308 [2025-02-05 15:40:46,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:46,132 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 4 mSDsluCounter, 5752 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6578 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:46,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6578 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-02-05 15:40:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2025-02-05 15:40:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 998 states have (on average 1.4729458917835672) internal successors, (1470), 1024 states have internal predecessors, (1470), 214 states have call successors, (214), 87 states have call predecessors, (214), 95 states have return successors, (247), 211 states have call predecessors, (247), 212 states have call successors, (247) [2025-02-05 15:40:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1931 transitions. [2025-02-05 15:40:46,186 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1931 transitions. Word has length 235 [2025-02-05 15:40:46,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:46,187 INFO L471 AbstractCegarLoop]: Abstraction has 1308 states and 1931 transitions. [2025-02-05 15:40:46,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 20.0) internal successors, (140), 8 states have internal predecessors, (140), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2025-02-05 15:40:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1931 transitions. [2025-02-05 15:40:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-05 15:40:46,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:46,193 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:46,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:40:46,194 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:46,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -23295142, now seen corresponding path program 1 times [2025-02-05 15:40:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389096454] [2025-02-05 15:40:46,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:46,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-05 15:40:46,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-05 15:40:46,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:46,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389096454] [2025-02-05 15:40:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389096454] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702293884] [2025-02-05 15:40:46,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:46,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:46,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:46,318 INFO L229 MonitoredProcess]: Starting monitored process 9 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:40:46,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 15:40:46,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-05 15:40:46,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-05 15:40:46,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:46,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:46,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:46,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:40:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:46,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702293884] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:40:46,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:40:46,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:40:46,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225578782] [2025-02-05 15:40:46,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:40:46,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:40:46,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:46,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:40:46,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:46,996 INFO L87 Difference]: Start difference. First operand 1308 states and 1931 transitions. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-05 15:40:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:47,188 INFO L93 Difference]: Finished difference Result 3033 states and 4617 transitions. [2025-02-05 15:40:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:40:47,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 236 [2025-02-05 15:40:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:47,204 INFO L225 Difference]: With dead ends: 3033 [2025-02-05 15:40:47,205 INFO L226 Difference]: Without dead ends: 2424 [2025-02-05 15:40:47,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:47,209 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 639 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:47,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 2955 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2025-02-05 15:40:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2376. [2025-02-05 15:40:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2376 states, 1908 states have (on average 1.5241090146750524) internal successors, (2908), 1934 states have internal predecessors, (2908), 372 states have call successors, (372), 87 states have call predecessors, (372), 95 states have return successors, (425), 369 states have call predecessors, (425), 370 states have call successors, (425) [2025-02-05 15:40:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2376 states and 3705 transitions. [2025-02-05 15:40:47,307 INFO L78 Accepts]: Start accepts. Automaton has 2376 states and 3705 transitions. Word has length 236 [2025-02-05 15:40:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:47,307 INFO L471 AbstractCegarLoop]: Abstraction has 2376 states and 3705 transitions. [2025-02-05 15:40:47,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-05 15:40:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2376 states and 3705 transitions. [2025-02-05 15:40:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-02-05 15:40:47,319 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:47,320 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:47,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 15:40:47,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:47,521 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:47,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2006642736, now seen corresponding path program 1 times [2025-02-05 15:40:47,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:47,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94491514] [2025-02-05 15:40:47,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:47,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-02-05 15:40:47,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-02-05 15:40:47,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:47,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:47,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94491514] [2025-02-05 15:40:47,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94491514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:47,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124723469] [2025-02-05 15:40:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:47,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:47,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:47,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:47,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:47,605 INFO L87 Difference]: Start difference. First operand 2376 states and 3705 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:47,681 INFO L93 Difference]: Finished difference Result 5527 states and 8745 transitions. [2025-02-05 15:40:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:47,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 233 [2025-02-05 15:40:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:47,709 INFO L225 Difference]: With dead ends: 5527 [2025-02-05 15:40:47,710 INFO L226 Difference]: Without dead ends: 3384 [2025-02-05 15:40:47,718 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:40:47,719 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 163 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1700 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:40:47,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1700 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2025-02-05 15:40:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3368. [2025-02-05 15:40:47,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 2742 states have (on average 1.5353756382202772) internal successors, (4210), 2768 states have internal predecessors, (4210), 530 states have call successors, (530), 87 states have call predecessors, (530), 95 states have return successors, (603), 527 states have call predecessors, (603), 528 states have call successors, (603) [2025-02-05 15:40:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5343 transitions. [2025-02-05 15:40:47,902 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5343 transitions. Word has length 233 [2025-02-05 15:40:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:47,903 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5343 transitions. [2025-02-05 15:40:47,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5343 transitions. [2025-02-05 15:40:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-02-05 15:40:47,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:47,922 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:47,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:40:47,922 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:47,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash 572938126, now seen corresponding path program 1 times [2025-02-05 15:40:47,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:47,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262065880] [2025-02-05 15:40:47,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:47,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:47,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-05 15:40:47,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-05 15:40:47,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:47,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:48,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:48,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262065880] [2025-02-05 15:40:48,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262065880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:48,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:48,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:48,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993761069] [2025-02-05 15:40:48,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:48,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:48,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:48,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:48,029 INFO L87 Difference]: Start difference. First operand 3368 states and 5343 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:48,167 INFO L93 Difference]: Finished difference Result 7999 states and 12805 transitions. [2025-02-05 15:40:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:48,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 234 [2025-02-05 15:40:48,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:48,201 INFO L225 Difference]: With dead ends: 7999 [2025-02-05 15:40:48,201 INFO L226 Difference]: Without dead ends: 4986 [2025-02-05 15:40:48,215 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:40:48,216 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 161 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1682 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:40:48,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1682 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2025-02-05 15:40:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 4970. [2025-02-05 15:40:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4970 states, 4106 states have (on average 1.547491475888943) internal successors, (6354), 4132 states have internal predecessors, (6354), 768 states have call successors, (768), 87 states have call predecessors, (768), 95 states have return successors, (841), 765 states have call predecessors, (841), 766 states have call successors, (841) [2025-02-05 15:40:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4970 states to 4970 states and 7963 transitions. [2025-02-05 15:40:48,413 INFO L78 Accepts]: Start accepts. Automaton has 4970 states and 7963 transitions. Word has length 234 [2025-02-05 15:40:48,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:48,414 INFO L471 AbstractCegarLoop]: Abstraction has 4970 states and 7963 transitions. [2025-02-05 15:40:48,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 4970 states and 7963 transitions. [2025-02-05 15:40:48,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-02-05 15:40:48,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:48,440 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:48,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:40:48,440 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:48,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash 323729680, now seen corresponding path program 1 times [2025-02-05 15:40:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:48,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016187598] [2025-02-05 15:40:48,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:48,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:48,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-02-05 15:40:48,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-02-05 15:40:48,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:48,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:48,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016187598] [2025-02-05 15:40:48,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016187598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:48,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:48,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:48,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624159103] [2025-02-05 15:40:48,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:48,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:48,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:48,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:48,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:48,525 INFO L87 Difference]: Start difference. First operand 4970 states and 7963 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 15:40:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:48,699 INFO L93 Difference]: Finished difference Result 11761 states and 19015 transitions. [2025-02-05 15:40:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:48,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 242 [2025-02-05 15:40:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:48,734 INFO L225 Difference]: With dead ends: 11761 [2025-02-05 15:40:48,734 INFO L226 Difference]: Without dead ends: 7454 [2025-02-05 15:40:48,749 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:40:48,751 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 159 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1669 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:40:48,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7454 states. [2025-02-05 15:40:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7454 to 7438. [2025-02-05 15:40:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7438 states, 6250 states have (on average 1.55776) internal successors, (9736), 6276 states have internal predecessors, (9736), 1092 states have call successors, (1092), 87 states have call predecessors, (1092), 95 states have return successors, (1197), 1089 states have call predecessors, (1197), 1090 states have call successors, (1197) [2025-02-05 15:40:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7438 states to 7438 states and 12025 transitions. [2025-02-05 15:40:49,019 INFO L78 Accepts]: Start accepts. Automaton has 7438 states and 12025 transitions. Word has length 242 [2025-02-05 15:40:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:49,020 INFO L471 AbstractCegarLoop]: Abstraction has 7438 states and 12025 transitions. [2025-02-05 15:40:49,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 15:40:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 7438 states and 12025 transitions. [2025-02-05 15:40:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 15:40:49,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:49,050 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:49,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:40:49,050 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:49,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -92001904, now seen corresponding path program 1 times [2025-02-05 15:40:49,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:49,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175244661] [2025-02-05 15:40:49,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:49,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:49,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 15:40:49,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 15:40:49,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:49,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:49,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175244661] [2025-02-05 15:40:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175244661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:49,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:49,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:49,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369919728] [2025-02-05 15:40:49,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:49,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:49,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:49,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:49,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:49,181 INFO L87 Difference]: Start difference. First operand 7438 states and 12025 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 15:40:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:49,384 INFO L93 Difference]: Finished difference Result 17703 states and 28857 transitions. [2025-02-05 15:40:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 243 [2025-02-05 15:40:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:49,437 INFO L225 Difference]: With dead ends: 17703 [2025-02-05 15:40:49,437 INFO L226 Difference]: Without dead ends: 11438 [2025-02-05 15:40:49,462 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:40:49,463 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 157 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1669 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:40:49,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1669 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11438 states. [2025-02-05 15:40:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11438 to 11422. [2025-02-05 15:40:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11422 states, 9744 states have (on average 1.5665024630541873) internal successors, (15264), 9770 states have internal predecessors, (15264), 1582 states have call successors, (1582), 87 states have call predecessors, (1582), 95 states have return successors, (1739), 1579 states have call predecessors, (1739), 1580 states have call successors, (1739) [2025-02-05 15:40:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11422 states to 11422 states and 18585 transitions. [2025-02-05 15:40:49,954 INFO L78 Accepts]: Start accepts. Automaton has 11422 states and 18585 transitions. Word has length 243 [2025-02-05 15:40:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:49,955 INFO L471 AbstractCegarLoop]: Abstraction has 11422 states and 18585 transitions. [2025-02-05 15:40:49,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 15:40:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 11422 states and 18585 transitions. [2025-02-05 15:40:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-05 15:40:49,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:49,993 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:49,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:40:49,994 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:49,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1422320526, now seen corresponding path program 1 times [2025-02-05 15:40:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:49,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934338699] [2025-02-05 15:40:49,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:50,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-05 15:40:50,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-05 15:40:50,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:50,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:50,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:50,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934338699] [2025-02-05 15:40:50,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934338699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:50,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:50,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:50,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337795158] [2025-02-05 15:40:50,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:50,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:50,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:50,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:50,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:50,082 INFO L87 Difference]: Start difference. First operand 11422 states and 18585 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:50,611 INFO L93 Difference]: Finished difference Result 27577 states and 45141 transitions. [2025-02-05 15:40:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 237 [2025-02-05 15:40:50,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:50,701 INFO L225 Difference]: With dead ends: 27577 [2025-02-05 15:40:50,702 INFO L226 Difference]: Without dead ends: 18110 [2025-02-05 15:40:50,735 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:40:50,736 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 155 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1676 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:40:50,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1676 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:50,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18110 states. [2025-02-05 15:40:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18110 to 18094. [2025-02-05 15:40:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18094 states, 15430 states have (on average 1.5640959170447182) internal successors, (24134), 15456 states have internal predecessors, (24134), 2568 states have call successors, (2568), 87 states have call predecessors, (2568), 95 states have return successors, (2813), 2565 states have call predecessors, (2813), 2566 states have call successors, (2813) [2025-02-05 15:40:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18094 states to 18094 states and 29515 transitions. [2025-02-05 15:40:51,628 INFO L78 Accepts]: Start accepts. Automaton has 18094 states and 29515 transitions. Word has length 237 [2025-02-05 15:40:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:51,629 INFO L471 AbstractCegarLoop]: Abstraction has 18094 states and 29515 transitions. [2025-02-05 15:40:51,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 18094 states and 29515 transitions. [2025-02-05 15:40:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 15:40:51,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:51,690 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 15:40:51,690 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:51,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1483354769, now seen corresponding path program 1 times [2025-02-05 15:40:51,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:51,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793941928] [2025-02-05 15:40:51,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:51,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:51,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 15:40:51,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 15:40:51,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:51,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:51,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793941928] [2025-02-05 15:40:51,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793941928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:51,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:51,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774650869] [2025-02-05 15:40:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:51,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:51,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:51,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:51,772 INFO L87 Difference]: Start difference. First operand 18094 states and 29515 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 15:40:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:52,387 INFO L93 Difference]: Finished difference Result 45273 states and 74461 transitions. [2025-02-05 15:40:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:52,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 245 [2025-02-05 15:40:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:52,520 INFO L225 Difference]: With dead ends: 45273 [2025-02-05 15:40:52,520 INFO L226 Difference]: Without dead ends: 30114 [2025-02-05 15:40:52,556 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:40:52,557 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 153 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1682 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:40:52,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1682 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30114 states. [2025-02-05 15:40:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30114 to 30098. [2025-02-05 15:40:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30098 states, 25790 states have (on average 1.5701434664598681) internal successors, (40494), 25816 states have internal predecessors, (40494), 4212 states have call successors, (4212), 87 states have call predecessors, (4212), 95 states have return successors, (4613), 4209 states have call predecessors, (4613), 4210 states have call successors, (4613) [2025-02-05 15:40:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30098 states to 30098 states and 49319 transitions. [2025-02-05 15:40:53,632 INFO L78 Accepts]: Start accepts. Automaton has 30098 states and 49319 transitions. Word has length 245 [2025-02-05 15:40:53,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:53,634 INFO L471 AbstractCegarLoop]: Abstraction has 30098 states and 49319 transitions. [2025-02-05 15:40:53,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 15:40:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 30098 states and 49319 transitions. [2025-02-05 15:40:53,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-02-05 15:40:53,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:53,735 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:53,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 15:40:53,735 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:53,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:53,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1787313709, now seen corresponding path program 1 times [2025-02-05 15:40:53,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:53,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660134395] [2025-02-05 15:40:53,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:53,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:53,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-05 15:40:53,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-05 15:40:53,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:53,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660134395] [2025-02-05 15:40:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660134395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:53,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:53,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944154795] [2025-02-05 15:40:53,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:53,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:53,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:53,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:53,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:53,821 INFO L87 Difference]: Start difference. First operand 30098 states and 49319 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:55,321 INFO L93 Difference]: Finished difference Result 72487 states and 118263 transitions. [2025-02-05 15:40:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:55,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 239 [2025-02-05 15:40:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:55,550 INFO L225 Difference]: With dead ends: 72487 [2025-02-05 15:40:55,551 INFO L226 Difference]: Without dead ends: 47578 [2025-02-05 15:40:55,621 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:40:55,621 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 151 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1671 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:40:55,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1671 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47578 states. [2025-02-05 15:40:57,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47578 to 47562. [2025-02-05 15:40:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47562 states, 40848 states have (on average 1.5436741088915003) internal successors, (63056), 40874 states have internal predecessors, (63056), 6618 states have call successors, (6618), 87 states have call predecessors, (6618), 95 states have return successors, (7307), 6615 states have call predecessors, (7307), 6616 states have call successors, (7307) [2025-02-05 15:40:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47562 states to 47562 states and 76981 transitions. [2025-02-05 15:40:57,793 INFO L78 Accepts]: Start accepts. Automaton has 47562 states and 76981 transitions. Word has length 239 [2025-02-05 15:40:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:57,794 INFO L471 AbstractCegarLoop]: Abstraction has 47562 states and 76981 transitions. [2025-02-05 15:40:57,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 47562 states and 76981 transitions. [2025-02-05 15:40:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-02-05 15:40:57,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:57,961 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:57,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 15:40:57,963 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:57,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1883850735, now seen corresponding path program 1 times [2025-02-05 15:40:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:57,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573814549] [2025-02-05 15:40:57,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:57,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:57,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-02-05 15:40:58,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-02-05 15:40:58,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:58,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:40:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:58,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573814549] [2025-02-05 15:40:58,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573814549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:58,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:58,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589747282] [2025-02-05 15:40:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:58,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:58,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:58,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:58,057 INFO L87 Difference]: Start difference. First operand 47562 states and 76981 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:40:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:59,990 INFO L93 Difference]: Finished difference Result 125403 states and 203769 transitions. [2025-02-05 15:40:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:59,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 240 [2025-02-05 15:40:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:00,482 INFO L225 Difference]: With dead ends: 125403 [2025-02-05 15:41:00,482 INFO L226 Difference]: Without dead ends: 84638 [2025-02-05 15:41:00,645 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:41:00,645 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 149 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1673 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:41:00,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1673 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84638 states. [2025-02-05 15:41:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84638 to 84622. [2025-02-05 15:41:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84622 states, 73008 states have (on average 1.5439951786105632) internal successors, (112724), 73034 states have internal predecessors, (112724), 11518 states have call successors, (11518), 87 states have call predecessors, (11518), 95 states have return successors, (12755), 11515 states have call predecessors, (12755), 11516 states have call successors, (12755) [2025-02-05 15:41:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84622 states to 84622 states and 136997 transitions. [2025-02-05 15:41:04,156 INFO L78 Accepts]: Start accepts. Automaton has 84622 states and 136997 transitions. Word has length 240 [2025-02-05 15:41:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:04,157 INFO L471 AbstractCegarLoop]: Abstraction has 84622 states and 136997 transitions. [2025-02-05 15:41:04,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:41:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 84622 states and 136997 transitions. [2025-02-05 15:41:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-05 15:41:04,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:04,440 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:04,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 15:41:04,441 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:04,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:04,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2075742540, now seen corresponding path program 1 times [2025-02-05 15:41:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:04,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060963258] [2025-02-05 15:41:04,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:04,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 15:41:04,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 15:41:04,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:04,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:41:04,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:04,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060963258] [2025-02-05 15:41:04,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060963258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:04,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:04,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:04,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990766036] [2025-02-05 15:41:04,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:04,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:04,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:04,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:04,552 INFO L87 Difference]: Start difference. First operand 84622 states and 136997 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:41:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:08,255 INFO L93 Difference]: Finished difference Result 229167 states and 373053 transitions. [2025-02-05 15:41:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:08,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 241 [2025-02-05 15:41:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:09,172 INFO L225 Difference]: With dead ends: 229167 [2025-02-05 15:41:09,172 INFO L226 Difference]: Without dead ends: 153676 [2025-02-05 15:41:09,302 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:41:09,302 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 147 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1674 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:41:09,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1674 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153676 states. [2025-02-05 15:41:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153676 to 153660. [2025-02-05 15:41:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153660 states, 133020 states have (on average 1.548052924372275) internal successors, (205922), 133046 states have internal predecessors, (205922), 20544 states have call successors, (20544), 87 states have call predecessors, (20544), 95 states have return successors, (22845), 20541 states have call predecessors, (22845), 20542 states have call successors, (22845) [2025-02-05 15:41:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153660 states to 153660 states and 249311 transitions. [2025-02-05 15:41:14,950 INFO L78 Accepts]: Start accepts. Automaton has 153660 states and 249311 transitions. Word has length 241 [2025-02-05 15:41:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:14,951 INFO L471 AbstractCegarLoop]: Abstraction has 153660 states and 249311 transitions. [2025-02-05 15:41:14,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 15:41:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 153660 states and 249311 transitions. [2025-02-05 15:41:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-05 15:41:15,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:15,246 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:15,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 15:41:15,246 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__VerifyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:15,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2123451853, now seen corresponding path program 1 times [2025-02-05 15:41:15,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:15,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122933860] [2025-02-05 15:41:15,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:15,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:15,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 15:41:15,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 15:41:15,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:15,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-02-05 15:41:15,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122933860] [2025-02-05 15:41:15,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122933860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:15,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:15,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:41:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810387027] [2025-02-05 15:41:15,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:15,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:15,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:15,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:41:15,331 INFO L87 Difference]: Start difference. First operand 153660 states and 249311 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30)