./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product35.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_product35.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 a235b81518d1466c5f4be9b22c3eaea6ff575e28236a3798a0ed19e321bfc6e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:44:41,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:44:41,611 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:41,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:44:41,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:44:41,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:44:41,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:44:41,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:44:41,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:44:41,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:44:41,633 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:44:41,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:44:41,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:44:41,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:44:41,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:44:41,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:44:41,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:44:41,636 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 -> a235b81518d1466c5f4be9b22c3eaea6ff575e28236a3798a0ed19e321bfc6e0 [2025-02-05 15:44:41,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:44:41,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:44:41,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:44:41,914 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:44:41,914 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:44:41,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product35.cil.c [2025-02-05 15:44:43,127 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06d2b1792/e32147781c764272b01dbd881c245bbc/FLAG59fce3478 [2025-02-05 15:44:43,428 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:44:43,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product35.cil.c [2025-02-05 15:44:43,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06d2b1792/e32147781c764272b01dbd881c245bbc/FLAG59fce3478 [2025-02-05 15:44:43,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/06d2b1792/e32147781c764272b01dbd881c245bbc [2025-02-05 15:44:43,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:44:43,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:44:43,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:44:43,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:44:43,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:44:43,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:44:43" (1/1) ... [2025-02-05 15:44:43,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ecfc84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:43, skipping insertion in model container [2025-02-05 15:44:43,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:44:43" (1/1) ... [2025-02-05 15:44:43,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:44:44,232 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_product35.cil.c[61781,61794] [2025-02-05 15:44:44,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:44:44,260 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:44:44,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-02-05 15:44:44,268 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [392] [2025-02-05 15:44:44,268 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [854] [2025-02-05 15:44:44,268 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [913] [2025-02-05 15:44:44,268 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1973] [2025-02-05 15:44:44,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2372] [2025-02-05 15:44:44,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2507] [2025-02-05 15:44:44,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2873] [2025-02-05 15:44:44,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2908] [2025-02-05 15:44:44,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2925] [2025-02-05 15:44:44,269 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2934] [2025-02-05 15:44:44,346 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_product35.cil.c[61781,61794] [2025-02-05 15:44:44,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:44:44,374 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:44:44,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:44 WrapperNode [2025-02-05 15:44:44,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:44:44,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:44:44,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:44:44,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:44:44,382 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:44" (1/1) ... [2025-02-05 15:44:44,404 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:44" (1/1) ... [2025-02-05 15:44:44,442 INFO L138 Inliner]: procedures = 138, calls = 234, calls flagged for inlining = 66, calls inlined = 63, statements flattened = 1182 [2025-02-05 15:44:44,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:44:44,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:44:44,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:44:44,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:44:44,454 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:44" (1/1) ... [2025-02-05 15:44:44,454 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:44" (1/1) ... [2025-02-05 15:44:44,461 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:44" (1/1) ... [2025-02-05 15:44:44,503 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:44,503 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:44" (1/1) ... [2025-02-05 15:44:44,503 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:44" (1/1) ... [2025-02-05 15:44:44,518 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:44" (1/1) ... [2025-02-05 15:44:44,523 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:44" (1/1) ... [2025-02-05 15:44:44,529 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:44" (1/1) ... [2025-02-05 15:44:44,532 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:44" (1/1) ... [2025-02-05 15:44:44,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:44:44,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:44:44,544 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:44:44,544 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:44:44,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:44" (1/1) ... [2025-02-05 15:44:44,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:44:44,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:44,582 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:44,590 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:44,615 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:44:44,616 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:44:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:44:44,616 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:44:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:44:44,616 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:44:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:44:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:44:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:44:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:44:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:44:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:44:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:44:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:44:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:44:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:44:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:44:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:44:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:44:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:44:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:44:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:44:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:44:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:44:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:44:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:44:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:44:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:44:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:44:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:44:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:44:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:44:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:44:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:44:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:44:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:44:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:44:44,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:44:44,791 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:44:44,793 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:44:44,898 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2279: #res := ~retValue_acc~31; [2025-02-05 15:44:44,908 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: #res := ~retValue_acc~5; [2025-02-05 15:44:44,953 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1562-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~16#1; [2025-02-05 15:44:44,954 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1607: #res#1 := ~retValue_acc~17#1; [2025-02-05 15:44:44,974 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1831: #res := ~retValue_acc~20; [2025-02-05 15:44:44,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1515: #res := ~retValue_acc~15; [2025-02-05 15:44:44,990 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2504-1: createEmail_#res#1 := createEmail_~retValue_acc~37#1; [2025-02-05 15:44:44,998 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1059: #res := ~retValue_acc~9; [2025-02-05 15:44:45,016 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2205: #res := ~retValue_acc~29; [2025-02-05 15:44:45,056 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2242: #res := ~retValue_acc~30; [2025-02-05 15:44:45,062 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2316: #res := ~retValue_acc~32; [2025-02-05 15:44:45,085 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2090: #res := ~retValue_acc~26; [2025-02-05 15:44:45,144 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1385: #res := ~retValue_acc~13; [2025-02-05 15:44:45,335 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~21#1; [2025-02-05 15:44:45,335 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~14#1; [2025-02-05 15:44:45,335 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2353-1: isVerified_#res#1 := isVerified_~retValue_acc~33#1; [2025-02-05 15:44:45,335 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2016-1: getEmailId_#res#1 := getEmailId_~retValue_acc~24#1; [2025-02-05 15:44:45,335 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1950-1: getClientId_#res#1 := getClientId_~retValue_acc~22#1; [2025-02-05 15:44:45,592 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L698-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~3#1; [2025-02-05 15:44:45,593 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1777-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~19#1; [2025-02-05 15:44:45,593 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L689-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~2#1; [2025-02-05 15:44:45,593 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~4#1; [2025-02-05 15:44:45,593 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2905-1: valid_product_#res#1 := valid_product_~retValue_acc~42#1; [2025-02-05 15:44:45,593 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1670-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~18#1; [2025-02-05 15:44:45,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2053: #res := ~retValue_acc~25; [2025-02-05 15:44:45,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: #res#1 := ~retValue_acc~35#1; [2025-02-05 15:44:45,606 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~34#1; [2025-02-05 15:44:45,800 INFO L? ?]: Removed 614 outVars from TransFormulas that were not future-live. [2025-02-05 15:44:45,800 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:44:45,812 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:44:45,813 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:44:45,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:44:45 BoogieIcfgContainer [2025-02-05 15:44:45,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:44:45,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:44:45,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:44:45,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:44:45,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:44:43" (1/3) ... [2025-02-05 15:44:45,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486dd20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:44:45, skipping insertion in model container [2025-02-05 15:44:45,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:44:44" (2/3) ... [2025-02-05 15:44:45,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486dd20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:44:45, skipping insertion in model container [2025-02-05 15:44:45,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:44:45" (3/3) ... [2025-02-05 15:44:45,819 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product35.cil.c [2025-02-05 15:44:45,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:44:45,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product35.cil.c that has 31 procedures, 476 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:44:45,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:44:45,904 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;@70e98a48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:44:45,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:44:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 476 states, 364 states have (on average 1.5302197802197801) internal successors, (557), 371 states have internal predecessors, (557), 80 states have call successors, (80), 30 states have call predecessors, (80), 30 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 15:44:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:44:45,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:45,922 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:45,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:45,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash -250003964, now seen corresponding path program 1 times [2025-02-05 15:44:45,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:45,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631244383] [2025-02-05 15:44:45,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:46,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:44:46,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:44:46,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:46,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:46,595 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:46,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:46,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631244383] [2025-02-05 15:44:46,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631244383] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:46,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168297829] [2025-02-05 15:44:46,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:46,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:46,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:46,605 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:46,606 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:46,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:44:46,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:44:46,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:46,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:46,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:44:46,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:46,979 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:46,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:46,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168297829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:46,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:46,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:44:46,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024199341] [2025-02-05 15:44:46,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:46,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:44:46,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:47,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:44:47,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:47,008 INFO L87 Difference]: Start difference. First operand has 476 states, 364 states have (on average 1.5302197802197801) internal successors, (557), 371 states have internal predecessors, (557), 80 states have call successors, (80), 30 states have call predecessors, (80), 30 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) 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:47,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:47,062 INFO L93 Difference]: Finished difference Result 754 states and 1118 transitions. [2025-02-05 15:44:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:44:47,064 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:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:47,077 INFO L225 Difference]: With dead ends: 754 [2025-02-05 15:44:47,077 INFO L226 Difference]: Without dead ends: 468 [2025-02-05 15:44:47,082 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:47,085 INFO L435 NwaCegarLoop]: 712 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, 712 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:47,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 712 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:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-05 15:44:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-02-05 15:44:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 358 states have (on average 1.5279329608938548) internal successors, (547), 363 states have internal predecessors, (547), 80 states have call successors, (80), 30 states have call predecessors, (80), 29 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-05 15:44:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 704 transitions. [2025-02-05 15:44:47,159 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 704 transitions. Word has length 139 [2025-02-05 15:44:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:47,161 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 704 transitions. [2025-02-05 15:44:47,161 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:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 704 transitions. [2025-02-05 15:44:47,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 15:44:47,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:47,170 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:47,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:44:47,371 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:47,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:47,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash 729451650, now seen corresponding path program 1 times [2025-02-05 15:44:47,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:47,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058888068] [2025-02-05 15:44:47,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:47,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:47,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 15:44:47,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 15:44:47,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:47,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:47,667 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:47,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:47,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058888068] [2025-02-05 15:44:47,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058888068] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984600579] [2025-02-05 15:44:47,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:47,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:47,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:47,672 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:47,674 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:47,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 15:44:48,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 15:44:48,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:48,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:48,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 1322 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:44:48,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:48,046 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:48,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984600579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:48,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:48,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:44:48,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969362505] [2025-02-05 15:44:48,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:48,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:48,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:48,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:48,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:48,050 INFO L87 Difference]: Start difference. First operand 468 states and 704 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:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:48,099 INFO L93 Difference]: Finished difference Result 742 states and 1092 transitions. [2025-02-05 15:44:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:48,099 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:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:48,104 INFO L225 Difference]: With dead ends: 742 [2025-02-05 15:44:48,106 INFO L226 Difference]: Without dead ends: 470 [2025-02-05 15:44:48,108 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:48,109 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 0 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1404 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:48,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1404 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:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-02-05 15:44:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-02-05 15:44:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 360 states have (on average 1.525) internal successors, (549), 365 states have internal predecessors, (549), 80 states have call successors, (80), 30 states have call predecessors, (80), 29 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2025-02-05 15:44:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 706 transitions. [2025-02-05 15:44:48,131 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 706 transitions. Word has length 159 [2025-02-05 15:44:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:48,132 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 706 transitions. [2025-02-05 15:44:48,132 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:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 706 transitions. [2025-02-05 15:44:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:44:48,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:48,134 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:48,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:44:48,334 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:48,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:48,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:48,335 INFO L85 PathProgramCache]: Analyzing trace with hash 546567683, now seen corresponding path program 1 times [2025-02-05 15:44:48,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:48,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711310916] [2025-02-05 15:44:48,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:48,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:48,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:44:48,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:44:48,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:48,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:48,551 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:48,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:48,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711310916] [2025-02-05 15:44:48,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711310916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:48,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519994725] [2025-02-05 15:44:48,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:48,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:48,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:48,556 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:48,558 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:48,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:44:48,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:44:48,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:48,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:48,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:44:48,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:48,883 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:48,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:48,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519994725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:48,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:48,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:44:48,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687375825] [2025-02-05 15:44:48,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:48,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:48,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:48,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:48,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:44:48,885 INFO L87 Difference]: Start difference. First operand 470 states and 706 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:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:48,926 INFO L93 Difference]: Finished difference Result 992 states and 1511 transitions. [2025-02-05 15:44:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:48,926 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:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:48,930 INFO L225 Difference]: With dead ends: 992 [2025-02-05 15:44:48,930 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 15:44:48,932 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:48,932 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 142 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1366 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:48,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1366 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:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 15:44:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 541. [2025-02-05 15:44:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 417 states have (on average 1.5467625899280575) internal successors, (645), 422 states have internal predecessors, (645), 94 states have call successors, (94), 30 states have call predecessors, (94), 29 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:44:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 830 transitions. [2025-02-05 15:44:48,961 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 830 transitions. Word has length 148 [2025-02-05 15:44:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:48,961 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 830 transitions. [2025-02-05 15:44:48,962 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:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 830 transitions. [2025-02-05 15:44:48,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 15:44:48,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:48,968 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:48,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:44:49,168 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:49,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:49,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:49,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1265157542, now seen corresponding path program 1 times [2025-02-05 15:44:49,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:49,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756110041] [2025-02-05 15:44:49,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:49,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:49,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:44:49,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:44:49,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:49,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:49,371 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:49,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:49,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756110041] [2025-02-05 15:44:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756110041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:49,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726783278] [2025-02-05 15:44:49,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:49,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:49,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:49,374 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:49,376 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:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 15:44:49,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 15:44:49,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:49,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:49,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:44:49,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:49,712 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:49,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:49,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726783278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:49,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:49,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:44:49,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852827157] [2025-02-05 15:44:49,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:49,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:49,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:49,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:49,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:49,714 INFO L87 Difference]: Start difference. First operand 541 states and 830 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:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:49,803 INFO L93 Difference]: Finished difference Result 1073 states and 1650 transitions. [2025-02-05 15:44:49,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:49,804 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:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:49,809 INFO L225 Difference]: With dead ends: 1073 [2025-02-05 15:44:49,809 INFO L226 Difference]: Without dead ends: 543 [2025-02-05 15:44:49,812 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:49,813 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 2 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2773 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:49,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2773 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:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-05 15:44:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2025-02-05 15:44:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 418 states have (on average 1.5454545454545454) internal successors, (646), 424 states have internal predecessors, (646), 94 states have call successors, (94), 30 states have call predecessors, (94), 30 states have return successors, (93), 90 states have call predecessors, (93), 91 states have call successors, (93) [2025-02-05 15:44:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 833 transitions. [2025-02-05 15:44:49,844 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 833 transitions. Word has length 149 [2025-02-05 15:44:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:49,844 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 833 transitions. [2025-02-05 15:44:49,844 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:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 833 transitions. [2025-02-05 15:44:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 15:44:49,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:49,847 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:49,857 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:50,050 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:50,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:50,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:50,050 INFO L85 PathProgramCache]: Analyzing trace with hash -302601776, now seen corresponding path program 1 times [2025-02-05 15:44:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:50,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109375448] [2025-02-05 15:44:50,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:50,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:50,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:44:50,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:44:50,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:50,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:50,244 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:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109375448] [2025-02-05 15:44:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109375448] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855747149] [2025-02-05 15:44:50,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:50,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:50,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:50,248 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:50,249 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:50,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 15:44:50,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 15:44:50,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:50,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:50,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:44:50,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:50,591 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:50,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:44:50,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855747149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:50,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:44:50,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:44:50,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623968861] [2025-02-05 15:44:50,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:50,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:50,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:50,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:50,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:50,593 INFO L87 Difference]: Start difference. First operand 543 states and 833 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:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:50,664 INFO L93 Difference]: Finished difference Result 1075 states and 1655 transitions. [2025-02-05 15:44:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:50,664 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:50,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:50,669 INFO L225 Difference]: With dead ends: 1075 [2025-02-05 15:44:50,669 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:44:50,671 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:50,673 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 2 mSDsluCounter, 2065 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2759 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:50,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2759 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:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:44:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:44:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 419 states have (on average 1.5441527446300716) internal successors, (647), 426 states have internal predecessors, (647), 94 states have call successors, (94), 30 states have call predecessors, (94), 31 states have return successors, (98), 90 states have call predecessors, (98), 91 states have call successors, (98) [2025-02-05 15:44:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 839 transitions. [2025-02-05 15:44:50,722 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 839 transitions. Word has length 150 [2025-02-05 15:44:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:50,722 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 839 transitions. [2025-02-05 15:44:50,723 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:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 839 transitions. [2025-02-05 15:44:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:44:50,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:50,726 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:50,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:44:50,926 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:50,927 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:50,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1597905164, now seen corresponding path program 1 times [2025-02-05 15:44:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:50,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201517520] [2025-02-05 15:44:50,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:50,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:44:50,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:44:50,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:50,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:51,072 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:51,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:51,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201517520] [2025-02-05 15:44:51,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201517520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:51,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:51,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:51,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827852996] [2025-02-05 15:44:51,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:51,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:51,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:51,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:51,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:51,074 INFO L87 Difference]: Start difference. First operand 545 states and 839 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:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:51,119 INFO L93 Difference]: Finished difference Result 1067 states and 1646 transitions. [2025-02-05 15:44:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:51,119 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:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:51,123 INFO L225 Difference]: With dead ends: 1067 [2025-02-05 15:44:51,123 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:44:51,125 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:51,125 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 2 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2777 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:51,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2777 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:51,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:44:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:44:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 419 states have (on average 1.5441527446300716) internal successors, (647), 426 states have internal predecessors, (647), 94 states have call successors, (94), 30 states have call predecessors, (94), 31 states have return successors, (97), 90 states have call predecessors, (97), 91 states have call successors, (97) [2025-02-05 15:44:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 838 transitions. [2025-02-05 15:44:51,145 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 838 transitions. Word has length 151 [2025-02-05 15:44:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:51,145 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 838 transitions. [2025-02-05 15:44:51,145 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:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 838 transitions. [2025-02-05 15:44:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 15:44:51,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:51,148 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] [2025-02-05 15:44:51,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:44:51,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:51,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:51,149 INFO L85 PathProgramCache]: Analyzing trace with hash 459766168, now seen corresponding path program 2 times [2025-02-05 15:44:51,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:51,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109670715] [2025-02-05 15:44:51,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:44:51,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:51,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-02-05 15:44:51,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 152 statements. [2025-02-05 15:44:51,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:44:51,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:44:51,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:51,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109670715] [2025-02-05 15:44:51,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109670715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:51,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:51,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:44:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664053627] [2025-02-05 15:44:51,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:51,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:44:51,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:51,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:44:51,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:51,333 INFO L87 Difference]: Start difference. First operand 545 states and 838 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:44:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:51,916 INFO L93 Difference]: Finished difference Result 1530 states and 2330 transitions. [2025-02-05 15:44:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:44:51,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 152 [2025-02-05 15:44:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:51,924 INFO L225 Difference]: With dead ends: 1530 [2025-02-05 15:44:51,924 INFO L226 Difference]: Without dead ends: 1264 [2025-02-05 15:44:51,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:44:51,926 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 1486 mSDsluCounter, 3481 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 4199 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:51,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 4199 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:44:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-02-05 15:44:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1083. [2025-02-05 15:44:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 836 states have (on average 1.5478468899521531) internal successors, (1294), 846 states have internal predecessors, (1294), 184 states have call successors, (184), 60 states have call predecessors, (184), 62 states have return successors, (196), 180 states have call predecessors, (196), 180 states have call successors, (196) [2025-02-05 15:44:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1674 transitions. [2025-02-05 15:44:51,983 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1674 transitions. Word has length 152 [2025-02-05 15:44:51,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:51,984 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1674 transitions. [2025-02-05 15:44:51,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:44:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1674 transitions. [2025-02-05 15:44:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 15:44:51,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:51,989 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:51,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:44:51,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:51,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1339441385, now seen corresponding path program 1 times [2025-02-05 15:44:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862911233] [2025-02-05 15:44:51,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:52,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 15:44:52,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 15:44:52,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:52,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:52,168 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:52,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862911233] [2025-02-05 15:44:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862911233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:52,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:52,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:44:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836844674] [2025-02-05 15:44:52,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:52,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:44:52,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:52,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:44:52,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:44:52,170 INFO L87 Difference]: Start difference. First operand 1083 states and 1674 transitions. Second operand has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 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:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:52,243 INFO L93 Difference]: Finished difference Result 2135 states and 3308 transitions. [2025-02-05 15:44:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:44:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 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 172 [2025-02-05 15:44:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:52,252 INFO L225 Difference]: With dead ends: 2135 [2025-02-05 15:44:52,252 INFO L226 Difference]: Without dead ends: 1087 [2025-02-05 15:44:52,255 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:52,256 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 1 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2780 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:52,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2780 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:52,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-02-05 15:44:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2025-02-05 15:44:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 838 states have (on average 1.5465393794749402) internal successors, (1296), 850 states have internal predecessors, (1296), 184 states have call successors, (184), 60 states have call predecessors, (184), 64 states have return successors, (199), 180 states have call predecessors, (199), 180 states have call successors, (199) [2025-02-05 15:44:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1679 transitions. [2025-02-05 15:44:52,310 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1679 transitions. Word has length 172 [2025-02-05 15:44:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:52,310 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1679 transitions. [2025-02-05 15:44:52,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 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:52,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1679 transitions. [2025-02-05 15:44:52,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 15:44:52,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:52,318 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] [2025-02-05 15:44:52,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:44:52,318 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1417727275, now seen corresponding path program 1 times [2025-02-05 15:44:52,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:52,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644543106] [2025-02-05 15:44:52,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:52,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:52,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 15:44:52,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 15:44:52,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:52,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:44:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:52,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644543106] [2025-02-05 15:44:52,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644543106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:52,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:52,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:44:52,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559577381] [2025-02-05 15:44:52,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:52,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:44:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:52,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:44:52,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:52,499 INFO L87 Difference]: Start difference. First operand 1087 states and 1679 transitions. Second operand has 8 states, 7 states have (on average 13.857142857142858) internal successors, (97), 8 states have internal predecessors, (97), 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:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:52,640 INFO L93 Difference]: Finished difference Result 2133 states and 3300 transitions. [2025-02-05 15:44:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:44:52,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.857142857142858) internal successors, (97), 8 states have internal predecessors, (97), 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:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:52,648 INFO L225 Difference]: With dead ends: 2133 [2025-02-05 15:44:52,649 INFO L226 Difference]: Without dead ends: 1091 [2025-02-05 15:44:52,653 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:52,654 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 7 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4787 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:52,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4787 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:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2025-02-05 15:44:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1089. [2025-02-05 15:44:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 840 states have (on average 1.5452380952380953) internal successors, (1298), 851 states have internal predecessors, (1298), 184 states have call successors, (184), 61 states have call predecessors, (184), 64 states have return successors, (197), 180 states have call predecessors, (197), 180 states have call successors, (197) [2025-02-05 15:44:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1679 transitions. [2025-02-05 15:44:52,698 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1679 transitions. Word has length 154 [2025-02-05 15:44:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:52,699 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1679 transitions. [2025-02-05 15:44:52,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.857142857142858) internal successors, (97), 8 states have internal predecessors, (97), 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:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1679 transitions. [2025-02-05 15:44:52,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 15:44:52,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:52,703 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:52,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:44:52,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:52,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:52,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1352747120, now seen corresponding path program 1 times [2025-02-05 15:44:52,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:52,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694110853] [2025-02-05 15:44:52,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:52,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:52,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 15:44:52,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 15:44:52,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:52,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:52,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:52,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694110853] [2025-02-05 15:44:52,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694110853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:52,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:52,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:44:52,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056294749] [2025-02-05 15:44:52,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:52,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:44:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:52,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:44:52,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:44:52,864 INFO L87 Difference]: Start difference. First operand 1089 states and 1679 transitions. Second operand has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 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:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:53,008 INFO L93 Difference]: Finished difference Result 2147 states and 3320 transitions. [2025-02-05 15:44:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:44:53,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 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 174 [2025-02-05 15:44:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:53,016 INFO L225 Difference]: With dead ends: 2147 [2025-02-05 15:44:53,016 INFO L226 Difference]: Without dead ends: 1099 [2025-02-05 15:44:53,020 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:53,021 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 5 mSDsluCounter, 4111 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4801 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:53,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4801 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:53,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-02-05 15:44:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2025-02-05 15:44:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 846 states have (on average 1.541371158392435) internal successors, (1304), 858 states have internal predecessors, (1304), 184 states have call successors, (184), 62 states have call predecessors, (184), 66 states have return successors, (204), 180 states have call predecessors, (204), 180 states have call successors, (204) [2025-02-05 15:44:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1692 transitions. [2025-02-05 15:44:53,066 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1692 transitions. Word has length 174 [2025-02-05 15:44:53,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:53,066 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1692 transitions. [2025-02-05 15:44:53,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 15.0) internal successors, (105), 8 states have internal predecessors, (105), 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:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1692 transitions. [2025-02-05 15:44:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 15:44:53,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:53,070 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] [2025-02-05 15:44:53,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:44:53,070 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:53,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:53,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1238787832, now seen corresponding path program 1 times [2025-02-05 15:44:53,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:53,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825082801] [2025-02-05 15:44:53,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:53,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:53,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 15:44:53,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 15:44:53,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:53,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:44:53,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:53,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825082801] [2025-02-05 15:44:53,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825082801] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:44:53,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853841916] [2025-02-05 15:44:53,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:53,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:44:53,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:44:53,272 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:53,274 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:53,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 15:44:53,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 15:44:53,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:53,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:53,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:44:53,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:44:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:53,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:44:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 15:44:53,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853841916] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:44:53,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:44:53,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-02-05 15:44:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870057605] [2025-02-05 15:44:53,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:44:53,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:44:53,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:53,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:44:53,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:44:53,708 INFO L87 Difference]: Start difference. First operand 1097 states and 1692 transitions. Second operand has 11 states, 10 states have (on average 15.4) internal successors, (154), 11 states have internal predecessors, (154), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-02-05 15:44:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:54,427 INFO L93 Difference]: Finished difference Result 3065 states and 4936 transitions. [2025-02-05 15:44:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:44:54,428 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.4) internal successors, (154), 11 states have internal predecessors, (154), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 156 [2025-02-05 15:44:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:54,440 INFO L225 Difference]: With dead ends: 3065 [2025-02-05 15:44:54,440 INFO L226 Difference]: Without dead ends: 2023 [2025-02-05 15:44:54,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 309 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:54,446 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 1688 mSDsluCounter, 4250 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 4946 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:44:54,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 4946 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:44:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2025-02-05 15:44:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1975. [2025-02-05 15:44:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1566 states have (on average 1.6015325670498084) internal successors, (2508), 1577 states have internal predecessors, (2508), 342 states have call successors, (342), 63 states have call predecessors, (342), 66 states have return successors, (387), 338 states have call predecessors, (387), 338 states have call successors, (387) [2025-02-05 15:44:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3237 transitions. [2025-02-05 15:44:54,548 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3237 transitions. Word has length 156 [2025-02-05 15:44:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:54,548 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 3237 transitions. [2025-02-05 15:44:54,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.4) internal successors, (154), 11 states have internal predecessors, (154), 4 states have call successors, (38), 2 states have call predecessors, (38), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-02-05 15:44:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3237 transitions. [2025-02-05 15:44:54,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-05 15:44:54,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:54,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,565 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:54,761 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,SelfDestructingSolverStorable10 [2025-02-05 15:44:54,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:54,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:54,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1720463697, now seen corresponding path program 1 times [2025-02-05 15:44:54,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:54,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40442576] [2025-02-05 15:44:54,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:54,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:54,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-05 15:44:54,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-05 15:44:54,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:54,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:54,833 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:54,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:54,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40442576] [2025-02-05 15:44:54,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40442576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:54,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:54,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:54,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574400907] [2025-02-05 15:44:54,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:54,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:54,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:54,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:54,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:54,836 INFO L87 Difference]: Start difference. First operand 1975 states and 3237 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:54,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:54,939 INFO L93 Difference]: Finished difference Result 4637 states and 7728 transitions. [2025-02-05 15:44:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:54,940 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 178 [2025-02-05 15:44:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:54,959 INFO L225 Difference]: With dead ends: 4637 [2025-02-05 15:44:54,959 INFO L226 Difference]: Without dead ends: 2811 [2025-02-05 15:44:54,967 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:54,968 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 139 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1420 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:54,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1420 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:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2025-02-05 15:44:55,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2795. [2025-02-05 15:44:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2795 states, 2228 states have (on average 1.6238779174147218) internal successors, (3618), 2239 states have internal predecessors, (3618), 500 states have call successors, (500), 63 states have call predecessors, (500), 66 states have return successors, (570), 496 states have call predecessors, (570), 496 states have call successors, (570) [2025-02-05 15:44:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 4688 transitions. [2025-02-05 15:44:55,114 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 4688 transitions. Word has length 178 [2025-02-05 15:44:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:55,114 INFO L471 AbstractCegarLoop]: Abstraction has 2795 states and 4688 transitions. [2025-02-05 15:44:55,114 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:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 4688 transitions. [2025-02-05 15:44:55,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 15:44:55,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:55,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:44:55,129 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:55,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:55,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1710788075, now seen corresponding path program 1 times [2025-02-05 15:44:55,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:55,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375684277] [2025-02-05 15:44:55,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:55,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 15:44:55,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 15:44:55,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:55,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:55,193 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:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:55,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375684277] [2025-02-05 15:44:55,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375684277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:55,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:55,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141945705] [2025-02-05 15:44:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:55,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:55,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:55,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:55,196 INFO L87 Difference]: Start difference. First operand 2795 states and 4688 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:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:55,306 INFO L93 Difference]: Finished difference Result 6693 states and 11325 transitions. [2025-02-05 15:44:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:55,307 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 179 [2025-02-05 15:44:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:55,328 INFO L225 Difference]: With dead ends: 6693 [2025-02-05 15:44:55,329 INFO L226 Difference]: Without dead ends: 4149 [2025-02-05 15:44:55,338 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:55,339 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 137 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1408 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:55,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1408 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:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2025-02-05 15:44:55,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 4133. [2025-02-05 15:44:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4133 states, 3328 states have (on average 1.6364182692307692) internal successors, (5446), 3339 states have internal predecessors, (5446), 738 states have call successors, (738), 63 states have call predecessors, (738), 66 states have return successors, (824), 734 states have call predecessors, (824), 734 states have call successors, (824) [2025-02-05 15:44:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4133 states to 4133 states and 7008 transitions. [2025-02-05 15:44:55,535 INFO L78 Accepts]: Start accepts. Automaton has 4133 states and 7008 transitions. Word has length 179 [2025-02-05 15:44:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:55,535 INFO L471 AbstractCegarLoop]: Abstraction has 4133 states and 7008 transitions. [2025-02-05 15:44:55,535 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:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4133 states and 7008 transitions. [2025-02-05 15:44:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 15:44:55,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:55,556 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:55,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:44:55,556 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:55,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1725729369, now seen corresponding path program 1 times [2025-02-05 15:44:55,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:55,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750464830] [2025-02-05 15:44:55,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:55,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:55,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 15:44:55,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 15:44:55,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:55,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:55,637 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:55,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:55,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750464830] [2025-02-05 15:44:55,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750464830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:55,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:55,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:55,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907779823] [2025-02-05 15:44:55,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:55,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:55,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:55,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:55,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:55,639 INFO L87 Difference]: Start difference. First operand 4133 states and 7008 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:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:55,859 INFO L93 Difference]: Finished difference Result 9827 states and 16813 transitions. [2025-02-05 15:44:55,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:55,860 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 161 [2025-02-05 15:44:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:55,898 INFO L225 Difference]: With dead ends: 9827 [2025-02-05 15:44:55,899 INFO L226 Difference]: Without dead ends: 6209 [2025-02-05 15:44:55,917 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:55,918 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 135 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1395 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:55,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1395 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:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2025-02-05 15:44:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 6193. [2025-02-05 15:44:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6193 states, 5064 states have (on average 1.646129541864139) internal successors, (8336), 5075 states have internal predecessors, (8336), 1062 states have call successors, (1062), 63 states have call predecessors, (1062), 66 states have return successors, (1198), 1058 states have call predecessors, (1198), 1058 states have call successors, (1198) [2025-02-05 15:44:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6193 states to 6193 states and 10596 transitions. [2025-02-05 15:44:56,204 INFO L78 Accepts]: Start accepts. Automaton has 6193 states and 10596 transitions. Word has length 161 [2025-02-05 15:44:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:56,204 INFO L471 AbstractCegarLoop]: Abstraction has 6193 states and 10596 transitions. [2025-02-05 15:44:56,205 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:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 6193 states and 10596 transitions. [2025-02-05 15:44:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 15:44:56,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:56,232 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:44:56,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:44:56,233 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:56,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1989877471, now seen corresponding path program 1 times [2025-02-05 15:44:56,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:56,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436948347] [2025-02-05 15:44:56,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:56,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:56,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 15:44:56,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 15:44:56,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:56,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:56,314 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:56,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:56,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436948347] [2025-02-05 15:44:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436948347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792027354] [2025-02-05 15:44:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:56,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:56,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:56,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:56,317 INFO L87 Difference]: Start difference. First operand 6193 states and 10596 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (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:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:56,535 INFO L93 Difference]: Finished difference Result 14793 states and 25519 transitions. [2025-02-05 15:44:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:56,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (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:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:56,583 INFO L225 Difference]: With dead ends: 14793 [2025-02-05 15:44:56,583 INFO L226 Difference]: Without dead ends: 9545 [2025-02-05 15:44:56,610 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,611 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 133 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1395 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:56,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1395 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:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2025-02-05 15:44:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9529. [2025-02-05 15:44:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9529 states, 7910 states have (on average 1.6530973451327433) internal successors, (13076), 7921 states have internal predecessors, (13076), 1552 states have call successors, (1552), 63 states have call predecessors, (1552), 66 states have return successors, (1771), 1548 states have call predecessors, (1771), 1548 states have call successors, (1771) [2025-02-05 15:44:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9529 states to 9529 states and 16399 transitions. [2025-02-05 15:44:56,987 INFO L78 Accepts]: Start accepts. Automaton has 9529 states and 16399 transitions. Word has length 162 [2025-02-05 15:44:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:56,987 INFO L471 AbstractCegarLoop]: Abstraction has 9529 states and 16399 transitions. [2025-02-05 15:44:56,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (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:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 9529 states and 16399 transitions. [2025-02-05 15:44:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 15:44:57,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:57,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:44:57,027 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:57,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash 658279155, now seen corresponding path program 1 times [2025-02-05 15:44:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:57,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653875613] [2025-02-05 15:44:57,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:57,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:57,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 15:44:57,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 15:44:57,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:57,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:57,130 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:57,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:57,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653875613] [2025-02-05 15:44:57,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653875613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:57,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:57,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:57,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278718081] [2025-02-05 15:44:57,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:57,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:57,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:57,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:57,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:57,132 INFO L87 Difference]: Start difference. First operand 9529 states and 16399 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:57,482 INFO L93 Difference]: Finished difference Result 23083 states and 40052 transitions. [2025-02-05 15:44:57,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:57,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:57,545 INFO L225 Difference]: With dead ends: 23083 [2025-02-05 15:44:57,545 INFO L226 Difference]: Without dead ends: 15153 [2025-02-05 15:44:57,576 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:57,577 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 131 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1409 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:57,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1409 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:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15153 states. [2025-02-05 15:44:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15153 to 15137. [2025-02-05 15:44:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15137 states, 12532 states have (on average 1.6530481966166612) internal successors, (20716), 12543 states have internal predecessors, (20716), 2538 states have call successors, (2538), 63 states have call predecessors, (2538), 66 states have return successors, (2901), 2534 states have call predecessors, (2901), 2534 states have call successors, (2901) [2025-02-05 15:44:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 26155 transitions. [2025-02-05 15:44:58,362 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 26155 transitions. Word has length 182 [2025-02-05 15:44:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:44:58,363 INFO L471 AbstractCegarLoop]: Abstraction has 15137 states and 26155 transitions. [2025-02-05 15:44:58,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 26155 transitions. [2025-02-05 15:44:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 15:44:58,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:44:58,488 INFO L218 NwaCegarLoop]: trace histogram [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, 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:58,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:44:58,488 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:44:58,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:44:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -779936126, now seen corresponding path program 1 times [2025-02-05 15:44:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:44:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827051648] [2025-02-05 15:44:58,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:44:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:44:58,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 15:44:58,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 15:44:58,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:44:58,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:44:58,558 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:58,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:44:58,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827051648] [2025-02-05 15:44:58,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827051648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:44:58,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:44:58,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:44:58,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434037779] [2025-02-05 15:44:58,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:44:58,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:44:58,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:44:58,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:44:58,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:44:58,561 INFO L87 Difference]: Start difference. First operand 15137 states and 26155 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:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:44:59,061 INFO L93 Difference]: Finished difference Result 38103 states and 66244 transitions. [2025-02-05 15:44:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:44:59,062 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 164 [2025-02-05 15:44:59,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:44:59,169 INFO L225 Difference]: With dead ends: 38103 [2025-02-05 15:44:59,169 INFO L226 Difference]: Without dead ends: 25357 [2025-02-05 15:44:59,206 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:59,207 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 129 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1402 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:59,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1402 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:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25357 states. [2025-02-05 15:44:59,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25357 to 25341. [2025-02-05 15:45:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25341 states, 21092 states have (on average 1.6545609709842595) internal successors, (34898), 21103 states have internal predecessors, (34898), 4182 states have call successors, (4182), 63 states have call predecessors, (4182), 66 states have return successors, (4734), 4178 states have call predecessors, (4734), 4178 states have call successors, (4734) [2025-02-05 15:45:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25341 states to 25341 states and 43814 transitions. [2025-02-05 15:45:00,139 INFO L78 Accepts]: Start accepts. Automaton has 25341 states and 43814 transitions. Word has length 164 [2025-02-05 15:45:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:00,140 INFO L471 AbstractCegarLoop]: Abstraction has 25341 states and 43814 transitions. [2025-02-05 15:45:00,140 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:45:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 25341 states and 43814 transitions. [2025-02-05 15:45:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-05 15:45:00,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:00,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:45:00,216 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:00,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 712364820, now seen corresponding path program 1 times [2025-02-05 15:45:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926414120] [2025-02-05 15:45:00,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:00,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-05 15:45:00,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-05 15:45:00,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:00,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:00,280 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,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:00,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926414120] [2025-02-05 15:45:00,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926414120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:00,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:00,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:00,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573833402] [2025-02-05 15:45:00,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:00,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:00,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:00,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:00,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:00,281 INFO L87 Difference]: Start difference. First operand 25341 states and 43814 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:45:01,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:01,395 INFO L93 Difference]: Finished difference Result 60665 states and 104854 transitions. [2025-02-05 15:45:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:01,396 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 184 [2025-02-05 15:45:01,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:01,592 INFO L225 Difference]: With dead ends: 60665 [2025-02-05 15:45:01,592 INFO L226 Difference]: Without dead ends: 39709 [2025-02-05 15:45:01,671 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:45:01,671 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 127 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1372 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:45:01,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1372 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39709 states. [2025-02-05 15:45:03,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39709 to 39693. [2025-02-05 15:45:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39693 states, 33038 states have (on average 1.631938979357104) internal successors, (53916), 33049 states have internal predecessors, (53916), 6588 states have call successors, (6588), 63 states have call predecessors, (6588), 66 states have return successors, (7565), 6584 states have call predecessors, (7565), 6584 states have call successors, (7565) [2025-02-05 15:45:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39693 states to 39693 states and 68069 transitions. [2025-02-05 15:45:03,276 INFO L78 Accepts]: Start accepts. Automaton has 39693 states and 68069 transitions. Word has length 184 [2025-02-05 15:45:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:03,276 INFO L471 AbstractCegarLoop]: Abstraction has 39693 states and 68069 transitions. [2025-02-05 15:45:03,276 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:45:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 39693 states and 68069 transitions. [2025-02-05 15:45:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-05 15:45:03,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:03,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:45:03,385 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:03,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1827024744, now seen corresponding path program 1 times [2025-02-05 15:45:03,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:03,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037280170] [2025-02-05 15:45:03,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:03,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:03,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-05 15:45:03,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-05 15:45:03,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:03,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:03,449 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:03,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:03,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037280170] [2025-02-05 15:45:03,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037280170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:03,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:03,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838124961] [2025-02-05 15:45:03,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:03,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:03,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:03,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:03,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:03,451 INFO L87 Difference]: Start difference. First operand 39693 states and 68069 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:45:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:04,977 INFO L93 Difference]: Finished difference Result 104759 states and 180455 transitions. [2025-02-05 15:45:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:04,977 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 185 [2025-02-05 15:45:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:05,341 INFO L225 Difference]: With dead ends: 104759 [2025-02-05 15:45:05,341 INFO L226 Difference]: Without dead ends: 70789 [2025-02-05 15:45:05,460 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:45:05,460 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 125 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1398 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:45:05,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1398 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70789 states. [2025-02-05 15:45:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70789 to 70773. [2025-02-05 15:45:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70773 states, 59218 states have (on average 1.6297071836266) internal successors, (96508), 59229 states have internal predecessors, (96508), 11488 states have call successors, (11488), 63 states have call predecessors, (11488), 66 states have return successors, (13279), 11484 states have call predecessors, (13279), 11484 states have call successors, (13279) [2025-02-05 15:45:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70773 states to 70773 states and 121275 transitions. [2025-02-05 15:45:08,473 INFO L78 Accepts]: Start accepts. Automaton has 70773 states and 121275 transitions. Word has length 185 [2025-02-05 15:45:08,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:08,474 INFO L471 AbstractCegarLoop]: Abstraction has 70773 states and 121275 transitions. [2025-02-05 15:45:08,474 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:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 70773 states and 121275 transitions. [2025-02-05 15:45:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-05 15:45:08,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:08,624 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:45:08,624 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:08,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1004800021, now seen corresponding path program 1 times [2025-02-05 15:45:08,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:08,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149329489] [2025-02-05 15:45:08,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:08,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:08,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-05 15:45:08,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-05 15:45:08,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:08,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:08,694 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:08,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149329489] [2025-02-05 15:45:08,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149329489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:08,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:08,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217681593] [2025-02-05 15:45:08,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:08,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:08,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:08,697 INFO L87 Difference]: Start difference. First operand 70773 states and 121275 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (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:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:11,911 INFO L93 Difference]: Finished difference Result 192893 states and 331169 transitions. [2025-02-05 15:45:11,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:11,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (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:45:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:12,482 INFO L225 Difference]: With dead ends: 192893 [2025-02-05 15:45:12,482 INFO L226 Difference]: Without dead ends: 129737 [2025-02-05 15:45:12,657 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:45:12,659 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 123 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1410 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:45:12,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1410 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:12,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129737 states. [2025-02-05 15:45:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129737 to 129721. [2025-02-05 15:45:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129721 states, 109140 states have (on average 1.6262415246472421) internal successors, (177488), 109151 states have internal predecessors, (177488), 20514 states have call successors, (20514), 63 states have call predecessors, (20514), 66 states have return successors, (23369), 20510 states have call predecessors, (23369), 20510 states have call successors, (23369) [2025-02-05 15:45:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129721 states to 129721 states and 221371 transitions. [2025-02-05 15:45:17,742 INFO L78 Accepts]: Start accepts. Automaton has 129721 states and 221371 transitions. Word has length 186 [2025-02-05 15:45:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:45:17,743 INFO L471 AbstractCegarLoop]: Abstraction has 129721 states and 221371 transitions. [2025-02-05 15:45:17,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (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:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 129721 states and 221371 transitions. [2025-02-05 15:45:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 15:45:18,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:45:18,461 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 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:18,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:45:18,462 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:45:18,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:45:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1804359452, now seen corresponding path program 1 times [2025-02-05 15:45:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:45:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043845662] [2025-02-05 15:45:18,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:45:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:45:18,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:45:18,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:45:18,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:45:18,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:45:18,511 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:45:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:45:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043845662] [2025-02-05 15:45:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043845662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:45:18,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:45:18,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:45:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715008092] [2025-02-05 15:45:18,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:45:18,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:45:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:45:18,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:45:18,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:45:18,512 INFO L87 Difference]: Start difference. First operand 129721 states and 221371 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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:45:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:45:22,623 INFO L93 Difference]: Finished difference Result 243191 states and 415870 transitions. [2025-02-05 15:45:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:45:22,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 168 [2025-02-05 15:45:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:45:23,519 INFO L225 Difference]: With dead ends: 243191 [2025-02-05 15:45:23,520 INFO L226 Difference]: Without dead ends: 242647 [2025-02-05 15:45:23,618 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:45:23,619 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 118 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1404 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:45:23,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1404 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:45:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242647 states.