./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product22.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_spec1_product22.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 42f22b71ca501045e9e0edcb0da831d4df6c9a8e36f5c60b39b69b3cb971731d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:41:48,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:41:48,925 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:41:48,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:41:48,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:41:48,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:41:48,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:41:48,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:41:48,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:41:48,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:41:48,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:41:48,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:41:48,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:41:48,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:41:48,956 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:41:48,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:41:48,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:41:48,956 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:41:48,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:41:48,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:41:48,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:41:48,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:41:48,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:41:48,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:41:48,957 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:41:48,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:41:48,957 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:41:48,957 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:41:48,957 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:41:48,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:41:48,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:41:48,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:41:48,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:41:48,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:41:48,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:41:48,959 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:41:48,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:41:48,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:41:48,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:41:48,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:41:48,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:41:48,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:41:48,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:41:48,960 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 -> 42f22b71ca501045e9e0edcb0da831d4df6c9a8e36f5c60b39b69b3cb971731d [2025-02-05 15:41:49,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:41:49,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:41:49,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:41:49,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:41:49,278 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:41:49,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product22.cil.c [2025-02-05 15:41:50,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e84f3d169/5c43c3fa52ac455b8a3d2159d9885b64/FLAG662e0fedb [2025-02-05 15:41:51,095 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:41:51,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product22.cil.c [2025-02-05 15:41:51,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e84f3d169/5c43c3fa52ac455b8a3d2159d9885b64/FLAG662e0fedb [2025-02-05 15:41:51,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e84f3d169/5c43c3fa52ac455b8a3d2159d9885b64 [2025-02-05 15:41:51,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:41:51,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:41:51,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:41:51,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:41:51,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:41:51,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:51,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e69d2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51, skipping insertion in model container [2025-02-05 15:41:51,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:51,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:41:51,725 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_spec1_product22.cil.c[33239,33252] [2025-02-05 15:41:51,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:41:51,821 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:41:51,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-02-05 15:41:51,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [414] [2025-02-05 15:41:51,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [538] [2025-02-05 15:41:51,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [767] [2025-02-05 15:41:51,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [784] [2025-02-05 15:41:51,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1189] [2025-02-05 15:41:51,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [1227] [2025-02-05 15:41:51,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1257] [2025-02-05 15:41:51,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1557] [2025-02-05 15:41:51,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1566] [2025-02-05 15:41:51,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2637] [2025-02-05 15:41:51,923 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_spec1_product22.cil.c[33239,33252] [2025-02-05 15:41:51,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:41:51,994 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:41:51,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51 WrapperNode [2025-02-05 15:41:51,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:41:51,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:41:51,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:41:51,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:41:52,001 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:41:51" (1/1) ... [2025-02-05 15:41:52,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,081 INFO L138 Inliner]: procedures = 128, calls = 190, calls flagged for inlining = 59, calls inlined = 54, statements flattened = 1021 [2025-02-05 15:41:52,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:41:52,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:41:52,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:41:52,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:41:52,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,125 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:41:52,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:41:52,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:41:52,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:41:52,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:41:52,157 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (1/1) ... [2025-02-05 15:41:52,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:41:52,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:52,201 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:41:52,204 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:41:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:41:52,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:41:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:41:52,228 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:41:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:41:52,228 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:41:52,228 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:41:52,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:41:52,229 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:41:52,229 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:41:52,229 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:41:52,229 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:41:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:41:52,231 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:41:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:41:52,231 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:41:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:41:52,231 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:41:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:41:52,232 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:41:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:41:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:41:52,232 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:41:52,232 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:41:52,233 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:41:52,234 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:41:52,234 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:41:52,234 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:41:52,234 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:41:52,234 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:41:52,234 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:41:52,234 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:41:52,234 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:41:52,234 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:41:52,235 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:41:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:41:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:41:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:41:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:41:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:41:52,235 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:41:52,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:41:52,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:41:52,432 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:41:52,436 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:41:52,781 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L491-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~3#1; [2025-02-05 15:41:52,781 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2614-1: getClientId_#res#1 := getClientId_~retValue_acc~38#1; [2025-02-05 15:41:52,781 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2567-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~37#1; [2025-02-05 15:41:52,781 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2179-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~31#1; [2025-02-05 15:41:52,781 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L833-1: getEmailId_#res#1 := getEmailId_~retValue_acc~9#1; [2025-02-05 15:41:52,781 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L511-1: isReadable_#res#1 := isReadable_~retValue_acc~4#1; [2025-02-05 15:41:52,782 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2495-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~36#1; [2025-02-05 15:41:52,782 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2132-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~30#1; [2025-02-05 15:41:52,782 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2892-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~43#1; [2025-02-05 15:41:52,815 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L907: #res := ~retValue_acc~11; [2025-02-05 15:41:52,841 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2271: #res#1 := ~retValue_acc~33#1; [2025-02-05 15:41:52,841 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2226-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~32#1; [2025-02-05 15:41:52,871 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L535-1: createEmail_#res#1 := createEmail_~retValue_acc~6#1; [2025-02-05 15:41:52,882 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1022: #res := ~retValue_acc~14; [2025-02-05 15:41:53,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2441-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~35#1; [2025-02-05 15:41:53,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2334-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~34#1; [2025-02-05 15:41:53,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2849-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~40#1; [2025-02-05 15:41:53,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~41#1; [2025-02-05 15:41:53,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2867-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~42#1; [2025-02-05 15:41:53,137 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1224-1: valid_product_#res#1 := valid_product_~retValue_acc~20#1; [2025-02-05 15:41:53,143 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L870: #res := ~retValue_acc~10; [2025-02-05 15:41:53,169 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059: #res := ~retValue_acc~15; [2025-02-05 15:41:53,293 INFO L? ?]: Removed 436 outVars from TransFormulas that were not future-live. [2025-02-05 15:41:53,293 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:41:53,310 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:41:53,310 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:41:53,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:41:53 BoogieIcfgContainer [2025-02-05 15:41:53,311 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:41:53,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:41:53,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:41:53,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:41:53,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:41:51" (1/3) ... [2025-02-05 15:41:53,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a3f427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:41:53, skipping insertion in model container [2025-02-05 15:41:53,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:41:51" (2/3) ... [2025-02-05 15:41:53,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a3f427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:41:53, skipping insertion in model container [2025-02-05 15:41:53,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:41:53" (3/3) ... [2025-02-05 15:41:53,322 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product22.cil.c [2025-02-05 15:41:53,334 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:41:53,339 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product22.cil.c that has 19 procedures, 320 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:41:53,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:41:53,420 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;@232cef4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:41:53,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:41:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 250 states have (on average 1.528) internal successors, (382), 254 states have internal predecessors, (382), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-05 15:41:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 15:41:53,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:53,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:53,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1800767161, now seen corresponding path program 1 times [2025-02-05 15:41:53,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:53,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285791227] [2025-02-05 15:41:53,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:53,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:53,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 15:41:53,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:41:53,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:53,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:41:54,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:54,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285791227] [2025-02-05 15:41:54,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285791227] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:54,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100569810] [2025-02-05 15:41:54,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:54,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:54,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:54,145 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:41:54,146 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:41:54,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 15:41:54,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:41:54,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:54,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:54,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:41:54,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:54,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:54,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100569810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:54,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:54,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:41:54,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672760431] [2025-02-05 15:41:54,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:54,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:41:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:54,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:41:54,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:54,560 INFO L87 Difference]: Start difference. First operand has 320 states, 250 states have (on average 1.528) internal successors, (382), 254 states have internal predecessors, (382), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:41:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:54,613 INFO L93 Difference]: Finished difference Result 482 states and 712 transitions. [2025-02-05 15:41:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:41:54,614 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2025-02-05 15:41:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:54,630 INFO L225 Difference]: With dead ends: 482 [2025-02-05 15:41:54,630 INFO L226 Difference]: Without dead ends: 313 [2025-02-05 15:41:54,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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:41:54,641 INFO L435 NwaCegarLoop]: 479 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, 479 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:41:54,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-02-05 15:41:54,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-02-05 15:41:54,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 244 states have (on average 1.5245901639344261) internal successors, (372), 247 states have internal predecessors, (372), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-05 15:41:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 471 transitions. [2025-02-05 15:41:54,715 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 471 transitions. Word has length 89 [2025-02-05 15:41:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:54,716 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 471 transitions. [2025-02-05 15:41:54,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:41:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 471 transitions. [2025-02-05 15:41:54,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 15:41:54,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:54,726 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:54,736 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:41:54,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:41:54,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:54,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 430338705, now seen corresponding path program 1 times [2025-02-05 15:41:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86042879] [2025-02-05 15:41:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:54,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 15:41:54,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 15:41:54,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:54,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-05 15:41:55,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:55,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86042879] [2025-02-05 15:41:55,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86042879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:55,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999541915] [2025-02-05 15:41:55,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:55,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:55,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:55,236 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:41:55,238 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:41:55,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 15:41:55,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 15:41:55,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:55,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:41:55,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:55,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:55,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999541915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:55,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:55,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:41:55,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849027797] [2025-02-05 15:41:55,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:55,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:55,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:55,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:55,592 INFO L87 Difference]: Start difference. First operand 313 states and 471 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:41:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:55,630 INFO L93 Difference]: Finished difference Result 471 states and 693 transitions. [2025-02-05 15:41:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:55,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2025-02-05 15:41:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:55,636 INFO L225 Difference]: With dead ends: 471 [2025-02-05 15:41:55,636 INFO L226 Difference]: Without dead ends: 315 [2025-02-05 15:41:55,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:55,642 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 0 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 938 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:41:55,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-05 15:41:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-02-05 15:41:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 246 states have (on average 1.5203252032520325) internal successors, (374), 249 states have internal predecessors, (374), 50 states have call successors, (50), 18 states have call predecessors, (50), 18 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-05 15:41:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 473 transitions. [2025-02-05 15:41:55,678 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 473 transitions. Word has length 90 [2025-02-05 15:41:55,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:55,680 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 473 transitions. [2025-02-05 15:41:55,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:41:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 473 transitions. [2025-02-05 15:41:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:41:55,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:55,686 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:55,696 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:41:55,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:55,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:55,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1076761837, now seen corresponding path program 1 times [2025-02-05 15:41:55,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:55,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020183655] [2025-02-05 15:41:55,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:55,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:41:55,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:41:55,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:55,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020183655] [2025-02-05 15:41:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020183655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427728065] [2025-02-05 15:41:56,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:56,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:56,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:56,137 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:41:56,140 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:41:56,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:41:56,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:41:56,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:56,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:56,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:41:56,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:41:56,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:56,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427728065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:56,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:56,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:41:56,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454310173] [2025-02-05 15:41:56,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:56,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:41:56,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:56,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:41:56,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:56,461 INFO L87 Difference]: Start difference. First operand 315 states and 473 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:41:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:56,495 INFO L93 Difference]: Finished difference Result 664 states and 1012 transitions. [2025-02-05 15:41:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:41:56,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-02-05 15:41:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:56,499 INFO L225 Difference]: With dead ends: 664 [2025-02-05 15:41:56,499 INFO L226 Difference]: Without dead ends: 376 [2025-02-05 15:41:56,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:41:56,504 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 115 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 913 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:56,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 913 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:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-05 15:41:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2025-02-05 15:41:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 288 states have (on average 1.5381944444444444) internal successors, (443), 291 states have internal predecessors, (443), 61 states have call successors, (61), 18 states have call predecessors, (61), 18 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 15:41:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 564 transitions. [2025-02-05 15:41:56,538 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 564 transitions. Word has length 98 [2025-02-05 15:41:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:56,539 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 564 transitions. [2025-02-05 15:41:56,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:41:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 564 transitions. [2025-02-05 15:41:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:41:56,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:56,545 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:56,557 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:41:56,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:56,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:56,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash 266944475, now seen corresponding path program 1 times [2025-02-05 15:41:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807993955] [2025-02-05 15:41:56,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:56,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:56,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:41:56,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:41:56,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:56,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:56,932 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:56,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807993955] [2025-02-05 15:41:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807993955] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690580964] [2025-02-05 15:41:56,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:56,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:56,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:56,936 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:41:56,938 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:41:57,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:41:57,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:41:57,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:57,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:57,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:41:57,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:41:57,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690580964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:57,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:41:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363771096] [2025-02-05 15:41:57,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:57,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:57,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:57,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:41:57,305 INFO L87 Difference]: Start difference. First operand 368 states and 564 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:57,381 INFO L93 Difference]: Finished difference Result 727 states and 1118 transitions. [2025-02-05 15:41:57,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:57,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2025-02-05 15:41:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:57,385 INFO L225 Difference]: With dead ends: 727 [2025-02-05 15:41:57,385 INFO L226 Difference]: Without dead ends: 370 [2025-02-05 15:41:57,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:41:57,387 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 2 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:57,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1841 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-05 15:41:57,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-02-05 15:41:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 289 states have (on average 1.5363321799307958) internal successors, (444), 293 states have internal predecessors, (444), 61 states have call successors, (61), 18 states have call predecessors, (61), 19 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2025-02-05 15:41:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 567 transitions. [2025-02-05 15:41:57,412 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 567 transitions. Word has length 99 [2025-02-05 15:41:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:57,412 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 567 transitions. [2025-02-05 15:41:57,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 567 transitions. [2025-02-05 15:41:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 15:41:57,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:57,418 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:57,428 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:41:57,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:57,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:57,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:57,621 INFO L85 PathProgramCache]: Analyzing trace with hash -384902229, now seen corresponding path program 1 times [2025-02-05 15:41:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717026299] [2025-02-05 15:41:57,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:57,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:57,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:41:57,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:41:57,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:57,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 15:41:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717026299] [2025-02-05 15:41:57,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717026299] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490349731] [2025-02-05 15:41:57,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:57,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:57,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:57,801 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:41:57,804 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:41:57,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:41:58,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:41:58,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:58,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:58,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:41:58,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:41:58,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:41:58,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490349731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:58,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:41:58,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:41:58,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734795688] [2025-02-05 15:41:58,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:58,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:58,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:58,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:58,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:58,149 INFO L87 Difference]: Start difference. First operand 370 states and 567 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:58,243 INFO L93 Difference]: Finished difference Result 729 states and 1123 transitions. [2025-02-05 15:41:58,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:58,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2025-02-05 15:41:58,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:58,247 INFO L225 Difference]: With dead ends: 729 [2025-02-05 15:41:58,247 INFO L226 Difference]: Without dead ends: 372 [2025-02-05 15:41:58,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:41:58,249 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 2 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:58,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1827 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:41:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-05 15:41:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-02-05 15:41:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 290 states have (on average 1.5344827586206897) internal successors, (445), 295 states have internal predecessors, (445), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-02-05 15:41:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 573 transitions. [2025-02-05 15:41:58,277 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 573 transitions. Word has length 100 [2025-02-05 15:41:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:58,278 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 573 transitions. [2025-02-05 15:41:58,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 573 transitions. [2025-02-05 15:41:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 15:41:58,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:58,282 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:58,292 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:41:58,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:58,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:58,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash 48613922, now seen corresponding path program 1 times [2025-02-05 15:41:58,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:58,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903194257] [2025-02-05 15:41:58,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:58,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:41:58,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:41:58,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:58,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:41:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903194257] [2025-02-05 15:41:58,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903194257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:58,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:58,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:58,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451988624] [2025-02-05 15:41:58,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:58,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:58,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:58,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:58,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:58,632 INFO L87 Difference]: Start difference. First operand 372 states and 573 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:58,678 INFO L93 Difference]: Finished difference Result 721 states and 1114 transitions. [2025-02-05 15:41:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:58,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2025-02-05 15:41:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:58,684 INFO L225 Difference]: With dead ends: 721 [2025-02-05 15:41:58,684 INFO L226 Difference]: Without dead ends: 372 [2025-02-05 15:41:58,686 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:41:58,687 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 2 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:58,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1845 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-05 15:41:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-02-05 15:41:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 290 states have (on average 1.5344827586206897) internal successors, (445), 295 states have internal predecessors, (445), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2025-02-05 15:41:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 572 transitions. [2025-02-05 15:41:58,717 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 572 transitions. Word has length 101 [2025-02-05 15:41:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:58,718 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 572 transitions. [2025-02-05 15:41:58,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 572 transitions. [2025-02-05 15:41:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 15:41:58,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:58,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:58,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:41:58,721 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:58,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash 613507476, now seen corresponding path program 2 times [2025-02-05 15:41:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728687357] [2025-02-05 15:41:58,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:41:58,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:58,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-02-05 15:41:58,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:41:58,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 15:41:58,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:58,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:58,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728687357] [2025-02-05 15:41:58,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728687357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:58,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:58,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:58,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142480972] [2025-02-05 15:41:58,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:58,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:58,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:58,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:58,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:58,869 INFO L87 Difference]: Start difference. First operand 372 states and 572 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:58,927 INFO L93 Difference]: Finished difference Result 719 states and 1109 transitions. [2025-02-05 15:41:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:58,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2025-02-05 15:41:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:58,933 INFO L225 Difference]: With dead ends: 719 [2025-02-05 15:41:58,933 INFO L226 Difference]: Without dead ends: 372 [2025-02-05 15:41:58,935 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:41:58,935 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 2 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:58,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1831 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-05 15:41:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-02-05 15:41:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 290 states have (on average 1.5344827586206897) internal successors, (445), 295 states have internal predecessors, (445), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (65), 60 states have call predecessors, (65), 60 states have call successors, (65) [2025-02-05 15:41:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 571 transitions. [2025-02-05 15:41:58,970 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 571 transitions. Word has length 102 [2025-02-05 15:41:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:58,970 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 571 transitions. [2025-02-05 15:41:58,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 571 transitions. [2025-02-05 15:41:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:41:58,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:58,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:58,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:41:58,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:58,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash 578667373, now seen corresponding path program 3 times [2025-02-05 15:41:58,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:58,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401326609] [2025-02-05 15:41:58,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:41:58,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:58,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 103 statements into 3 equivalence classes. [2025-02-05 15:41:59,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 91 of 103 statements. [2025-02-05 15:41:59,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:41:59,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:59,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401326609] [2025-02-05 15:41:59,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401326609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:59,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:59,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071594651] [2025-02-05 15:41:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:59,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:59,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:59,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:59,107 INFO L87 Difference]: Start difference. First operand 372 states and 571 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:59,179 INFO L93 Difference]: Finished difference Result 721 states and 1115 transitions. [2025-02-05 15:41:59,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:59,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2025-02-05 15:41:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:59,183 INFO L225 Difference]: With dead ends: 721 [2025-02-05 15:41:59,183 INFO L226 Difference]: Without dead ends: 374 [2025-02-05 15:41:59,184 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:41:59,185 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:59,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1842 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-05 15:41:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-02-05 15:41:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 291 states have (on average 1.5326460481099657) internal successors, (446), 297 states have internal predecessors, (446), 61 states have call successors, (61), 18 states have call predecessors, (61), 21 states have return successors, (70), 60 states have call predecessors, (70), 60 states have call successors, (70) [2025-02-05 15:41:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 577 transitions. [2025-02-05 15:41:59,203 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 577 transitions. Word has length 103 [2025-02-05 15:41:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:59,203 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 577 transitions. [2025-02-05 15:41:59,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 577 transitions. [2025-02-05 15:41:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:41:59,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:59,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:59,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:41:59,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:59,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:59,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1947622903, now seen corresponding path program 1 times [2025-02-05 15:41:59,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:59,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961818494] [2025-02-05 15:41:59,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:59,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:59,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:41:59,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:41:59,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:59,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:41:59,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:59,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961818494] [2025-02-05 15:41:59,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961818494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:41:59,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:41:59,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:41:59,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325890654] [2025-02-05 15:41:59,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:41:59,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:41:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:41:59,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:41:59,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:41:59,370 INFO L87 Difference]: Start difference. First operand 374 states and 577 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:41:59,422 INFO L93 Difference]: Finished difference Result 727 states and 1125 transitions. [2025-02-05 15:41:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:41:59,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2025-02-05 15:41:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:41:59,426 INFO L225 Difference]: With dead ends: 727 [2025-02-05 15:41:59,426 INFO L226 Difference]: Without dead ends: 376 [2025-02-05 15:41:59,430 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:41:59,431 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:41:59,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1848 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:41:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-05 15:41:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-02-05 15:41:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 292 states have (on average 1.5308219178082192) internal successors, (447), 299 states have internal predecessors, (447), 61 states have call successors, (61), 18 states have call predecessors, (61), 22 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2025-02-05 15:41:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 580 transitions. [2025-02-05 15:41:59,453 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 580 transitions. Word has length 104 [2025-02-05 15:41:59,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:41:59,454 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 580 transitions. [2025-02-05 15:41:59,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:41:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 580 transitions. [2025-02-05 15:41:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 15:41:59,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:41:59,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:41:59,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:41:59,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:41:59,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:41:59,457 INFO L85 PathProgramCache]: Analyzing trace with hash 854853512, now seen corresponding path program 1 times [2025-02-05 15:41:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:41:59,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690686745] [2025-02-05 15:41:59,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:41:59,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:41:59,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:41:59,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:59,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 15:41:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:41:59,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690686745] [2025-02-05 15:41:59,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690686745] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:41:59,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435005281] [2025-02-05 15:41:59,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:41:59,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:41:59,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:41:59,654 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:41:59,656 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:41:59,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:41:59,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:41:59,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:41:59,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:41:59,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:41:59,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:41:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:41:59,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:42:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:00,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435005281] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:42:00,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:42:00,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:42:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521385639] [2025-02-05 15:42:00,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:42:00,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:42:00,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:00,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:42:00,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:42:00,072 INFO L87 Difference]: Start difference. First operand 376 states and 580 transitions. Second operand has 11 states, 10 states have (on average 11.3) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-05 15:42:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:00,737 INFO L93 Difference]: Finished difference Result 1097 states and 1765 transitions. [2025-02-05 15:42:00,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:42:00,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.3) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 105 [2025-02-05 15:42:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:00,744 INFO L225 Difference]: With dead ends: 1097 [2025-02-05 15:42:00,745 INFO L226 Difference]: Without dead ends: 750 [2025-02-05 15:42:00,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:42:00,748 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 1227 mSDsluCounter, 3169 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 3631 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:00,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 3631 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:42:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-02-05 15:42:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 726. [2025-02-05 15:42:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 578 states have (on average 1.5830449826989619) internal successors, (915), 584 states have internal predecessors, (915), 125 states have call successors, (125), 19 states have call predecessors, (125), 22 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2025-02-05 15:42:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1186 transitions. [2025-02-05 15:42:00,799 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1186 transitions. Word has length 105 [2025-02-05 15:42:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:00,799 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1186 transitions. [2025-02-05 15:42:00,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.3) internal successors, (113), 11 states have internal predecessors, (113), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-02-05 15:42:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1186 transitions. [2025-02-05 15:42:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:42:00,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:00,823 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:00,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:42:01,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:42:01,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash 270929513, now seen corresponding path program 1 times [2025-02-05 15:42:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786514519] [2025-02-05 15:42:01,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:01,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:01,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:42:01,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:42:01,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:01,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:01,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:01,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786514519] [2025-02-05 15:42:01,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786514519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:01,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:01,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50086010] [2025-02-05 15:42:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:01,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:01,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:01,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:01,096 INFO L87 Difference]: Start difference. First operand 726 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:01,142 INFO L93 Difference]: Finished difference Result 1702 states and 2825 transitions. [2025-02-05 15:42:01,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:01,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-02-05 15:42:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:01,150 INFO L225 Difference]: With dead ends: 1702 [2025-02-05 15:42:01,151 INFO L226 Difference]: Without dead ends: 1054 [2025-02-05 15:42:01,154 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:42:01,155 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 112 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 935 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:42:01,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 935 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-02-05 15:42:01,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1046. [2025-02-05 15:42:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 834 states have (on average 1.6007194244604317) internal successors, (1335), 840 states have internal predecessors, (1335), 189 states have call successors, (189), 19 states have call predecessors, (189), 22 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2025-02-05 15:42:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1744 transitions. [2025-02-05 15:42:01,217 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1744 transitions. Word has length 108 [2025-02-05 15:42:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:01,217 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1744 transitions. [2025-02-05 15:42:01,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1744 transitions. [2025-02-05 15:42:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:42:01,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:01,226 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:01,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:42:01,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:01,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2023710384, now seen corresponding path program 1 times [2025-02-05 15:42:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123955454] [2025-02-05 15:42:01,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:01,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:42:01,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:42:01,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:01,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:01,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:01,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123955454] [2025-02-05 15:42:01,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123955454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:01,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:01,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:01,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032038145] [2025-02-05 15:42:01,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:01,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:01,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:01,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:01,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:01,299 INFO L87 Difference]: Start difference. First operand 1046 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:01,363 INFO L93 Difference]: Finished difference Result 2496 states and 4182 transitions. [2025-02-05 15:42:01,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:01,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-02-05 15:42:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:01,375 INFO L225 Difference]: With dead ends: 2496 [2025-02-05 15:42:01,375 INFO L226 Difference]: Without dead ends: 1579 [2025-02-05 15:42:01,381 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:42:01,381 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 110 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 934 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:42:01,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-02-05 15:42:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1571. [2025-02-05 15:42:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1264 states have (on average 1.6083860759493671) internal successors, (2033), 1270 states have internal predecessors, (2033), 284 states have call successors, (284), 19 states have call predecessors, (284), 22 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2025-02-05 15:42:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2632 transitions. [2025-02-05 15:42:01,515 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2632 transitions. Word has length 109 [2025-02-05 15:42:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:01,516 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2632 transitions. [2025-02-05 15:42:01,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2632 transitions. [2025-02-05 15:42:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:42:01,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:01,524 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:01,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:42:01,524 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:01,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:01,525 INFO L85 PathProgramCache]: Analyzing trace with hash 659239978, now seen corresponding path program 1 times [2025-02-05 15:42:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:01,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266180499] [2025-02-05 15:42:01,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:01,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:42:01,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:42:01,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:01,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:01,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:01,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266180499] [2025-02-05 15:42:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266180499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:01,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:01,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:01,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552070994] [2025-02-05 15:42:01,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:01,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:01,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:01,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:01,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:01,594 INFO L87 Difference]: Start difference. First operand 1571 states and 2632 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:01,682 INFO L93 Difference]: Finished difference Result 3685 states and 6216 transitions. [2025-02-05 15:42:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-02-05 15:42:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:01,700 INFO L225 Difference]: With dead ends: 3685 [2025-02-05 15:42:01,700 INFO L226 Difference]: Without dead ends: 2375 [2025-02-05 15:42:01,707 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:42:01,708 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 108 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 929 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:42:01,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 929 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2025-02-05 15:42:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2367. [2025-02-05 15:42:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 1937 states have (on average 1.614352090862158) internal successors, (3127), 1943 states have internal predecessors, (3127), 407 states have call successors, (407), 19 states have call predecessors, (407), 22 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2025-02-05 15:42:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 3988 transitions. [2025-02-05 15:42:01,887 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 3988 transitions. Word has length 110 [2025-02-05 15:42:01,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:01,887 INFO L471 AbstractCegarLoop]: Abstraction has 2367 states and 3988 transitions. [2025-02-05 15:42:01,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3988 transitions. [2025-02-05 15:42:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:42:01,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:01,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:01,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:42:01,897 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:01,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:01,898 INFO L85 PathProgramCache]: Analyzing trace with hash 285000527, now seen corresponding path program 1 times [2025-02-05 15:42:01,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:01,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534765826] [2025-02-05 15:42:01,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:01,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:01,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:42:01,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:42:01,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:01,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:01,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:01,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534765826] [2025-02-05 15:42:01,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534765826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:01,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:01,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471659426] [2025-02-05 15:42:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:01,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:01,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:01,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:01,960 INFO L87 Difference]: Start difference. First operand 2367 states and 3988 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:02,122 INFO L93 Difference]: Finished difference Result 5538 states and 9388 transitions. [2025-02-05 15:42:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:02,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-02-05 15:42:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:02,148 INFO L225 Difference]: With dead ends: 5538 [2025-02-05 15:42:02,149 INFO L226 Difference]: Without dead ends: 3647 [2025-02-05 15:42:02,157 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:42:02,158 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 106 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 929 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:42:02,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 929 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3647 states. [2025-02-05 15:42:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3647 to 3639. [2025-02-05 15:42:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3030 states have (on average 1.6181518151815182) internal successors, (4903), 3036 states have internal predecessors, (4903), 586 states have call successors, (586), 19 states have call predecessors, (586), 22 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2025-02-05 15:42:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 6148 transitions. [2025-02-05 15:42:02,449 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 6148 transitions. Word has length 111 [2025-02-05 15:42:02,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:02,451 INFO L471 AbstractCegarLoop]: Abstraction has 3639 states and 6148 transitions. [2025-02-05 15:42:02,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 6148 transitions. [2025-02-05 15:42:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:42:02,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:02,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:02,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:42:02,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:02,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1575939275, now seen corresponding path program 1 times [2025-02-05 15:42:02,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:02,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579862450] [2025-02-05 15:42:02,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:02,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:02,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:42:02,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:42:02,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:02,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:02,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:02,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579862450] [2025-02-05 15:42:02,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579862450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:02,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:02,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:02,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250458313] [2025-02-05 15:42:02,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:02,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:02,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:02,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:02,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:02,546 INFO L87 Difference]: Start difference. First operand 3639 states and 6148 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:02,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:02,756 INFO L93 Difference]: Finished difference Result 8585 states and 14596 transitions. [2025-02-05 15:42:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:02,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-02-05 15:42:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:02,795 INFO L225 Difference]: With dead ends: 8585 [2025-02-05 15:42:02,795 INFO L226 Difference]: Without dead ends: 5749 [2025-02-05 15:42:02,809 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:42:02,809 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 104 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 953 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:42:02,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 953 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5749 states. [2025-02-05 15:42:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5749 to 5741. [2025-02-05 15:42:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5741 states, 4756 states have (on average 1.612699747687132) internal successors, (7670), 4762 states have internal predecessors, (7670), 962 states have call successors, (962), 19 states have call predecessors, (962), 22 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2025-02-05 15:42:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5741 states to 5741 states and 9711 transitions. [2025-02-05 15:42:03,168 INFO L78 Accepts]: Start accepts. Automaton has 5741 states and 9711 transitions. Word has length 112 [2025-02-05 15:42:03,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:03,169 INFO L471 AbstractCegarLoop]: Abstraction has 5741 states and 9711 transitions. [2025-02-05 15:42:03,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5741 states and 9711 transitions. [2025-02-05 15:42:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:42:03,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:03,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:03,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:42:03,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:03,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash 137929198, now seen corresponding path program 1 times [2025-02-05 15:42:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:03,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578054425] [2025-02-05 15:42:03,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:03,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:03,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:42:03,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:42:03,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:03,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578054425] [2025-02-05 15:42:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578054425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:03,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082711616] [2025-02-05 15:42:03,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:03,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:03,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:03,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:03,253 INFO L87 Difference]: Start difference. First operand 5741 states and 9711 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:03,562 INFO L93 Difference]: Finished difference Result 14097 states and 23993 transitions. [2025-02-05 15:42:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:03,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-02-05 15:42:03,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:03,622 INFO L225 Difference]: With dead ends: 14097 [2025-02-05 15:42:03,622 INFO L226 Difference]: Without dead ends: 9555 [2025-02-05 15:42:03,643 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:42:03,644 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 102 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 932 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:42:03,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 932 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9555 states. [2025-02-05 15:42:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9555 to 9547. [2025-02-05 15:42:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9547 states, 7956 states have (on average 1.6109854198089493) internal successors, (12817), 7962 states have internal predecessors, (12817), 1568 states have call successors, (1568), 19 states have call predecessors, (1568), 22 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2025-02-05 15:42:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9547 states to 9547 states and 16148 transitions. [2025-02-05 15:42:04,331 INFO L78 Accepts]: Start accepts. Automaton has 9547 states and 16148 transitions. Word has length 113 [2025-02-05 15:42:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:04,332 INFO L471 AbstractCegarLoop]: Abstraction has 9547 states and 16148 transitions. [2025-02-05 15:42:04,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 9547 states and 16148 transitions. [2025-02-05 15:42:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:42:04,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:04,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:04,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:42:04,354 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:04,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:04,354 INFO L85 PathProgramCache]: Analyzing trace with hash 300635980, now seen corresponding path program 1 times [2025-02-05 15:42:04,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:04,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510835861] [2025-02-05 15:42:04,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:04,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:04,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:42:04,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:42:04,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:04,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510835861] [2025-02-05 15:42:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510835861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103501558] [2025-02-05 15:42:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:04,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:04,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:04,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:04,433 INFO L87 Difference]: Start difference. First operand 9547 states and 16148 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:04,914 INFO L93 Difference]: Finished difference Result 24604 states and 41791 transitions. [2025-02-05 15:42:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:04,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2025-02-05 15:42:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:05,002 INFO L225 Difference]: With dead ends: 24604 [2025-02-05 15:42:05,002 INFO L226 Difference]: Without dead ends: 16731 [2025-02-05 15:42:05,043 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:42:05,044 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 100 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 959 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:42:05,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 959 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16731 states. [2025-02-05 15:42:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16731 to 16723. [2025-02-05 15:42:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16723 states, 13929 states have (on average 1.6028429894464786) internal successors, (22326), 13935 states have internal predecessors, (22326), 2771 states have call successors, (2771), 19 states have call predecessors, (2771), 22 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2025-02-05 15:42:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16723 states to 16723 states and 28207 transitions. [2025-02-05 15:42:06,020 INFO L78 Accepts]: Start accepts. Automaton has 16723 states and 28207 transitions. Word has length 114 [2025-02-05 15:42:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:06,021 INFO L471 AbstractCegarLoop]: Abstraction has 16723 states and 28207 transitions. [2025-02-05 15:42:06,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 16723 states and 28207 transitions. [2025-02-05 15:42:06,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:42:06,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:06,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:06,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:42:06,047 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:06,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1456348915, now seen corresponding path program 1 times [2025-02-05 15:42:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:06,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045786733] [2025-02-05 15:42:06,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:06,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:06,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:42:06,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:42:06,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:06,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:06,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:06,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045786733] [2025-02-05 15:42:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045786733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:06,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:06,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111045051] [2025-02-05 15:42:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:06,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:06,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:06,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:06,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:06,121 INFO L87 Difference]: Start difference. First operand 16723 states and 28207 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:07,152 INFO L93 Difference]: Finished difference Result 44185 states and 74869 transitions. [2025-02-05 15:42:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2025-02-05 15:42:07,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:07,344 INFO L225 Difference]: With dead ends: 44185 [2025-02-05 15:42:07,344 INFO L226 Difference]: Without dead ends: 29805 [2025-02-05 15:42:07,420 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:42:07,422 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 98 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 932 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:42:07,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 932 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29805 states. [2025-02-05 15:42:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29805 to 29797. [2025-02-05 15:42:08,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29797 states, 24964 states have (on average 1.599222880948566) internal successors, (39923), 24970 states have internal predecessors, (39923), 4810 states have call successors, (4810), 19 states have call predecessors, (4810), 22 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2025-02-05 15:42:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29797 states to 29797 states and 50156 transitions. [2025-02-05 15:42:08,971 INFO L78 Accepts]: Start accepts. Automaton has 29797 states and 50156 transitions. Word has length 115 [2025-02-05 15:42:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:08,972 INFO L471 AbstractCegarLoop]: Abstraction has 29797 states and 50156 transitions. [2025-02-05 15:42:08,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 29797 states and 50156 transitions. [2025-02-05 15:42:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:42:09,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:09,001 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:09,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:42:09,002 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:09,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1893206355, now seen corresponding path program 1 times [2025-02-05 15:42:09,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:09,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984226185] [2025-02-05 15:42:09,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:09,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:09,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:42:09,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:42:09,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:09,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:09,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:09,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984226185] [2025-02-05 15:42:09,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984226185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:09,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:09,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:09,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250668081] [2025-02-05 15:42:09,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:09,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:09,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:09,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:09,072 INFO L87 Difference]: Start difference. First operand 29797 states and 50156 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:10,602 INFO L93 Difference]: Finished difference Result 81142 states and 137081 transitions. [2025-02-05 15:42:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:10,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2025-02-05 15:42:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:10,897 INFO L225 Difference]: With dead ends: 81142 [2025-02-05 15:42:10,897 INFO L226 Difference]: Without dead ends: 54491 [2025-02-05 15:42:11,013 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:42:11,014 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 96 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 933 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:42:11,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 933 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54491 states. [2025-02-05 15:42:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54491 to 54483. [2025-02-05 15:42:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54483 states, 45935 states have (on average 1.5942309785566562) internal successors, (73231), 45941 states have internal predecessors, (73231), 8525 states have call successors, (8525), 19 states have call predecessors, (8525), 22 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2025-02-05 15:42:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54483 states to 54483 states and 91426 transitions. [2025-02-05 15:42:13,677 INFO L78 Accepts]: Start accepts. Automaton has 54483 states and 91426 transitions. Word has length 116 [2025-02-05 15:42:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:13,678 INFO L471 AbstractCegarLoop]: Abstraction has 54483 states and 91426 transitions. [2025-02-05 15:42:13,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 54483 states and 91426 transitions. [2025-02-05 15:42:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:42:13,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:13,709 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:13,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:42:13,710 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:13,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:13,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1750638708, now seen corresponding path program 1 times [2025-02-05 15:42:13,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:13,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335585454] [2025-02-05 15:42:13,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:13,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:13,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:42:13,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:42:13,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:13,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:13,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:13,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335585454] [2025-02-05 15:42:13,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335585454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:13,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:13,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:42:13,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842554689] [2025-02-05 15:42:13,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:13,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:42:13,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:13,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:42:13,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:42:13,773 INFO L87 Difference]: Start difference. First operand 54483 states and 91426 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:15,929 INFO L93 Difference]: Finished difference Result 101688 states and 170988 transitions. [2025-02-05 15:42:15,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:42:15,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2025-02-05 15:42:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:16,592 INFO L225 Difference]: With dead ends: 101688 [2025-02-05 15:42:16,592 INFO L226 Difference]: Without dead ends: 101532 [2025-02-05 15:42:16,665 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:42:16,665 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 91 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:16,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 946 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:42:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101532 states. [2025-02-05 15:42:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101532 to 101524. [2025-02-05 15:42:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101524 states, 86177 states have (on average 1.5877670376086426) internal successors, (136829), 86183 states have internal predecessors, (136829), 15324 states have call successors, (15324), 19 states have call predecessors, (15324), 22 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2025-02-05 15:42:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101524 states to 101524 states and 169668 transitions. [2025-02-05 15:42:20,338 INFO L78 Accepts]: Start accepts. Automaton has 101524 states and 169668 transitions. Word has length 117 [2025-02-05 15:42:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:20,338 INFO L471 AbstractCegarLoop]: Abstraction has 101524 states and 169668 transitions. [2025-02-05 15:42:20,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:42:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 101524 states and 169668 transitions. [2025-02-05 15:42:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:42:20,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:20,363 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:20,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:42:20,363 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:20,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1322965426, now seen corresponding path program 1 times [2025-02-05 15:42:20,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:20,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422703393] [2025-02-05 15:42:20,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:20,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:20,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:42:20,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:42:20,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:20,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:20,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422703393] [2025-02-05 15:42:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422703393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:20,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:20,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 15:42:20,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748412931] [2025-02-05 15:42:20,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:20,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 15:42:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:20,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 15:42:20,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:42:20,659 INFO L87 Difference]: Start difference. First operand 101524 states and 169668 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-05 15:42:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:42:26,870 INFO L93 Difference]: Finished difference Result 202332 states and 343639 transitions. [2025-02-05 15:42:26,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 15:42:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 118 [2025-02-05 15:42:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:42:27,947 INFO L225 Difference]: With dead ends: 202332 [2025-02-05 15:42:27,947 INFO L226 Difference]: Without dead ends: 202182 [2025-02-05 15:42:28,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:42:28,041 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1215 mSDsluCounter, 4901 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 5490 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:42:28,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 5490 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 15:42:28,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202182 states. [2025-02-05 15:42:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202182 to 202145. [2025-02-05 15:42:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202145 states, 171650 states have (on average 1.588610544713079) internal successors, (272685), 171552 states have internal predecessors, (272685), 30441 states have call successors, (30441), 47 states have call predecessors, (30441), 53 states have return successors, (38097), 30551 states have call predecessors, (38097), 30438 states have call successors, (38097) [2025-02-05 15:42:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202145 states to 202145 states and 341223 transitions. [2025-02-05 15:42:36,163 INFO L78 Accepts]: Start accepts. Automaton has 202145 states and 341223 transitions. Word has length 118 [2025-02-05 15:42:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:42:36,164 INFO L471 AbstractCegarLoop]: Abstraction has 202145 states and 341223 transitions. [2025-02-05 15:42:36,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-05 15:42:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 202145 states and 341223 transitions. [2025-02-05 15:42:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:42:36,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:42:36,212 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:42:36,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:42:36,212 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:42:36,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:42:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash 124502287, now seen corresponding path program 1 times [2025-02-05 15:42:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:42:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384900928] [2025-02-05 15:42:36,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:42:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:42:36,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:42:36,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:42:36,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:42:36,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:42:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 15:42:36,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:42:36,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384900928] [2025-02-05 15:42:36,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384900928] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:42:36,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:42:36,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:42:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356924804] [2025-02-05 15:42:36,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:42:36,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:42:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:42:36,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:42:36,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:42:36,310 INFO L87 Difference]: Start difference. First operand 202145 states and 341223 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11)