./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product32.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_spec3_product32.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 f844ee25e08c400ffe9294b51b3c9849047d932ed3d2e45badb4ba2d0884ce06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:44:29,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:44:29,897 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:44:29,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:44:29,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:44:29,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:44:29,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:44:29,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:44:29,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:44:29,914 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:44:29,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:44:29,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:44:29,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:44:29,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:44:29,915 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:44:29,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:44:29,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:44:29,915 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:44:29,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:44:29,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:44:29,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:44:29,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:44:29,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:44:29,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:44:29,916 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:44:29,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:44:29,916 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:44:29,916 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:44:29,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:44:29,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:44:29,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:44:29,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:44:29,917 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 -> f844ee25e08c400ffe9294b51b3c9849047d932ed3d2e45badb4ba2d0884ce06 [2025-02-05 15:44:30,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:44:30,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:44:30,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:44:30,096 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:44:30,097 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:44:30,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product32.cil.c [2025-02-05 15:44:31,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/721f03fe0/dc311b85ba074cfebb788b115a01c95b/FLAG89fbd72b2 [2025-02-05 15:44:31,642 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:44:31,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product32.cil.c [2025-02-05 15:44:31,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/721f03fe0/dc311b85ba074cfebb788b115a01c95b/FLAG89fbd72b2 [2025-02-05 15:44:31,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/721f03fe0/dc311b85ba074cfebb788b115a01c95b [2025-02-05 15:44:31,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:44:31,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:44:31,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:44:31,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:44:31,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:44:31,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:44:31" (1/1) ... [2025-02-05 15:44:31,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b69775d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:31, skipping insertion in model container [2025-02-05 15:44:31,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:44:31" (1/1) ... [2025-02-05 15:44:31,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:44:31,862 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_spec3_product32.cil.c[1542,1555] [2025-02-05 15:44:32,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:44:32,223 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:44:32,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-02-05 15:44:32,232 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [57] [2025-02-05 15:44:32,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [106] [2025-02-05 15:44:32,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [541] [2025-02-05 15:44:32,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [558] [2025-02-05 15:44:32,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [787] [2025-02-05 15:44:32,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [845] [2025-02-05 15:44:32,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1917] [2025-02-05 15:44:32,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2205] [2025-02-05 15:44:32,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2343] [2025-02-05 15:44:32,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2740] [2025-02-05 15:44:32,238 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_spec3_product32.cil.c[1542,1555] [2025-02-05 15:44:32,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:44:32,368 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:44:32,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32 WrapperNode [2025-02-05 15:44:32,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:44:32,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:44:32,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:44:32,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:44:32,376 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:44:32" (1/1) ... [2025-02-05 15:44:32,393 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:44:32" (1/1) ... [2025-02-05 15:44:32,435 INFO L138 Inliner]: procedures = 135, calls = 226, calls flagged for inlining = 61, calls inlined = 53, statements flattened = 1014 [2025-02-05 15:44:32,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:44:32,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:44:32,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:44:32,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:44:32,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (1/1) ... [2025-02-05 15:44:32,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (1/1) ... [2025-02-05 15:44:32,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (1/1) ... [2025-02-05 15:44:32,486 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:44:32,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (1/1) ... [2025-02-05 15:44:32,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (1/1) ... [2025-02-05 15:44:32,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (1/1) ... [2025-02-05 15:44:32,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (1/1) ... [2025-02-05 15:44:32,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (1/1) ... [2025-02-05 15:44:32,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (1/1) ... [2025-02-05 15:44:32,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:44:32,539 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:44:32,539 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:44:32,539 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:44:32,540 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (1/1) ... [2025-02-05 15:44:32,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:44:32,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:32,574 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:44:32,582 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:44:32,599 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:44:32,599 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:44:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:44:32,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:44:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:44:32,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:44:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:44:32,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:44:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:44:32,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:44:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:44:32,601 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:44:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:44:32,601 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:44:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:44:32,601 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:44:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:44:32,602 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:44:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:44:32,602 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:44:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:44:32,602 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:44:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:44:32,602 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:44:32,602 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:44:32,604 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:44:32,604 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:44:32,605 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:44:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:44:32,605 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:44:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:44:32,605 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:44:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:44:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:44:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:44:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:44:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:44:32,605 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:44:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:44:32,605 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:44:32,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:44:32,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:44:32,786 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:44:32,788 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:44:32,891 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2647: #res := ~retValue_acc~38; [2025-02-05 15:44:32,904 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L431: #res := ~retValue_acc~6; [2025-02-05 15:44:32,945 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1506-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~18#1; [2025-02-05 15:44:32,945 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1551: #res#1 := ~retValue_acc~19#1; [2025-02-05 15:44:32,974 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1775: #res := ~retValue_acc~22; [2025-02-05 15:44:32,989 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1459: #res := ~retValue_acc~17; [2025-02-05 15:44:33,003 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2340-1: createEmail_#res#1 := createEmail_~retValue_acc~29#1; [2025-02-05 15:44:33,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003: #res := ~retValue_acc~11; [2025-02-05 15:44:33,024 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: #res := ~retValue_acc~36; [2025-02-05 15:44:33,063 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2610: #res := ~retValue_acc~37; [2025-02-05 15:44:33,072 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2684: #res := ~retValue_acc~39; [2025-02-05 15:44:33,103 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2458: #res := ~retValue_acc~33; [2025-02-05 15:44:33,164 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1329: #res := ~retValue_acc~15; [2025-02-05 15:44:33,302 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894-1: getClientId_#res#1 := getClientId_~retValue_acc~24#1; [2025-02-05 15:44:33,302 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1412-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~16#1; [2025-02-05 15:44:33,604 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1721-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~21#1; [2025-02-05 15:44:33,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L103-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:44:33,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L388-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~3#1; [2025-02-05 15:44:33,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L406-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~5#1; [2025-02-05 15:44:33,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1614-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~20#1; [2025-02-05 15:44:33,605 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L397-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~4#1; [2025-02-05 15:44:33,610 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2421: #res := ~retValue_acc~32; [2025-02-05 15:44:33,617 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2316: #res#1 := ~retValue_acc~27#1; [2025-02-05 15:44:33,617 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2296-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~26#1; [2025-02-05 15:44:33,746 INFO L? ?]: Removed 543 outVars from TransFormulas that were not future-live. [2025-02-05 15:44:33,746 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:44:33,771 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:44:33,771 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:44:33,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:44:33 BoogieIcfgContainer [2025-02-05 15:44:33,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:44:33,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:44:33,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:44:33,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:44:33,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:44:31" (1/3) ... [2025-02-05 15:44:33,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358c3abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:44:33, skipping insertion in model container [2025-02-05 15:44:33,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:32" (2/3) ... [2025-02-05 15:44:33,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358c3abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:44:33, skipping insertion in model container [2025-02-05 15:44:33,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:44:33" (3/3) ... [2025-02-05 15:44:33,779 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product32.cil.c [2025-02-05 15:44:33,789 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:44:33,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product32.cil.c that has 30 procedures, 435 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:44:33,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:44:33,895 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;@186485c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:44:33,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:44:33,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 435 states, 334 states have (on average 1.5449101796407185) internal successors, (516), 341 states have internal predecessors, (516), 70 states have call successors, (70), 29 states have call predecessors, (70), 29 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-05 15:44:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:44:33,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:33,933 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:33,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:33,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1496285244, now seen corresponding path program 1 times [2025-02-05 15:44:33,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:33,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23545809] [2025-02-05 15:44:33,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:33,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:34,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:44:34,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:44:34,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:34,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:44:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:34,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23545809] [2025-02-05 15:44:34,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23545809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:34,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600360265] [2025-02-05 15:44:34,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:34,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:34,695 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:44:34,696 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:44:34,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:44:35,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:44:35,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:35,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:35,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:44:35,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:44:35,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600360265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:35,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:35,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:44:35,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704047593] [2025-02-05 15:44:35,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:35,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:44:35,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:35,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:44:35,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:35,088 INFO L87 Difference]: Start difference. First operand has 435 states, 334 states have (on average 1.5449101796407185) internal successors, (516), 341 states have internal predecessors, (516), 70 states have call successors, (70), 29 states have call predecessors, (70), 29 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:35,154 INFO L93 Difference]: Finished difference Result 677 states and 1004 transitions. [2025-02-05 15:44:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:44:35,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 139 [2025-02-05 15:44:35,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:35,172 INFO L225 Difference]: With dead ends: 677 [2025-02-05 15:44:35,172 INFO L226 Difference]: Without dead ends: 427 [2025-02-05 15:44:35,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 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:44:35,186 INFO L435 NwaCegarLoop]: 651 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, 651 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:44:35,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-05 15:44:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-02-05 15:44:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 328 states have (on average 1.5426829268292683) internal successors, (506), 333 states have internal predecessors, (506), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 15:44:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 643 transitions. [2025-02-05 15:44:35,266 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 643 transitions. Word has length 139 [2025-02-05 15:44:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:35,267 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 643 transitions. [2025-02-05 15:44:35,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 643 transitions. [2025-02-05 15:44:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 15:44:35,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:35,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:35,283 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:44:35,475 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:44:35,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:35,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash 607452690, now seen corresponding path program 1 times [2025-02-05 15:44:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:35,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814120869] [2025-02-05 15:44:35,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:35,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:35,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 15:44:35,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 15:44:35,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:35,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-05 15:44:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814120869] [2025-02-05 15:44:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814120869] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:35,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124108180] [2025-02-05 15:44:35,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:35,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:35,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:35,790 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:44:35,793 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:44:35,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 15:44:36,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 15:44:36,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:36,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:36,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:44:36,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 15:44:36,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:36,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124108180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:36,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:36,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:44:36,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158270305] [2025-02-05 15:44:36,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:36,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:36,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:36,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:36,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:36,132 INFO L87 Difference]: Start difference. First operand 427 states and 643 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:36,172 INFO L93 Difference]: Finished difference Result 665 states and 978 transitions. [2025-02-05 15:44:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2025-02-05 15:44:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:36,177 INFO L225 Difference]: With dead ends: 665 [2025-02-05 15:44:36,177 INFO L226 Difference]: Without dead ends: 429 [2025-02-05 15:44:36,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 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:44:36,181 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 0 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1282 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:44:36,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1282 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-02-05 15:44:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-02-05 15:44:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 330 states have (on average 1.5393939393939393) internal successors, (508), 335 states have internal predecessors, (508), 70 states have call successors, (70), 29 states have call predecessors, (70), 28 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-05 15:44:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 645 transitions. [2025-02-05 15:44:36,220 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 645 transitions. Word has length 159 [2025-02-05 15:44:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:36,221 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 645 transitions. [2025-02-05 15:44:36,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:36,222 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 645 transitions. [2025-02-05 15:44:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:44:36,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:36,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:36,232 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:44:36,429 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:44:36,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:36,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:36,431 INFO L85 PathProgramCache]: Analyzing trace with hash -433453515, now seen corresponding path program 1 times [2025-02-05 15:44:36,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:36,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478598079] [2025-02-05 15:44:36,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:36,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:36,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:44:36,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:44:36,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:36,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:44:36,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478598079] [2025-02-05 15:44:36,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478598079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:36,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334620039] [2025-02-05 15:44:36,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:36,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:36,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:36,645 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:44:36,646 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:44:36,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:44:36,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:44:36,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:36,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:36,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:44:36,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 15:44:36,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:36,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334620039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:36,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:36,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:44:36,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608319500] [2025-02-05 15:44:36,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:36,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:36,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:36,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:36,978 INFO L87 Difference]: Start difference. First operand 429 states and 645 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:37,010 INFO L93 Difference]: Finished difference Result 905 states and 1381 transitions. [2025-02-05 15:44:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:37,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2025-02-05 15:44:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:37,013 INFO L225 Difference]: With dead ends: 905 [2025-02-05 15:44:37,013 INFO L226 Difference]: Without dead ends: 503 [2025-02-05 15:44:37,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 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:44:37,015 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 134 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1246 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:44:37,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1246 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-05 15:44:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 495. [2025-02-05 15:44:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 382 states have (on average 1.5602094240837696) internal successors, (596), 387 states have internal predecessors, (596), 84 states have call successors, (84), 29 states have call predecessors, (84), 28 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2025-02-05 15:44:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 761 transitions. [2025-02-05 15:44:37,033 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 761 transitions. Word has length 148 [2025-02-05 15:44:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:37,033 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 761 transitions. [2025-02-05 15:44:37,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 761 transitions. [2025-02-05 15:44:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:44:37,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:37,036 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:37,045 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:44:37,236 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:44:37,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:37,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash 729668060, now seen corresponding path program 1 times [2025-02-05 15:44:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:37,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919454255] [2025-02-05 15:44:37,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:37,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:44:37,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:44:37,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:37,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:44:37,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:37,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919454255] [2025-02-05 15:44:37,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919454255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:37,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551852977] [2025-02-05 15:44:37,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:37,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:37,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:37,434 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:44:37,435 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:44:37,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:44:37,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:44:37,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:37,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:37,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:44:37,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:44:37,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:37,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551852977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:37,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:37,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:44:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450021858] [2025-02-05 15:44:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:37,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:37,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:37,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:37,762 INFO L87 Difference]: Start difference. First operand 495 states and 761 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:44:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:37,814 INFO L93 Difference]: Finished difference Result 981 states and 1512 transitions. [2025-02-05 15:44:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:37,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-02-05 15:44:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:37,817 INFO L225 Difference]: With dead ends: 981 [2025-02-05 15:44:37,817 INFO L226 Difference]: Without dead ends: 497 [2025-02-05 15:44:37,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 147 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:44:37,819 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 2 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2529 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:44:37,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2529 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:37,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-05 15:44:37,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-02-05 15:44:37,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 383 states have (on average 1.558746736292428) internal successors, (597), 389 states have internal predecessors, (597), 84 states have call successors, (84), 29 states have call predecessors, (84), 29 states have return successors, (83), 80 states have call predecessors, (83), 81 states have call successors, (83) [2025-02-05 15:44:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 764 transitions. [2025-02-05 15:44:37,834 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 764 transitions. Word has length 149 [2025-02-05 15:44:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:37,834 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 764 transitions. [2025-02-05 15:44:37,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:44:37,835 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 764 transitions. [2025-02-05 15:44:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:44:37,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:37,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:37,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 15:44:38,037 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:44:38,038 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:38,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash -46277196, now seen corresponding path program 1 times [2025-02-05 15:44:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:38,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170694107] [2025-02-05 15:44:38,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:38,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:44:38,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:44:38,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:38,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:44:38,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:38,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170694107] [2025-02-05 15:44:38,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170694107] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:38,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488697190] [2025-02-05 15:44:38,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:38,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:38,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:38,196 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:44:38,197 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:44:38,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:44:38,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:44:38,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:38,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:38,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:44:38,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:44:38,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:38,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488697190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:38,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:38,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:44:38,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068887233] [2025-02-05 15:44:38,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:38,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:38,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:38,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:38,506 INFO L87 Difference]: Start difference. First operand 497 states and 764 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:44:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:38,564 INFO L93 Difference]: Finished difference Result 983 states and 1517 transitions. [2025-02-05 15:44:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:38,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 150 [2025-02-05 15:44:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:38,567 INFO L225 Difference]: With dead ends: 983 [2025-02-05 15:44:38,567 INFO L226 Difference]: Without dead ends: 499 [2025-02-05 15:44:38,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:38,569 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 2 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2515 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:44:38,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2515 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-05 15:44:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-02-05 15:44:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 384 states have (on average 1.5572916666666667) internal successors, (598), 391 states have internal predecessors, (598), 84 states have call successors, (84), 29 states have call predecessors, (84), 30 states have return successors, (88), 80 states have call predecessors, (88), 81 states have call successors, (88) [2025-02-05 15:44:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 770 transitions. [2025-02-05 15:44:38,583 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 770 transitions. Word has length 150 [2025-02-05 15:44:38,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:38,583 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 770 transitions. [2025-02-05 15:44:38,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:44:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 770 transitions. [2025-02-05 15:44:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:44:38,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:38,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:38,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:44:38,786 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:44:38,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:38,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1015178528, now seen corresponding path program 1 times [2025-02-05 15:44:38,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:38,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44332811] [2025-02-05 15:44:38,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:38,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:44:38,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:44:38,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:38,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:44:38,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:38,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44332811] [2025-02-05 15:44:38,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44332811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:38,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:38,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:38,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480098159] [2025-02-05 15:44:38,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:38,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:38,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:38,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:38,935 INFO L87 Difference]: Start difference. First operand 499 states and 770 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:44:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:38,980 INFO L93 Difference]: Finished difference Result 975 states and 1508 transitions. [2025-02-05 15:44:38,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2025-02-05 15:44:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:38,984 INFO L225 Difference]: With dead ends: 975 [2025-02-05 15:44:38,984 INFO L226 Difference]: Without dead ends: 499 [2025-02-05 15:44:38,986 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:44:38,986 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 2 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2533 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:44:38,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2533 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-05 15:44:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-02-05 15:44:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 384 states have (on average 1.5572916666666667) internal successors, (598), 391 states have internal predecessors, (598), 84 states have call successors, (84), 29 states have call predecessors, (84), 30 states have return successors, (87), 80 states have call predecessors, (87), 81 states have call successors, (87) [2025-02-05 15:44:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 769 transitions. [2025-02-05 15:44:39,005 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 769 transitions. Word has length 151 [2025-02-05 15:44:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:39,006 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 769 transitions. [2025-02-05 15:44:39,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:44:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 769 transitions. [2025-02-05 15:44:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 15:44:39,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:39,009 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:39,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:44:39,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:39,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1837639963, now seen corresponding path program 1 times [2025-02-05 15:44:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:39,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879300849] [2025-02-05 15:44:39,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:39,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:39,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 15:44:39,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 15:44:39,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:39,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 15:44:39,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:39,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879300849] [2025-02-05 15:44:39,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879300849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:39,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:39,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:39,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844025725] [2025-02-05 15:44:39,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:39,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:39,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:39,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:39,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:39,144 INFO L87 Difference]: Start difference. First operand 499 states and 769 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-05 15:44:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:39,185 INFO L93 Difference]: Finished difference Result 977 states and 1511 transitions. [2025-02-05 15:44:39,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:39,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 171 [2025-02-05 15:44:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:39,188 INFO L225 Difference]: With dead ends: 977 [2025-02-05 15:44:39,189 INFO L226 Difference]: Without dead ends: 501 [2025-02-05 15:44:39,190 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:44:39,191 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 1 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2536 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:44:39,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2536 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-02-05 15:44:39,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2025-02-05 15:44:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 385 states have (on average 1.5558441558441558) internal successors, (599), 393 states have internal predecessors, (599), 84 states have call successors, (84), 29 states have call predecessors, (84), 31 states have return successors, (89), 80 states have call predecessors, (89), 81 states have call successors, (89) [2025-02-05 15:44:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 772 transitions. [2025-02-05 15:44:39,219 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 772 transitions. Word has length 171 [2025-02-05 15:44:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:39,219 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 772 transitions. [2025-02-05 15:44:39,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-02-05 15:44:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 772 transitions. [2025-02-05 15:44:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 15:44:39,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:39,221 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:39,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:44:39,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:39,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:39,222 INFO L85 PathProgramCache]: Analyzing trace with hash -594380238, now seen corresponding path program 1 times [2025-02-05 15:44:39,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:39,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861496808] [2025-02-05 15:44:39,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:39,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:39,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 15:44:39,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 15:44:39,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:39,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:39,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861496808] [2025-02-05 15:44:39,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861496808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:39,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:39,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:44:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734211194] [2025-02-05 15:44:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:39,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:44:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:39,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:44:39,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:39,362 INFO L87 Difference]: Start difference. First operand 501 states and 772 transitions. Second operand has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-05 15:44:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:39,479 INFO L93 Difference]: Finished difference Result 979 states and 1510 transitions. [2025-02-05 15:44:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:44:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 172 [2025-02-05 15:44:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:39,486 INFO L225 Difference]: With dead ends: 979 [2025-02-05 15:44:39,486 INFO L226 Difference]: Without dead ends: 503 [2025-02-05 15:44:39,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:44:39,489 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 7 mSDsluCounter, 3733 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4360 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:39,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4360 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:44:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-05 15:44:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-02-05 15:44:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 387 states have (on average 1.5529715762273901) internal successors, (601), 394 states have internal predecessors, (601), 84 states have call successors, (84), 30 states have call predecessors, (84), 31 states have return successors, (88), 80 states have call predecessors, (88), 81 states have call successors, (88) [2025-02-05 15:44:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 773 transitions. [2025-02-05 15:44:39,509 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 773 transitions. Word has length 172 [2025-02-05 15:44:39,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:39,510 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 773 transitions. [2025-02-05 15:44:39,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) [2025-02-05 15:44:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 773 transitions. [2025-02-05 15:44:39,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 15:44:39,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:39,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:39,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:44:39,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:39,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:39,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1226942913, now seen corresponding path program 1 times [2025-02-05 15:44:39,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:39,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559332136] [2025-02-05 15:44:39,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:39,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 15:44:39,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 15:44:39,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:39,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:44:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559332136] [2025-02-05 15:44:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559332136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:39,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:44:39,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73623926] [2025-02-05 15:44:39,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:39,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:44:39,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:39,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:44:39,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:39,655 INFO L87 Difference]: Start difference. First operand 503 states and 773 transitions. Second operand has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 15:44:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:39,775 INFO L93 Difference]: Finished difference Result 982 states and 1517 transitions. [2025-02-05 15:44:39,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:44:39,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 154 [2025-02-05 15:44:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:39,779 INFO L225 Difference]: With dead ends: 982 [2025-02-05 15:44:39,779 INFO L226 Difference]: Without dead ends: 506 [2025-02-05 15:44:39,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:44:39,780 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 5 mSDsluCounter, 3745 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4374 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:39,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4374 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:44:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-02-05 15:44:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-02-05 15:44:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 389 states have (on average 1.5501285347043703) internal successors, (603), 397 states have internal predecessors, (603), 84 states have call successors, (84), 30 states have call predecessors, (84), 32 states have return successors, (93), 80 states have call predecessors, (93), 81 states have call successors, (93) [2025-02-05 15:44:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 780 transitions. [2025-02-05 15:44:39,795 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 780 transitions. Word has length 154 [2025-02-05 15:44:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:39,795 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 780 transitions. [2025-02-05 15:44:39,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 15:44:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 780 transitions. [2025-02-05 15:44:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 15:44:39,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:39,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:39,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:44:39,797 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:39,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1539311793, now seen corresponding path program 1 times [2025-02-05 15:44:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:39,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304854902] [2025-02-05 15:44:39,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:39,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 15:44:39,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 15:44:39,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:39,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-05 15:44:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304854902] [2025-02-05 15:44:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304854902] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638014504] [2025-02-05 15:44:39,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:39,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:39,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:39,953 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:44:39,954 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:44:40,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 15:44:40,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 15:44:40,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:40,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:40,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:44:40,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 15:44:40,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:44:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 15:44:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638014504] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:44:40,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:44:40,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:44:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672802156] [2025-02-05 15:44:40,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:44:40,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:44:40,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:40,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:44:40,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:40,404 INFO L87 Difference]: Start difference. First operand 506 states and 780 transitions. Second operand has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 4 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (40), 3 states have call predecessors, (40), 4 states have call successors, (40) [2025-02-05 15:44:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:40,939 INFO L93 Difference]: Finished difference Result 1419 states and 2287 transitions. [2025-02-05 15:44:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:44:40,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 4 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (40), 3 states have call predecessors, (40), 4 states have call successors, (40) Word has length 174 [2025-02-05 15:44:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:40,957 INFO L225 Difference]: With dead ends: 1419 [2025-02-05 15:44:40,957 INFO L226 Difference]: Without dead ends: 945 [2025-02-05 15:44:40,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-02-05 15:44:40,959 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1517 mSDsluCounter, 3920 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 4550 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:40,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 4550 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:44:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-02-05 15:44:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 921. [2025-02-05 15:44:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 725 states have (on average 1.6082758620689654) internal successors, (1166), 732 states have internal predecessors, (1166), 163 states have call successors, (163), 31 states have call predecessors, (163), 32 states have return successors, (182), 159 states have call predecessors, (182), 160 states have call successors, (182) [2025-02-05 15:44:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1511 transitions. [2025-02-05 15:44:40,997 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1511 transitions. Word has length 174 [2025-02-05 15:44:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:40,998 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1511 transitions. [2025-02-05 15:44:40,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 16.1) internal successors, (161), 11 states have internal predecessors, (161), 4 states have call successors, (44), 2 states have call predecessors, (44), 3 states have return successors, (40), 3 states have call predecessors, (40), 4 states have call successors, (40) [2025-02-05 15:44:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1511 transitions. [2025-02-05 15:44:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 15:44:41,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:41,003 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:41,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:44:41,203 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:44:41,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:41,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1497575266, now seen corresponding path program 1 times [2025-02-05 15:44:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718224227] [2025-02-05 15:44:41,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:41,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:41,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:44:41,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:44:41,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:41,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:41,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:41,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718224227] [2025-02-05 15:44:41,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718224227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:41,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:41,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:41,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997398868] [2025-02-05 15:44:41,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:41,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:41,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:41,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:41,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:41,282 INFO L87 Difference]: Start difference. First operand 921 states and 1511 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:41,335 INFO L93 Difference]: Finished difference Result 2154 states and 3597 transitions. [2025-02-05 15:44:41,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:41,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2025-02-05 15:44:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:41,345 INFO L225 Difference]: With dead ends: 2154 [2025-02-05 15:44:41,345 INFO L226 Difference]: Without dead ends: 1314 [2025-02-05 15:44:41,349 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:44:41,350 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 131 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1295 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:44:41,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1295 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-02-05 15:44:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1306. [2025-02-05 15:44:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1031 states have (on average 1.6304558680892338) internal successors, (1681), 1038 states have internal predecessors, (1681), 242 states have call successors, (242), 31 states have call predecessors, (242), 32 states have return successors, (271), 238 states have call predecessors, (271), 239 states have call successors, (271) [2025-02-05 15:44:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2194 transitions. [2025-02-05 15:44:41,413 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2194 transitions. Word has length 158 [2025-02-05 15:44:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:41,415 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 2194 transitions. [2025-02-05 15:44:41,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2194 transitions. [2025-02-05 15:44:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 15:44:41,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:41,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:41,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:44:41,422 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:41,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:41,423 INFO L85 PathProgramCache]: Analyzing trace with hash -554616264, now seen corresponding path program 1 times [2025-02-05 15:44:41,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:41,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000284042] [2025-02-05 15:44:41,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:41,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:41,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 15:44:41,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 15:44:41,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:41,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:41,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:41,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000284042] [2025-02-05 15:44:41,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000284042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:41,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:41,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:41,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846113281] [2025-02-05 15:44:41,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:41,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:41,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:41,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:41,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:41,487 INFO L87 Difference]: Start difference. First operand 1306 states and 2194 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:41,537 INFO L93 Difference]: Finished difference Result 3117 states and 5279 transitions. [2025-02-05 15:44:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 159 [2025-02-05 15:44:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:41,548 INFO L225 Difference]: With dead ends: 3117 [2025-02-05 15:44:41,548 INFO L226 Difference]: Without dead ends: 1943 [2025-02-05 15:44:41,552 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:44:41,553 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 129 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1284 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:44:41,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1284 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-02-05 15:44:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1935. [2025-02-05 15:44:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1541 states have (on average 1.6424399740428293) internal successors, (2531), 1548 states have internal predecessors, (2531), 361 states have call successors, (361), 31 states have call predecessors, (361), 32 states have return successors, (390), 357 states have call predecessors, (390), 358 states have call successors, (390) [2025-02-05 15:44:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 3282 transitions. [2025-02-05 15:44:41,658 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 3282 transitions. Word has length 159 [2025-02-05 15:44:41,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:41,658 INFO L471 AbstractCegarLoop]: Abstraction has 1935 states and 3282 transitions. [2025-02-05 15:44:41,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 3282 transitions. [2025-02-05 15:44:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 15:44:41,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:41,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:41,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:44:41,669 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:41,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash 345372438, now seen corresponding path program 1 times [2025-02-05 15:44:41,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:41,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235912160] [2025-02-05 15:44:41,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:41,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:41,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 15:44:41,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 15:44:41,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:41,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 15:44:41,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:41,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235912160] [2025-02-05 15:44:41,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235912160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:41,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:41,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:41,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849532070] [2025-02-05 15:44:41,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:41,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:41,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:41,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:41,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:41,722 INFO L87 Difference]: Start difference. First operand 1935 states and 3282 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:41,796 INFO L93 Difference]: Finished difference Result 4579 states and 7838 transitions. [2025-02-05 15:44:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:41,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 179 [2025-02-05 15:44:41,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:41,814 INFO L225 Difference]: With dead ends: 4579 [2025-02-05 15:44:41,815 INFO L226 Difference]: Without dead ends: 2908 [2025-02-05 15:44:41,822 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:44:41,823 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 127 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1273 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:44:41,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1273 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:41,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2025-02-05 15:44:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2900. [2025-02-05 15:44:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2344 states have (on average 1.651877133105802) internal successors, (3872), 2351 states have internal predecessors, (3872), 523 states have call successors, (523), 31 states have call predecessors, (523), 32 states have return successors, (568), 519 states have call predecessors, (568), 520 states have call successors, (568) [2025-02-05 15:44:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 4963 transitions. [2025-02-05 15:44:41,976 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 4963 transitions. Word has length 179 [2025-02-05 15:44:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:41,976 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 4963 transitions. [2025-02-05 15:44:41,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 4963 transitions. [2025-02-05 15:44:41,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 15:44:41,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:41,992 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:41,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:44:41,993 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:41,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 875952862, now seen corresponding path program 1 times [2025-02-05 15:44:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864403526] [2025-02-05 15:44:41,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:41,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:42,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 15:44:42,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 15:44:42,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:42,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 15:44:42,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864403526] [2025-02-05 15:44:42,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864403526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:42,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:42,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:42,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131822168] [2025-02-05 15:44:42,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:42,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:42,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:42,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:42,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:42,048 INFO L87 Difference]: Start difference. First operand 2900 states and 4963 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:42,154 INFO L93 Difference]: Finished difference Result 6887 states and 11885 transitions. [2025-02-05 15:44:42,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:42,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 180 [2025-02-05 15:44:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:42,177 INFO L225 Difference]: With dead ends: 6887 [2025-02-05 15:44:42,177 INFO L226 Difference]: Without dead ends: 4466 [2025-02-05 15:44:42,187 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:44:42,187 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 125 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1273 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:44:42,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1273 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4466 states. [2025-02-05 15:44:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4466 to 4458. [2025-02-05 15:44:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4458 states, 3657 states have (on average 1.6587366694011485) internal successors, (6066), 3664 states have internal predecessors, (6066), 768 states have call successors, (768), 31 states have call predecessors, (768), 32 states have return successors, (839), 764 states have call predecessors, (839), 765 states have call successors, (839) [2025-02-05 15:44:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4458 states to 4458 states and 7673 transitions. [2025-02-05 15:44:42,417 INFO L78 Accepts]: Start accepts. Automaton has 4458 states and 7673 transitions. Word has length 180 [2025-02-05 15:44:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:42,417 INFO L471 AbstractCegarLoop]: Abstraction has 4458 states and 7673 transitions. [2025-02-05 15:44:42,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 4458 states and 7673 transitions. [2025-02-05 15:44:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 15:44:42,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:42,438 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:42,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:44:42,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:42,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1588299200, now seen corresponding path program 1 times [2025-02-05 15:44:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525923133] [2025-02-05 15:44:42,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:42,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 15:44:42,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 15:44:42,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:42,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:42,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525923133] [2025-02-05 15:44:42,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525923133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:42,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:42,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:42,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240724316] [2025-02-05 15:44:42,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:42,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:42,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:42,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:42,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:42,501 INFO L87 Difference]: Start difference. First operand 4458 states and 7673 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:42,726 INFO L93 Difference]: Finished difference Result 11002 states and 19058 transitions. [2025-02-05 15:44:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:42,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 162 [2025-02-05 15:44:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:42,775 INFO L225 Difference]: With dead ends: 11002 [2025-02-05 15:44:42,775 INFO L226 Difference]: Without dead ends: 7270 [2025-02-05 15:44:42,797 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:44:42,797 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 123 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1304 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:44:42,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1304 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7270 states. [2025-02-05 15:44:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7270 to 7262. [2025-02-05 15:44:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7262 states, 5968 states have (on average 1.6565013404825737) internal successors, (9886), 5975 states have internal predecessors, (9886), 1261 states have call successors, (1261), 31 states have call predecessors, (1261), 32 states have return successors, (1376), 1257 states have call predecessors, (1376), 1258 states have call successors, (1376) [2025-02-05 15:44:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7262 states to 7262 states and 12523 transitions. [2025-02-05 15:44:43,185 INFO L78 Accepts]: Start accepts. Automaton has 7262 states and 12523 transitions. Word has length 162 [2025-02-05 15:44:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:43,185 INFO L471 AbstractCegarLoop]: Abstraction has 7262 states and 12523 transitions. [2025-02-05 15:44:43,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7262 states and 12523 transitions. [2025-02-05 15:44:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 15:44:43,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:43,212 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:44:43,213 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:43,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1262104767, now seen corresponding path program 1 times [2025-02-05 15:44:43,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:43,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859624614] [2025-02-05 15:44:43,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:43,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:43,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:44:43,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:44:43,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:43,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 15:44:43,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:43,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859624614] [2025-02-05 15:44:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859624614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:43,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:43,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:43,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931372266] [2025-02-05 15:44:43,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:43,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:43,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:43,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:43,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:43,267 INFO L87 Difference]: Start difference. First operand 7262 states and 12523 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:43,473 INFO L93 Difference]: Finished difference Result 18317 states and 31806 transitions. [2025-02-05 15:44:43,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:43,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 182 [2025-02-05 15:44:43,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:43,524 INFO L225 Difference]: With dead ends: 18317 [2025-02-05 15:44:43,525 INFO L226 Difference]: Without dead ends: 12177 [2025-02-05 15:44:43,551 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:44:43,551 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 121 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1284 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:44:43,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1284 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2025-02-05 15:44:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12169. [2025-02-05 15:44:43,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12169 states, 10053 states have (on average 1.6577141151894956) internal successors, (16665), 10060 states have internal predecessors, (16665), 2083 states have call successors, (2083), 31 states have call predecessors, (2083), 32 states have return successors, (2276), 2079 states have call predecessors, (2276), 2080 states have call successors, (2276) [2025-02-05 15:44:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12169 states to 12169 states and 21024 transitions. [2025-02-05 15:44:44,090 INFO L78 Accepts]: Start accepts. Automaton has 12169 states and 21024 transitions. Word has length 182 [2025-02-05 15:44:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:44,090 INFO L471 AbstractCegarLoop]: Abstraction has 12169 states and 21024 transitions. [2025-02-05 15:44:44,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 12169 states and 21024 transitions. [2025-02-05 15:44:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 15:44:44,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:44,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:44,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:44:44,136 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:44,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash -321850143, now seen corresponding path program 1 times [2025-02-05 15:44:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:44,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358314297] [2025-02-05 15:44:44,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:44,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 15:44:44,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 15:44:44,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:44,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358314297] [2025-02-05 15:44:44,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358314297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:44,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:44,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593372377] [2025-02-05 15:44:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:44,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:44,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:44,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:44,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:44,185 INFO L87 Difference]: Start difference. First operand 12169 states and 21024 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:44,667 INFO L93 Difference]: Finished difference Result 29073 states and 50183 transitions. [2025-02-05 15:44:44,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:44,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 164 [2025-02-05 15:44:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:44,739 INFO L225 Difference]: With dead ends: 29073 [2025-02-05 15:44:44,739 INFO L226 Difference]: Without dead ends: 18993 [2025-02-05 15:44:44,776 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:44:44,777 INFO L435 NwaCegarLoop]: 645 mSDtfsCounter, 119 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1252 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:44:44,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1252 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18993 states. [2025-02-05 15:44:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18993 to 18985. [2025-02-05 15:44:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18985 states, 15666 states have (on average 1.6339844248691433) internal successors, (25598), 15673 states have internal predecessors, (25598), 3286 states have call successors, (3286), 31 states have call predecessors, (3286), 32 states have return successors, (3623), 3282 states have call predecessors, (3623), 3283 states have call successors, (3623) [2025-02-05 15:44:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18985 states to 18985 states and 32507 transitions. [2025-02-05 15:44:45,682 INFO L78 Accepts]: Start accepts. Automaton has 18985 states and 32507 transitions. Word has length 164 [2025-02-05 15:44:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:45,682 INFO L471 AbstractCegarLoop]: Abstraction has 18985 states and 32507 transitions. [2025-02-05 15:44:45,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18985 states and 32507 transitions. [2025-02-05 15:44:45,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 15:44:45,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:45,725 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:45,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:44:45,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:45,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:45,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1434249227, now seen corresponding path program 1 times [2025-02-05 15:44:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:45,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107872841] [2025-02-05 15:44:45,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:45,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 15:44:45,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 15:44:45,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:45,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:45,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:45,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107872841] [2025-02-05 15:44:45,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107872841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:45,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:45,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:45,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848072370] [2025-02-05 15:44:45,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:45,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:45,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:45,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:45,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:45,776 INFO L87 Difference]: Start difference. First operand 18985 states and 32507 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:46,412 INFO L93 Difference]: Finished difference Result 50110 states and 86166 transitions. [2025-02-05 15:44:46,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:46,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 165 [2025-02-05 15:44:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:46,801 INFO L225 Difference]: With dead ends: 50110 [2025-02-05 15:44:46,801 INFO L226 Difference]: Without dead ends: 33848 [2025-02-05 15:44:46,862 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:44:46,866 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 117 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1276 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:44:46,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1276 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33848 states. [2025-02-05 15:44:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33848 to 33840. [2025-02-05 15:44:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33840 states, 28071 states have (on average 1.631505824516405) internal successors, (45798), 28078 states have internal predecessors, (45798), 5736 states have call successors, (5736), 31 states have call predecessors, (5736), 32 states have return successors, (6347), 5732 states have call predecessors, (6347), 5733 states have call successors, (6347) [2025-02-05 15:44:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33840 states to 33840 states and 57881 transitions. [2025-02-05 15:44:48,336 INFO L78 Accepts]: Start accepts. Automaton has 33840 states and 57881 transitions. Word has length 165 [2025-02-05 15:44:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:48,337 INFO L471 AbstractCegarLoop]: Abstraction has 33840 states and 57881 transitions. [2025-02-05 15:44:48,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:44:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 33840 states and 57881 transitions. [2025-02-05 15:44:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-05 15:44:48,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:48,395 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:48,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:44:48,396 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:48,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1798731219, now seen corresponding path program 1 times [2025-02-05 15:44:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729778613] [2025-02-05 15:44:48,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:48,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-05 15:44:48,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-05 15:44:48,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:48,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 15:44:48,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:48,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729778613] [2025-02-05 15:44:48,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729778613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:48,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:48,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:48,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771265573] [2025-02-05 15:44:48,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:48,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:48,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:48,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:48,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:48,452 INFO L87 Difference]: Start difference. First operand 33840 states and 57881 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:50,572 INFO L93 Difference]: Finished difference Result 92202 states and 158253 transitions. [2025-02-05 15:44:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 185 [2025-02-05 15:44:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:50,839 INFO L225 Difference]: With dead ends: 92202 [2025-02-05 15:44:50,840 INFO L226 Difference]: Without dead ends: 61992 [2025-02-05 15:44:50,915 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:44:50,916 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 115 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1278 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:44:50,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1278 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61992 states. [2025-02-05 15:44:53,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61992 to 61984. [2025-02-05 15:44:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61984 states, 51702 states have (on average 1.6277900274650885) internal successors, (84160), 51709 states have internal predecessors, (84160), 10249 states have call successors, (10249), 31 states have call predecessors, (10249), 32 states have return successors, (11392), 10245 states have call predecessors, (11392), 10246 states have call successors, (11392) [2025-02-05 15:44:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61984 states to 61984 states and 105801 transitions. [2025-02-05 15:44:53,827 INFO L78 Accepts]: Start accepts. Automaton has 61984 states and 105801 transitions. Word has length 185 [2025-02-05 15:44:53,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:53,828 INFO L471 AbstractCegarLoop]: Abstraction has 61984 states and 105801 transitions. [2025-02-05 15:44:53,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 61984 states and 105801 transitions. [2025-02-05 15:44:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-05 15:44:53,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:53,911 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:44:53,912 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:53,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:53,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1036462431, now seen corresponding path program 1 times [2025-02-05 15:44:53,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:53,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558365051] [2025-02-05 15:44:53,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:53,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:53,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 15:44:53,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 15:44:53,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:53,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 15:44:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558365051] [2025-02-05 15:44:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558365051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:53,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:53,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:53,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901068430] [2025-02-05 15:44:53,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:53,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:53,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:53,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:53,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:53,969 INFO L87 Difference]: Start difference. First operand 61984 states and 105801 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:44:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:55,893 INFO L93 Difference]: Finished difference Result 116068 states and 198551 transitions. [2025-02-05 15:44:55,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:55,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 186 [2025-02-05 15:44:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:56,360 INFO L225 Difference]: With dead ends: 116068 [2025-02-05 15:44:56,360 INFO L226 Difference]: Without dead ends: 115832 [2025-02-05 15:44:56,416 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:44:56,418 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 110 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1282 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:44:56,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1282 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:44:56,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115832 states. [2025-02-05 15:44:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115832 to 115824. [2025-02-05 15:45:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115824 states, 97174 states have (on average 1.6228106283573795) internal successors, (157695), 97181 states have internal predecessors, (157695), 18617 states have call successors, (18617), 31 states have call predecessors, (18617), 32 states have return successors, (20806), 18613 states have call predecessors, (20806), 18614 states have call successors, (20806) [2025-02-05 15:45:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115824 states to 115824 states and 197118 transitions. [2025-02-05 15:45:00,508 INFO L78 Accepts]: Start accepts. Automaton has 115824 states and 197118 transitions. Word has length 186 [2025-02-05 15:45:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:00,509 INFO L471 AbstractCegarLoop]: Abstraction has 115824 states and 197118 transitions. [2025-02-05 15:45:00,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:45:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 115824 states and 197118 transitions. [2025-02-05 15:45:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 15:45:00,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:00,659 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:00,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:45:00,659 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:00,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:00,659 INFO L85 PathProgramCache]: Analyzing trace with hash 197604466, now seen corresponding path program 1 times [2025-02-05 15:45:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:00,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999982214] [2025-02-05 15:45:00,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:00,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:00,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 15:45:00,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 15:45:00,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:00,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 15:45:00,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:00,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999982214] [2025-02-05 15:45:00,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999982214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:00,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:00,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:45:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292847839] [2025-02-05 15:45:00,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:00,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:45:00,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:00,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:45:00,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:45:00,830 INFO L87 Difference]: Start difference. First operand 115824 states and 197118 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:45:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:06,539 INFO L93 Difference]: Finished difference Result 222801 states and 380774 transitions. [2025-02-05 15:45:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:45:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 187 [2025-02-05 15:45:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:07,892 INFO L225 Difference]: With dead ends: 222801 [2025-02-05 15:45:07,892 INFO L226 Difference]: Without dead ends: 222573 [2025-02-05 15:45:07,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:45:07,995 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 588 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:45:07,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 3255 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:45:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222573 states. [2025-02-05 15:45:14,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222573 to 222563. [2025-02-05 15:45:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222563 states, 186768 states have (on average 1.6263224963591194) internal successors, (303745), 186723 states have internal predecessors, (303745), 35734 states have call successors, (35734), 58 states have call predecessors, (35734), 60 states have return successors, (39015), 35785 states have call predecessors, (39015), 35730 states have call successors, (39015) [2025-02-05 15:45:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222563 states to 222563 states and 378494 transitions. [2025-02-05 15:45:15,917 INFO L78 Accepts]: Start accepts. Automaton has 222563 states and 378494 transitions. Word has length 187 [2025-02-05 15:45:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:15,918 INFO L471 AbstractCegarLoop]: Abstraction has 222563 states and 378494 transitions. [2025-02-05 15:45:15,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 15:45:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 222563 states and 378494 transitions. [2025-02-05 15:45:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 15:45:16,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:16,072 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:45:16,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:45:16,072 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:16,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash -101250013, now seen corresponding path program 1 times [2025-02-05 15:45:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:16,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263166861] [2025-02-05 15:45:16,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:16,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:45:16,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:45:16,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:16,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-05 15:45:16,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263166861] [2025-02-05 15:45:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263166861] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:45:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919895004] [2025-02-05 15:45:16,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:16,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:45:16,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:45:16,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:45:16,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:45:16,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:45:16,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:45:16,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:16,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:16,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:45:16,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:45:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:45:16,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:45:17,169 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:45:17,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919895004] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:45:17,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:45:17,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-02-05 15:45:17,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787770997] [2025-02-05 15:45:17,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:45:17,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 15:45:17,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:17,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 15:45:17,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:45:17,171 INFO L87 Difference]: Start difference. First operand 222563 states and 378494 transitions. Second operand has 28 states, 26 states have (on average 9.884615384615385) internal successors, (257), 24 states have internal predecessors, (257), 9 states have call successors, (55), 8 states have call predecessors, (55), 12 states have return successors, (47), 11 states have call predecessors, (47), 9 states have call successors, (47)